All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Prove SG's theorem (Posted on 2016-07-12) Difficulty: 2 of 5
Prove that a4+4 is never prime for any a bigger than 1.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Factoring Solution | Comment 2 of 3 |
a^4+4 is a special case of a^4+4b^2, with b=1.  
Factoring a^4+4b^2 = (a^2+2ab+2b)*(a^2-2ab+2b).

Substitute b=1 to get (a^2+2a+2)*(a^2-2a+2).  The first term is greater than 1 for any a!=-1.  For the product to be prime one of the factors must equal 1.

For any integer a greater than 1 or less than -1, both terms are positive integers greater than 1, which makes the product composite.

This leaves a=-1, 0, 1 as potential prime generators If a=1 or -1 then a^4+4=5 (prime), and if a=0 then a^4+4=4 (composite).

Then the set of all integer values a which make a^4+4 prime is {-1,1}.

  Posted by Brian Smith on 2016-07-12 10:59:44
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information