This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2015 NIMO Problems, 5
Compute the number of subsets $S$ of $\{0,1,\dots,14\}$ with the property that for each $n=0,1,\dots, 6$, either $n$ is in $S$ or both of $2n+1$ and $2n+2$ are in $S$. [i]Proposed by Evan Chen[/i]
counting subset binary trees combinatorics