Leyland Primes - MATLAB Cody - MATLAB Central

Problem 54700. Leyland Primes

Difficulty:
(5)
Rate
A Leyland Number is defined as a number of the form - x^y + y^x, or, x^y - y^x (x,y)>1
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 -
Solve

Solution Stats

30.77% Correct | 69.23% Incorrect
Last Solution submitted on Jan 02, 2025

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers6

Suggested Problems

More from this Author31

Problem Tags

number theory primes

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page