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
PIVlab surpasses 100K all-time File Exchange downloads
During the past twelve months, PIVlab, a MATLAB Community Toolbox for particle...
Mike Croucher in General
4
8
View Post
LLMs with MATLAB updated to support the latest OpenAI Models
Large Languge model with MATLAB, a free add-on that lets you access...
Toshiaki Takeuchi in Generative AI
2
4
View Post

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!