LX.4 (1992)
Then
pKp (0) ≡ −pKp (p)
1 + (−1)[(p−5)/10] 5(p−1)/4 F(p+( 5 ))/2 (mod p2 )
p
if p ≡ 1 (mod 4) ,
≡ [(p−5)/10] (p−3)/4 2
1 + (−1) 5 L(p+( p
5
))/2 (mod p )
if p ≡ 3 (mod 4) ;
if p ≡ 1 (mod 4) ,
≡
5
(−1)[(p−5)/10] 5(p−3)/4 L(p−( 5 ))/2 (mod p2 )
p p
if p ≡ 3 (mod 4) ;
Kp (3p) ≡ 0 (mod p) .
P r o o f. Note that
p−1 p−1
X 1 X −1
Kp (p − r) = ≡ = −Kp (r) (mod p) .
k p−k
k=1 k=1
k≡p−r (mod 5) p−k≡r (mod 5)
So we have
Kp (0) ≡ −Kp (p) (mod p) , Kp (2p) ≡ −Kp (−p) = −Kp (4p) (mod p) ,
Kp (3p) ≡ −Kp (−2p) = −Kp (3p) (mod p) hence Kp (3p) ≡ 0 (mod p) .
By Theorem 1, if an integer m is not divisible by 5 then
∆10 (8 + 2m, p) − ∆10 (8 − 2m, p)
±2 · 5(p+3)/4 F(p+1)/2 if p ≡ 1 (mod 4) ,
±[∆10 (0, p) − ∆10 (6, p)] = ±2 · 5(p+1)/4 L(p+1)/2
if p ≡ 3 (mod 4) ,
m ≡ ±1 (mod 5) ;
when
= (p+3)/4
±2 · 5 F(p−1)/2 if p ≡ 1 (mod 4) ,
±[∆ 10 (2, p) − ∆ 10 (4, p)] = ±2 · 5 (p+1)/4
L(p−1)/2 if p ≡ 3 (mod 4) ,
m ≡ ±2 (mod 5)
when
Fibonacci numbers and Fermat’s last theorem 377
(
(−1)[2m/5] · 10 · 5(p−1)/4 F(p+( m5 ))/2 if p ≡ 1 (mod 4) ,
=
(−1)[2m/5] · 10 · 5(p−3)/4 L(p+( m5 ))/2 if p ≡ 3 (mod 4) .
(−1)(p+1)/2
[∆10 (8 + 2m2 , p) − ∆10 (8 − 2m2 , p)]
10
−(−1)[2m2 /5] 5(p−1)/4 F(p+( m52 ))/2
[(p−5)/10] 5 (p−1)/4
= (−1) 5 F(p−( p5 ))/2 if p ≡ 1 (mod 4) ,
p
=
(−1)[2m2 /5] 5(p−3)/4 L(p+( m52 ))/2
[(p−5)/10] 5
= (−1) 5(p−3)/4 L(p−( p5 ))/2 if p ≡ 3 (mod 4) .
p
To complete the proof, we notice that
p−1 p−1
X (−1)k−1 X (−1)k−1
pKp (0) = p −p
k k
k=1 k=1
10 | k+5 10 | k
p p
≡ T−5(10) − (T0(10) − 1) (mod p2 ) (by Lemma 2)
p p p p
=1+ Tp+5(10) − T0(10) =1− (Tp(10) − T5(10) )
378 Zhi-Hong Sun and Zhi-Wei Sun
= 1 + (−1)(p−1)/2 [T p 3+(−1)(p+1)/2
p
− T 3+(−1)(p−1)/2 ]
p+ 2 ·5(10) 2 ·5(10)
(−1)(p−1)/2 p + 1 3 + (−1)(p+1)/2
=1+ ∆10 + · 5, p
10 2 2
1 − p 3 + (−1)(p−1)/2
− ∆10 + · 5, p
2 2
(−1)(p−1)/2 p + (−1)(p+1)/2 5
=1+ ∆10 8 + ,p
10 2
p + (−1)(p+1)/2 5
− ∆10 8 − ,p
2
(−1)(p−1)/2
=1+ [∆10 (8 + 2m1 , p) − ∆10 (8 − 2m1 , p)]
10
and that
p−1 p−1
X (−1)k−1 X (−1)k−1
pKp (2p) = p −p
k k
k=1 k=1
k≡2p+5 (mod 10) k≡2p (mod 10)
p p
≡ T2p+5(10) − T2p(10) (mod p2 ) (by Lemma 2)
p p p p
= T2p+5(10)− T−p(10) = −(T2p(10) − T−p+5(10) )
p
= (−1) (p+1)/2
[T 1+(−1)(p+1)/2
− Tp 1+(−1)(p+1)/2
]
2p+ 2 ·5(10) −p+ 2 ·5(10)
(−1)(p+1)/2 1 + (−1)(p+1)/2
p+1
= ∆10 +p+ · 5, p
10 2 2
1 + (−1)(p+1)/2
p+1
− ∆10 − 2p + · 5, p
2 2
(−1)(p+1)/2 p + (−1)(p+1)/2 5
= ∆10 8 + · 3, p
10 2
p + (−1)(p+1)/2 5
− ∆10 8 − · 3, p
2
(−1)(p+1)/2
= [∆10 (8 + 2m2 , p) − ∆10 (8 − 2m2 , p)] .
10
and
F(p−( p5 ))/2 ≡ (−1)[(p−5)/10] 5(p−1)/4 pKp (2p) (mod p2 ) .
(b) If p ≡ 3 (mod 4) then
[(p−5)/10] 5
L(p+( p5 ))/2 ≡ (−1) 5(p+1)/4 [p(Kp (0) + 12 qp (5)) − 1] (mod p2 )
p
and
L(p−( p5 ))/2 ≡ (−1)[(p−5)/10] 5(p+1)/4 pKp (2p) (mod p2 ) .
P r o o f. Observe that
1 1 (p−1)/2 5 (p−1)/2 5
pqp (5) = 5 + 5 −
2 2 p p
1 5 5 5 (p−1)/2
≡ ·2 5(p−1)/2 − = 5 − 1 (mod p2 ) .
2 p p p
Now let us prove part (b). (Part (a) can be proved similarly.) Suppose
p ≡ 3 (mod 4). From Theorem 2 and the above observation we have
5 (p+1)/4
5 p(Kp (0) + 12 qp (5))
p
≡ 5(p+1)/4 (pKp (0) + 12 pqp (5))/5(p−1)/2 (mod p2 )
(p+1)/4
≡5 1 + (−1)[(p−5)/10] 5(p−3)/4 L(p+( p5 ))/2
5 (p−1)/2
+ 5 −1 5(p−1)/2 (mod p2 )
p
[(p−5)/10] 5 (p+1)/4
= (−1) L(p+( p5 ))/2 + 5
p
and
(p+1)/4 5 (p+1)/4
5 pKp (2p) ≡ 5 pKp (2p)/5(p−1)/2 (mod p2 )
p
5 (p+1)/4 [(p−5)/10] 5 (p−3)/4
≡ 5 (−1) 5 L(p−( p5 ))/2 5(p−1)/2 (mod p2 )
p p
= (−1)[(p−5)/10] L(p−( p5 ))/2 .
This yields the desired result.
Corollary 2. Let p 6= 2, 5 be a prime. We have
(i) 2Kp (0) − Kp (2p) + 12 qp (5) ≡ 0 (mod p) .
(ii) If p ≡ 1 (mod 4) then
L(p+( p5 ))/2 ≡ (−1)[(p−5)/10] 5(p−1)/4 [p(3Kp (2p) − Kp (0)) − 1] (mod p2 ) ,
380 Zhi-Hong Sun and Zhi-Wei Sun
5 (p−1)/4 1
L(p−( p5 ))/2 ≡ (−1)[(p−5)/10] 5 ( 2 pqp (5) − 2) (mod p2 ) .
p
(iii) If p ≡ 3 (mod 4) then
F(p+( p5 ))/2 ≡ (−1)[(p−5)/10] 5(p−3)/4 [p(3Kp (2p) − Kp (0)) − 1] (mod p2 ) ,
[(p−5)/10] 5
F(p−( p5 ))/2 ≡ (−1) 5(p−3)/4 ( 12 pqp (5) − 2) (mod p2 ) .
p
P r o o f. By part (i) of Theorem A one has
L(p−1)/2 = 2F(p+1)/2 − F(p−1)/2 ,
L(p+1)/2 = 2F(p+3)/2 − F(p+1)/2 = 2F(p−1)/2 + F(p+1)/2 ,
5F(p−1)/2 = 2L(p+1)/2 − L(p−1)/2 ,
5F(p+1)/2 = 2L(p+3)/2 − L(p+1)/2 = 2L(p−1)/2 + L(p+1)/2 .
It follows from Corollary 1 that
[(p−5)/10] 5
(−1) 5[(p−1)/4] [p(2Kp (0) + qp (5) − Kp (2p)) − 2]
p
5
2
2F(p+( p5 ))/2 − p F(p−( p5 ))/2 = L(p−( p5 ))/2 (mod p )
if p ≡ 1 (mod 4) ,
≡
1 5
2L(p+( p5 ))/2 − L(p−( p5 ))/2 = F(p−( p5 ))/2 (mod p2 )
5 p
if p ≡ 3 (mod 4)
and that
(−1)[(p−5)/10] 5[(p−1)/4] [p(2Kp (2p) + Kp (0) + 21 qp (5)) − 1]
5
2F(p−( p5 ))/2 + F 5 = L(p+( p5 ))/2 (mod p2 )
p (p+( p ))/2
if p ≡ 1 (mod 4) ,
≡
1 5 2
5 2L(p−( p5 ))/2 + p L(p+( p5 ))/2 = F(p+( p5 ))/2 (mod p )
if p ≡ 3 (mod 4) .
For (i)–(iii) to hold it is sufficient to prove
− ( p5 )
(p−1)/2
5 5
2Kp (0) − Kp (2p) + qp (5) ≡ (≡ 12 qp (5)) (mod p) ,
p p
i.e.,
(p−1)/2 5
[1 − p(2Kp (0) + qp (5) − Kp (2p))]5 ≡ (mod p2 ) .
p
Fibonacci numbers and Fermat’s last theorem 381
5F(p−( 5
))/2
− L2(p−( 5 ))/2 (mod p2 ) if p ≡ 3 (mod 4)
p p
(By Corollary 1, p | F(p−( p5 ))/2 if p ≡ 1 (mod 4), p | L(p−( p5 ))/2 if p ≡ 3 (mod 4).)
2
(by Theorem A). If p ≡ 1 (mod 4) then p | F(p−( p5 ))/2 (by p | Kp (2p) and
Corollary 1) and hence
5 5
Lp−( p5 ) ≡ 5 · 0 + 2(−1)(p−( p ))/2 = 2 (mod p4 ) .
p
If p ≡ 3 (mod 4) then p2 | L(p−( p5 ))/2 (by p | Kp (2p) and Corollary 1) and
thus
5
(p−( p ))/2 5
Lp−( p5 ) ≡ 0 − 2(−1) =2 (mod p4 ) .
p
This proves part (ii).
Concerning part (iii) we have
1 1 1
1+ + + ... +
2 3 [p/10]
[p/5]
X 1 [p/5]
X (−1)k [p/5]
X (−1)k [p/5]
X (−1)k
= + ≡ ≡− (mod p)
k k k p−k
k=1 k=1 k=1 k=1
(by Lemma 4)
p−1 p−1 p−1−[p/5]
X (−1)k−1 (−1)k−1
X X (−1)k
=− =− +
k k k
k=p−[p/5] k=1 k=1
2 − 2 5 Fp−( p5 )
p
≡− + · (mod p)
p 2 p
(by Eisenstein’s and Williams’ results)
≡ 0 (mod p) (by Wieferich’s result and part (i)).
This concludes the proof.
R e m a r k 5. By Theorem 4, FLT1 is implied by the positive answer to
Wall’s question (see [13]). According to Williams [14], p2 - Fp−( p5 ) for every
odd prime p less than 109 .
Let d ∈ Z+ . By Remark 1, d is a divisor of some positive Fibonacci
number. Let n(d) denote the least positive integer n such that d divides Fn .
From Theorem B we have
d | Fm ⇔ d | (Fm , Fn(d) ) ⇔ d | F(m,n(d)) ⇔ (m, n(d)) = n(d) ⇔ n(d) | m
and
n(d) | m ⇒ Fn(d) | Fm ⇒ d | Fm ⇒ n(d) | m .
386 Zhi-Hong Sun and Zhi-Wei Sun
by showing
Fmn1 ...nk > Fn21 . . . Fn2k ≥ [Fn1 , . . . , Fnk ]2 (and hence p2 > Fmn1 ...nk ) .
In fact, if n1 > 1 = n2 = . . . = nk then m > 1 (since Fmn1 = pFn1 > Fn1 )
and hence by Lemma 6
Fmn1 ...nk = Fmn1 ≥ F2n1 > F22 Fn21 = Fn21 = Fn21 . . . Fn2k ;
if n1 ≥ n2 ≥ . . . ≥ ns > 1 = ns+1 = . . . = nk (s ≥ 2) then by Remark 6
Fmn1 ...nk = Fmn1 ...ns ≥ Fn1 ...ns > Fn21 . . . Fn2s = Fn21 . . . Fn2k .
This completes the proof of the claim.
Since FLT holds for the exponents 3, 5 we assume p > 5. By the claim
pkFmn1 ...nk . Since n(p) | mn1 . . . nk and Fn(p) | Fmn1 ...nk we have pkFn(p)
and hence n(p) 6= n(p2 ). Applying Lemma 5 we get p2 - Fp−( p5 ) . From this
and Theorem 4 it follows that FLT1 holds for the exponent p.
Examples. Since 7 = 21/3 = F8 /F4 , 61 = 610/(2 · 5) = F15 /[F3 , F5 ], by
Theorem 5 FLT1 holds for the exponents 7 and 61.
Corollary 4. FLT1 holds for all (odd ) Fibonacci primes and Lucas
primes.
P r o o f. Observe that Fn = Fn·1 /F1 and that Ln = F2n /Fn . Applying
Theorem 5 we obtain the desired result.
Added in proof. Prof. A. Schinzel informs us that part (iii) of Theorem 4 has been
claimed earlier by L. Skula, Fermat’s Last Theorem and the Fermat quatient at the 9th
Czechoslovak Conference on Number Theory (Račkova Dolina 1989).
References
[1] L. E. D i c k s o n, History of the Theory of Numbers, Vol. I, Chelsea, New York 1952,
105, 393–396.
[2] G. H. H a r d y and E. M. W r i g h t, An Introduction to the Theory of Numbers, 5th
ed., Oxford Univ. Press, Oxford 1981, 148–150.
[3] E. L e h m e r, On the quartic character of quadratic units, J. Reine Angew. Math.
268/269 (1974), 294–301.
[4] L. J. M o r d e l l, Diophantine Equations, Academic Press, London and New York
1969, 60–61.
[5] P. R i b e n b o i m, 13 Lectures on Fermat’s Last Theorem, Springer, New York 1979,
139–159.
388 Zhi-Hong Sun and Zhi-Wei Sun
n
X
n
[6] Zhi-Hong S u n, Combinatorial sum k and its applications in number
k=0
k≡r (mod m)
theory (I), J. Nanjing Univ. Biquarterly, in press.
n
X
n
[7] —, Combinatorial sum k and its applications in number theory (II),
k=0
k≡r (mod m)
ibid., in press.
[8] Zhi-Wei S u n, A congruence for primes,
X preprint, 1991.
n
[9] —, On the combinatorial sum k , submitted.
Xk≡r (mod m)
n
[10] —, Combinatorial sum k and its number-theoretical applications, to
k≡r (mod 12)
appear.
[11] —, Reduction of unknowns in Diophantine representations, Science in China
(Ser. A) 35 (1992), 1–13.
[12] H. S. V a n d i v e r, Extension of the criteria of Wieferich and Mirimanoff in connec-
tion with Fermat’s last theorem, J. Reine Angew. Math. 144 (1914), 314–318.
[13] D. D. W a l l, Fibonacci series modulo m, Amer. Math. Monthly 67 (1960), 525–532.
[14] H. C. W i l l i a m s, A note on the Fibonacci quotient Fp−ε /p, Canad. Math. Bull. 25
(1982), 366–370.
DEPARTMENT OF MATHEMATICS
NANJING UNIVERSITY
NANJING 210008
PEOPLE’S REPUBLIC OF CHINA
Received on 27.11.1990
and in revised form on 16.5.1991 (2101)