Of the form n, n+2, n+4
We have 3, 5, 7
29, 31 ,33 etc
I guess they must be infinite? How is it proved.
I realise the final digit has to be in the pattern 9,1,3 or 7,9,1 but what next?
If you assume n=3k then case closed
n=3k+1 then n+2=3(k+1)
n=3k+2 then n+4=3(k+2)
So, that proves it?
How would you formally write this assuming nothing excepting basic axioms or addition etc.
Are there any other proofs?
Is there any way of obtaining every single proof of a question like this in general? Suppose you found 10 proofs out of 10, how would you prove or ascertain that there is no eleventh proof? Or is this idiotic speculation?
If you add the three you get 3(n+2), is it true that the sum of 3 different integers, if divisible by three, then at least one of the three must also be divisible by three? How is this proved, if so?
proof theory, but at the very least we'd need to decide on some criteria for setting up an equivalence relation between proofs; for example, merely changing variable names should not be considered making a new proof. Your question could touch on the field of computer proof checking and Godel's famous theorems.