The \(n^{\text{th}}\) spread polynomial, denoted by Sn(s), is recursively defined by S0(s)≡0, S1(s)≡s, and
Sn(s)≡2(1−2s)Sn−1(s)−Sn−2(s)+2s,
for n≥2. We will, for the context of this note, restrict our discussion to the finite field Fp, where p is an odd prime. As an example, we see that in F3,
S0(0)=0s0(1)=0s0(2)=0
S1(0)=0s1(1)=1s1(2)=2
S2(0)=0s2(1)=0s2(2)=1
S3(0)=0s3(1)=1s3(2)=0
S4(0)=0s4(1)=0s4(2)=2
S5(0)=0s5(1)=1s5(2)=1
S6(0)=0s6(1)=0s6(2)=0
In fact, for any positive integer n we will have that Sn(s)=Sn+6(s). Thus, a natural question to be asked is whether this phenomenon is also seen for arbitrary finite fields; as it turns out, it does and in fact we have Sn(s)=Sn+k(s) in Fp, where k≡21(p−1)(p+1). How do we prove that this is true? Are we able to discern other patterns within particular values of s? If so, how do we ascertain this mathematically?
#NumberTheory
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.