Difference between revisions of "1994 AIME Problems/Problem 1"
| (4 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | The increasing [[sequence]] <math>3, 15, 24, 48, \ldots\,</math> consists of those [[positive]] multiples of 3 that are one less than a [[perfect square]]. What is the [[remainder]] when the 1994th term of the sequence is divided by 1000? | ||
== Solution == | == Solution == | ||
| + | One less than a perfect square can be represented by <math>n^2 - 1 = (n+1)(n-1)</math>. Either <math>n+1</math> or <math>n-1</math> must be divisible by 3. This is true when <math>n \equiv -1,\ 1 \equiv 2,\ 1 \pmod{3}</math>. Since 1994 is even, <math>n</math> must <math>\equiv 1 \pmod{3}</math>. It will be the <math>\frac{1994}{2} = 997</math>th such term, so <math>n = 4 + (997-1) \cdot 3 = 2992</math>. The value of <math>n^2 - 1 = 2992^2 - 1 \pmod{1000}</math> is <math>063</math>. | ||
== See also == | == See also == | ||
| − | + | {{AIME box|year=1994|before=First question|num-a=2}} | |
| + | |||
| + | [[Category:Introductory Number Theory Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 19:27, 4 July 2013
Problem
The increasing sequence 
consists of those positive multiples of 3 that are one less than a perfect square. What is the remainder when the 1994th term of the sequence is divided by 1000?
Solution
One less than a perfect square can be represented by 
. Either 
or 
must be divisible by 3. This is true when 
. Since 1994 is even, 
must 
. It will be the 
th such term, so 
. The value of 
is 
.
See also
| 1994 AIME (Problems • Answer Key • Resources) | ||
| Preceded by First question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
