1999 AIME Problems/Problem 1
Problem
Find the smallest prime that is the fifth term of an increasing arithmetic sequence, all four preceding terms also being prime.
Solution
Obviously, all of the terms must be odd. The common difference between the terms cannot be or
, since otherwise there would be a number in the sequence that is divisible by
. However, if the common difference is
, we find that
, and
form an arithmetic sequence. Thus, the answer is
.
Alternate Solution
If we let the arithmetic sequence to be , and
, where
is a prime number and
is a positive integer, we can see that
cannot be multiple of
or
or
. Smallest such prime number is
, and from a quick observation we can see that when
is
, the terms of the sequence are all prime numbers. The sequence becomes
, so the answer is
.
See also
1999 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.