Problem 54700. Leyland Primes
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
Show
1 older comment
Tim
on 5 Jun 2022
24^5+25^12 in test case 6 is greater than 2^53 and therefore cannot be tested using ordinary double precision numbers.
Dyuman Joshi
on 5 Jun 2022
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.
ChrisR
on 5 Jun 2022
Dyuman, it looks like Test 6 is still being applied.
Dyuman Joshi
on 5 Jun 2022
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!
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
305 Solvers
-
63 Solvers
-
485 Solvers
-
Factorial: Unlimited Size : java.math
42 Solvers
-
Tony's trick for duplicating an mx1 vector n times
52 Solvers
More from this Author31
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!