Weird permutations

Find the number of permutations \(f\) on \(\{1, 2, 3, \ldots, 32\}\) such that if \(m\) divides \(n\), then \(f(m)\) divides \(f(n)\).

×

Problem Loading...

Note Loading...

Set Loading...