Re: proove that n^4 + n is never prime
From: Adam (adam_at_bonkers.reg)
Date: 06/10/04
- Next message: mina_world: "algebra~.."
- Previous message: Ken Oliver: "Re: proove that n^4 + n is never prime"
- In reply to: DanKage: "Re: proove that n^4 + n is never prime"
- Next in thread: Adam: "Re: proove that n^4 + n is never prime"
- Reply: Adam: "Re: proove that n^4 + n is never prime"
- Reply: DanKage: "Re: proove that n^4 + n is never prime"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 10 Jun 2004 09:50:30 GMT
"DanKage" <eba012@webmail.uib.no> wrote in message
news:nhagc0d64mecpn6edvob9jfe7lnv95kr48@4ax.com...
> Sorry, the statement is that n^4 + 4 is never prime (NOT n^4 + n)
>
>
Proof.
We prove that the statement is not prime by showing that when n is even or
odd, the statement is not prime, and hence it is not prime for all n >= 2.
Let n be an even integer and n >= 2. Then n = 2k for some k, where k is an
integer. n^4 + 4 = (2k)^4 + 4 = 2^4*k^4 + 4 = 4(4k^4 + 1), which is not
prime since it is a multiple of 4. Now let n be an odd integer and n >= 2.
Then n = 2k + 1 for some k, where k is an integer. n^4 + 4 = (2k + 1)^4 + 4
= 4^2(k/2 + 1/2)^4 + 4 = 4[4(k/2 + 1/2)^4 + 1], which is not prime since it
is a multiple of 4. Since n^4 + 4 is not prime if n is even or odd, n^4 + 4
is not prime for all n >= 2. QED.
Since n is an integer it is either even or odd. One can then prove that the
statement is not prime by showing the separate cases are not prime, which
taken together mean that the statement is not prime for all n.
I hope this helps, and good luck!, Adam.
- Next message: mina_world: "algebra~.."
- Previous message: Ken Oliver: "Re: proove that n^4 + n is never prime"
- In reply to: DanKage: "Re: proove that n^4 + n is never prime"
- Next in thread: Adam: "Re: proove that n^4 + n is never prime"
- Reply: Adam: "Re: proove that n^4 + n is never prime"
- Reply: DanKage: "Re: proove that n^4 + n is never prime"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|