MathForces: Math Olympiads
MathForces - Math Olympiadsβeta
Login Register

Divisible sets

Author: mathforces
Problem has been solved: 6 times

Русский язык | English Language

In how many ways can you choose $8$ subsets $S_1, S_2, \dots, S_8$ of the set $\{0,1 \}$ in such a way that $S_a$ contains $S_b$ if $a$ is divisible by $b$?

Sorry, you need to login into your account