olymmath

HMMT 2004 U38

  • Guts
  • Answer

Let S={p1p2⋯pn∣p1,p2,…,pnS=\left\{p_{1} p_{2} \cdots p_{n} \mid p_{1}, p_{2}, \ldots, p_{n}\right. are distinct primes and p1,…,pn<30}\left.p_{1}, \ldots, p_{n}<30\right\}. Assume 1 is in SS. Let a1a_{1} be an element of SS. We define, for all positive integers nn :

an+1=an/(n+1) if an is divisible by n+1an+1=(n+2)an if an is not divisible by n+1\begin{gathered} a_{n+1}=a_{n} /(n+1) \text { if } a_{n} \text { is divisible by } n+1 \\ a_{n+1}=(n+2) a_{n} \\ \text { if } a_{n} \text { is not divisible by } n+1 \end{gathered}

How many distinct possible values of a1a_{1} are there such that aj=a1a_{j}=a_{1} for infinitely many jj 's?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

512

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/2004/u38 · Tag SQXPQD6J19 · Edit this page on GitHub · Keys: j next, k previous