Difference between revisions of "1994 AIME Problems/Problem 1"

Revision as of 19:27, 4 July 2013

Problem

The increasing sequence $3, 15, 24, 48, \ldots\,$ 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 $n^2 - 1 = (n+1)(n-1)$ . Either $n+1$ or $n-1$ must be divisible by 3. This is true when $n \equiv -1,\ 1 \equiv 2,\ 1 \pmod{3}$ . Since 1994 is even, $n$ must $\equiv 1 \pmod{3}$ . It will be the $\frac{1994}{2} = 997$ th such term, so $n = 4 + (997-1) \cdot 3 = 2992$ . The value of $n^2 - 1 = 2992^2 - 1 \pmod{1000}$ is $063$ .

Revision as of 18:59, 4 December 2007 (view source) Temperal (talk \| contribs) (category) ← Older edit		Revision as of 19:27, 4 July 2013 (view source) Nathan wailes (talk \| contribs) Newer edit →
Line 9:		Line 9:

	[[Category:Introductory Number Theory Problems]]		[[Category:Introductory Number Theory Problems]]
		+	{{MAA Notice}}

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

Page

Toolbox

Search

Difference between revisions of "1994 AIME Problems/Problem 1"

Revision as of 19:27, 4 July 2013

Problem

Solution

See also