MathDB
Problems
Contests
National and Regional Contests
USA Contests
MAA AMC
AMC 8
2011 AMC 8
24
Number Of Ways
Number Of Ways
Source:
November 23, 2011
Problem Statement
In how many ways can 10001 be written as the sum of two primes?
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
A
)
<
/
s
p
a
n
>
0
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
B
)
<
/
s
p
a
n
>
1
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
a
n
>
2
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
a
n
>
3
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
a
n
>
4
<span class='latex-bold'>(A)</span>0\qquad<span class='latex-bold'>(B)</span>1\qquad<span class='latex-bold'>(C)</span>2\qquad<span class='latex-bold'>(D)</span>3\qquad<span class='latex-bold'>(E)</span>4
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
A
)
<
/
s
p
an
>
0
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
B
)
<
/
s
p
an
>
1
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
an
>
2
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
an
>
3
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
an
>
4
Back to Problems
View on AoPS