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 Solvers23
Suggested Problems
-
Flip the main diagonal of a matrix
904 Solvers
-
Return the first and last characters of a character array
11829 Solvers
-
Set the array elements whose value is 13 to 0
1438 Solvers
-
5158 Solvers
-
Height of a right-angled triangle
2018 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
