olymmath

AMC 12 2006b Problem 25

  • Paper

A sequence a1,a2,…a_1,a_2,\dots of non-negative integers is defined by the rule an+2=∣an+1−an∣a_{n+2}=|a_{n+1}-a_n| for n≥1n\geq 1. If a1=999a_1=999, a2<999a_2<999 and a2006=1a_{2006}=1, how many different values of a2a_2 are possible?

(A) 165(B) 324(C) 495(D) 499(E) 660\mathrm{(A)}\ 165 \mathrm{(B)}\ 324 \mathrm{(C)}\ 495 \mathrm{(D)}\ 499 \mathrm{(E)}\ 660

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

B

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 amc12/2006b/p25 · Tag 2V7HDKWBEN · Edit this page on GitHub · Keys: j next, k previous