olymmath

AIME 2002a Problem 9

  • Paper
  • Answer

Harold, Tanya, and Ulysses paint a very long picket fence. Call the positive integer 100h+10t+u100h+10t+u paintable when the triple (h,t,u)(h,t,u) of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers.

Dataset text AIME 1983 to 2026. Quoted with source.

Show the answer

757

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/2002a/p9 · Tag CYQNN2M0GF · Edit this page on GitHub · Keys: j next, k previous