olymmath

AIME 2014b Problem 15

  • Paper
  • Answer

For any integer k≥1k\geq 1, let p(k)p(k) be the smallest prime which does not divide k.k. Define the integer function X(k)X(k) to be the product of all primes less than p(k)p(k) if p(k)>2p(k)>2, and X(k)=1X(k)=1 if p(k)=2.p(k)=2. Let {xn}\{x_n\} be the sequence defined by x0=1x_0=1, and xn+1X(xn)=xnp(xn)x_{n+1}X(x_n)=x_np(x_n) for n≥0.n\geq 0. Find the smallest positive integer tt such that xt=2090.x_t=2090.

Dataset text AIME 1983 to 2026. Quoted with source.

Show the answer

149

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

Locator aime/2014b/p15 · Tag 3CEXB38ED4 · Edit this page on GitHub · Keys: j next, k previous