Difference between revisions of "2011 AMC 8 Problems/Problem 24"

(Solution 2 is completely wrong. If this were to be applied to the number 100001 (33 if interpreted in binary), 33 can be written as the sum of 2 primes as 2+31, but 99999 is not prime.))
m (Solution 2(Simple))
Line 13: Line 13:
  
 
==Solution 2(Simple)==
 
==Solution 2(Simple)==
First, we noticed that 10001 is equal to 5000+5001, if you subtract n to 5000 and add n to 5001, you always get an even number, even number is never a prime number except 2. We try 2 and 9999 but we can see 9999 is divisible by 3 and 9 clearly. So the answer is <math>\boxed{\textbf{(A)} 0}</math>
+
First, we noticed that 10001 is equal to 5000+5001, if you subtract n to 5000 and add n to 5001, you always get an even number, even number is never a prime number except 2. We also see that whenever an addend is an odd number, the other addend will be even, so having an odd number as an addend is not possible, other than 9999 and 2, because 2 is a prime. We try 2 and 9999 but we can see 9999 is divisible by 3 and 9 clearly. So the answer is <math>\boxed{\textbf{(A)} 0}</math>
  
 
==Video Solution==
 
==Video Solution==

Revision as of 21:40, 5 November 2023

Problem

In how many ways can $10001$ be written as the sum of two primes?

$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$

Solution

For the sum of two numbers to be odd, one must be odd and the other must be even, because all odd numbers are of the form $2n+1$ where n is an integer, and all even numbers are of the form $2m$ where m is an integer. \[2n + 1 + 2m = 2m + 2n + 1 = 2(m+n) + 1\] and $m+n$ is an integer because $m$ and $n$ are both integers. The only even prime number is $2,$ so our only combination could be $2$ and $9999.$ However, $9999$ is clearly divisible by $3$, so the number of ways $10001$ can be written as the sum of two primes is $\boxed{\textbf{(A)}\ 0}$

Solution 2(Simple)

First, we noticed that 10001 is equal to 5000+5001, if you subtract n to 5000 and add n to 5001, you always get an even number, even number is never a prime number except 2. We also see that whenever an addend is an odd number, the other addend will be even, so having an odd number as an addend is not possible, other than 9999 and 2, because 2 is a prime. We try 2 and 9999 but we can see 9999 is divisible by 3 and 9 clearly. So the answer is $\boxed{\textbf{(A)} 0}$

Video Solution

https://youtu.be/qJuoLucUn9o by David

Video Solution 2

https://youtu.be/GqTHx0tOB4o

~savannahsolver

See Also

2011 AMC 8 (ProblemsAnswer KeyResources)
Preceded by
Problem 23
Followed by
Problem 25
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
All AJHSME/AMC 8 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png