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

30 Solutions

24 Solvers

Last Solution submitted on Apr 14, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers24

George Berken Riccardo G. 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!