Is this a proof by cases?
Recall that a positive integer p is called prime if p is not equal to 1 and if the only positive integers which divide p are 1 and p itself. Prove that for all positive integers n, if n^3 +1 is a prime number, then n =1.
This seems to be a simple proof by cases. By substituting in 2m for even and then 2m + 1 for odd we get. (2m)^3 + 1= 8m^3 +1. Now this is where I get stuck. I think that by some sort of rule this must always divide something. Am I on the right track?
For the odd case we let n = 2m+1. As a result we get (2m+1)^3 + 1 which will always be even because when you multiply out inside the parenthesis you get an even + 1 then you add the 1 outside the parenthesis giving you an even number. This will as a result always divide 2 and because it is greater than 1 satisfies our second case.
I am probably missing something here. Any help would be greatly appreciated.