2001 CEMC Gauss (Grade 8) Problems/Problem 12
Revision as of 18:02, 20 October 2025 by Anabel.disher (talk | contribs) (Created page with "{{Duplicate|2001 CEMC Gauss (Grade 8) #12 and 2001 CEMC Gauss (Grade 7) #15}} ==Problem== A pri...")
- The following problem is from both the 2001 CEMC Gauss (Grade 8) #12 and 2001 CEMC Gauss (Grade 7) #15, so both problems redirect to this page.
Problem
A prime number is called a “Superprime” if doubling it, and then subtracting , results in another prime number. The number of Superprimes less than
is
Solution 1
First, we can list all of the prime numbers that are less than . They are
,
,
,
,
, and
. Now, we can test if these are super primes.
, which is prime, so
is a superprime.
, which is prime, so
is a superprime.
, which is composite due to being divisible by
, so
is not a superprime.
, which is prime, so
is a superprime.
, which is composite, so
is not a superprime
, which is composite, so
is not a superprime.
We see that of the primes in the list, there were superprimes.
~anabel.disher
2001 CEMC Gauss (Grade 8) (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
CEMC Gauss (Grade 8) |
2001 CEMC Gauss (Grade 7) (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Problem 16 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
CEMC Gauss (Grade 7) |