How to prove the following:
Let p be a prime p=3,5 (mod8). Show that the
sequence n!+n^p-b+2 contains at most finitely many squares.
Should I build a contardiction or prove it directly? I really need some help
Follow Math Help Forum on Facebook and Google+
the sequence should be n!+n^p-n+2/[QUOTE]
View Tag Cloud