Show that

is composite for all n when n is an integer.
Just a verification required
Assume

is prime. Then some prime p,


which means

This however means that

as the only prime number to divide 4 in such a way that it produces an integer answer... because you can't have a composite or prime decimal as far as I know. Having p restricted in such a way, means that the

will be a fraction for some n (try n = 1) then

isn't a natural number. Hence, a contradiction is reached assuming that it was prime to start with.
Hence, it must be composite.
*edit* 1...is..not...a...prime....number....
*edit twice, mainly because you dont_need_to_factorise... i factorized for whatever reason (ie: it was cool to do so)*