If n > 1 is an integer not of the form 6k + 3, prove that n2 + 2n is composite. [Hint: Show that either 2 or 3 divides n2 + 2n.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.