MathDB
Problems
Contests
National and Regional Contests
Turkey Contests
National Olympiad First Round
2001 National Olympiad First Round
15
P15 [Number Theory] - Turkish NMO 1st Round - 2001
P15 [Number Theory] - Turkish NMO 1st Round - 2001
Source:
April 20, 2014
modular arithmetic
Problem Statement
How many different solutions does the congruence
x
3
+
3
x
2
+
x
+
3
≡
0
(
m
o
d
25
)
x^3+3x^2+x+3 \equiv 0 \pmod{25}
x
3
+
3
x
2
+
x
+
3
≡
0
(
mod
25
)
have?
<
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
>
2
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
a
n
>
4
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
a
n
>
5
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
a
n
>
6
<span class='latex-bold'>(A)</span>\ 0 \qquad<span class='latex-bold'>(B)</span>\ 2 \qquad<span class='latex-bold'>(C)</span>\ 4 \qquad<span class='latex-bold'>(D)</span>\ 5 \qquad<span class='latex-bold'>(E)</span>\ 6
<
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
>
2
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
an
>
4
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
an
>
5
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
an
>
6
Back to Problems
View on AoPS