1. The problem statement, all variables and given/known data How to prove the following: Let p be a prime p=3,5 (mod8). Show that the sequence n!+n^p-n+2 contains at most finitely many squares. Should I build a contardiction or prove it directly? I really need some help 2. The attempt at a solution Use Fermats Little we have n^p-n=0 (mod p) then n!+n^p-n+2=n!+2(mod p) how should i keep going??