Discrete Maths strong induction question

Question

(1) Prove using strong induction that every integer n > 4 can be written as a sum of two or more prime numbers. (N.B. The prime numbers do not have to be different).

Answer 1

Then add 2 repeatedly.

Induction hypothesis:

N can be written as said sum containing at least 2 primes.

N+1, can be written as

N+12X+1 where N=2x

which by induction hypothesis, the sum contains at least two primes.