Pythagorean primes have the form 
, where n is an integer, and they can be written as the sum of squares of two integers. More information is available at Wikipedia, Numberphile, and the Online Encyclopedia of Integer Sequences.
, where n is an integer, and they can be written as the sum of squares of two integers. More information is available at Wikipedia, Numberphile, and the Online Encyclopedia of Integer Sequences.Compute the nth Pythagorean prime p and two integers a and b such that 
.
.Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers98
Suggested Problems
-
Which values occur exactly three times?
5234 Solvers
-
Circular Primes (based on Project Euler, problem 35)
649 Solvers
-
Check that number is whole number
5184 Solvers
-
3385 Solvers
-
1245 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Hey. I have some troubles submitting my solution to this problem. Since yesterday I keep having the message : "The server is not available. Wait a few minutes, and then retry your request. If the problem persists, contact the instructor." My solution when I tested it in the pad successufully passes through all the tests though. Any idea what the problem could be ?
@Nicolas Douillet
I think its because your code is taking too long to run. you need to make your code fast so that it can be compiled within the given time and satisfy all the test cases.