MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN M Problems
27
27
Part of
PEN M Problems
Problems
(1)
M 27
Source:
5/25/2007
Let
p
≥
3
p \ge 3
p
≥
3
be a prime number. The sequence
{
a
n
}
n
≥
0
\{a_{n}\}_{n \ge 0}
{
a
n
}
n
≥
0
is defined by
a
n
=
n
a_{n}=n
a
n
=
n
for all
0
≤
n
≤
p
−
1
0 \le n \le p-1
0
≤
n
≤
p
−
1
, and
a
n
=
a
n
−
1
+
a
n
−
p
a_{n}=a_{n-1}+a_{n-p}
a
n
=
a
n
−
1
+
a
n
−
p
for all
n
≥
p
n \ge p
n
≥
p
. Compute
a
p
3
(
m
o
d
p
)
a_{p^{3}}\; \pmod{p}
a
p
3
(
mod
p
)
.
modular arithmetic
calculus
induction
vector
abstract algebra
algebra
polynomial