# Need help on an easy proof for everyone

• March 7th 2010, 12:28 AM
FamilyGuy34
Need help on an easy proof for everyone
nvm
• March 7th 2010, 03:11 AM
tonio
Quote:

Originally Posted by FamilyGuy34
prove that if p1, p2, ....... pn are distinct prime numbers with p1 = 2 and n > 1, then p1, p2,........pn +1 can be written in the form 4k + 3 for some integer k

Hint: I know that every odd integer can be written as 4k + 3 for an integer k

Try to write 5 as 4k+3, for some integer k....(Smirk)

And the first claim's false, too: $2\cdot 3=6$ cannot be written as 4k+3 for no integer k.

Check what you're trying to achieve.

Tonio