Given an array of numbers(>1), check if the corresponding numbers are Leyland Primes (Leyland Number and a prime) or not.
Example -
x=17, y=1 (2^3+3^2 and a prime)
x=1, y=0 (3^2-2^3 but not a prime)
x=2, y=0 (a prime but not a layland number)
x=8, y=0 (2^2+2^2 but not a prime)
x=37, y=1 (a prime but not a layland number)
x=7, y=1 (2^5-5^2 and a prime)
See the test suite for banned functions -
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers7
Suggested Problems
-
The Goldbach Conjecture, Part 2
2412 Solvers
-
1869 Solvers
-
Give me Hamming on five, hold the mayo
55 Solvers
-
244 Solvers
-
55 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
24^5+25^12 in test case 6 is greater than 2^53 and therefore cannot be tested using ordinary double precision numbers.
Tim, William, Chris -
The faulty test case has been edited out of the test suite. Apologies for the inconvenience. Please attempt/edit your answer accordingly.
Dyuman, it looks like Test 6 is still being applied.
I thought commenting it out would work, but it didn't. I have removed it completely and rescored the solutions, good to go.
Do rate the problem!