ManualCountingAndCasework Basic
2013


Problem - 1818

How many ways can all six numbers in the set $\{4, 3, 2, 12, 1, 6\}$ be ordered so that $a$ comes before $b$ whenever $a$ is a divisor of $b$?


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error