For rational numbers p1/q1 and p2/q2 where p∤q1,p∤q2. If p∣(p1q2−p2q1), we write p1/q1≡p2/q2(modp).
We begin with Sa modulo p. Observe: p∣((kp)), k=1,⋯,p−1 and
p1(kp)=k!(p−1)(p−2)⋯(p−k+1)≡k!(−1)⋅(−2)⋯(−k+1)=(−1)k−1(modp).
Then, we have
Sa=−k=1∑p−1k(−a)k(−1)k−1≡−k=1∑p−1(−a)k⋅p1(kp)(modp).
The right-hand side of the above expression is an integer. By the binomial theorem, we obtain
−k=1∑p−1(−a)k⋅p1(kp)=−p1(−1−(−a)p+k=1∑p(−a)k(kp))=p(a−1)p−ap+1
since p is odd. Hence
Sa≡p(a−1)p−ap+1(modp).
Finally, we obtain
S3+S4−3S2≡p(2p−3p+1)+(3p−4p+1)−3(1p−2p+1)=p4⋅2p−4p−4=−p(2p−2)2(modp).
By Fermat's theorem, p∣(2p−2), so p2∣(2p−2)2. Therefore
S3+S4−3S2≡0(modp).