Prove that for all is composite
This is not true if n is a multiple of 5, because and therefore .
On the other hand, if n is not a multiple of 5 then and so has an inverse (mod 11). Therefore , so the result is true in that case.
But I don't see how to prove that is composite when n is a multiple of 5.