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];
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers25
Suggested Problems
-
1353 Solvers
-
Sum all integers from 1 to 2^n
17890 Solvers
-
Create a vector whose elements depend on the previous element
802 Solvers
-
Find and replaces spaces from a input string with *
172 Solvers
-
Check that number is whole number
5431 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
