olymmath

HMMT 2020 T10

  • Team
  • Answer

Let nn be a fixed positive integer, and choose nn positive integers a1,…,ana_{1}, \ldots, a_{n}. Given a permutation π\pi on the first nn positive integers, let Sπ={i∣aiπ(i)S_{\pi}=\left\{i \left\lvert \frac{a_{i}}{\pi(i)}\right.\right. is an integer }\}. Let NN denote the number of distinct sets SπS_{\pi} as π\pi ranges over all such permutations. Determine, in terms of nn, the maximum value of NN over all possible values of a1,…,ana_{1}, \ldots, a_{n}.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2^{n}-n

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2020/t10 · Tag 5VS5RX0WGR · Edit this page on GitHub · Keys: j next, k previous