To prove that for a prime p≡1(mod7), there exists some positive integer m such that m3+m2−2m−1 is a multiple of p, we can proceed as follows:
1. Understanding the Problem:
We need to show that there exists an integer m such that p divides m3+m2−2m−1. This means we need to find m such that:
m3+m2−2m−1≡0(modp)
2. Cyclotomic Polynomial Insight:
Since p≡1(mod7), p can be expressed in the form p=7k+1 for some integer k. This implies that p has a primitive 7th root of unity modulo p. The 7th cyclotomic polynomial is given by:
Φ7(x)=x6+x5+x4+x3+x2+x+1
We need to relate this polynomial to our given polynomial m3+m2−2m−1.
3. Substitution:
To make the cyclotomic polynomial appear, we use the substitution m=x+x1. This substitution is motivated by the fact that the roots of the cyclotomic polynomial are of the form e2πik/7 for k=0,1,…,6.
4. Polynomial Transformation:
Substitute m=x+x1 into the polynomial m3+m2−2m−1:
m3=(x+x1)3=x3+3x+x3+x31
m2=(x+x1)2=x2+2+x21
−2m=−2(x+x1)=−2x−x2
−1=−1
Combining these, we get:
m3+m2−2m−1=(x3+x31+3x+x3)+(x2+x21+2)−(2x+x2)−1
Simplifying, we get:
m3+m2−2m−1=x3+x31+x2+x21+x+x1+1−1
=x3+x31+x2+x21+x+x1
5. **Existence of a with Order 7 Modulo p:**
Since p≡1(mod7), there exists an integer a such that a has order 7 modulo p. This means a7≡1(modp) and ak≡1(modp) for 1≤k<7.
6. Conclusion:
By choosing x=a, where a is a primitive 7th root of unity modulo p, we ensure that x7≡1(modp). Therefore, the polynomial m3+m2−2m−1 will be zero modulo p for some m.
■