Leonardo numbers are defined by following recurrence relation:
Leonard prime is Leonardo number which is also prime (see https://en.wikipedia.org/wiki/Leonardo_number).
For given n, find all Leonardo primes.
Example:
n=5;
LeoNumbers=[1 1 3 5 9 15];
Primes=[2 3 5 7 11 13];
LeoPrimes=[3 5];
Solve

Solution Stats

31 Solutions

25 Solvers

Last Solution submitted on Jun 03, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers25

Chris Cleveland George Berken Hong Son Lorenzo

Suggested Problems

Problem Tags

Community Treasure Hunt

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

Start Hunting!