Problem 56260. Leonardo primes

• Created by Lenka Hanakova

×

Like (3)

Difficulty:

(19)

Rate

• Solve Later   
• Add To GroupÂ

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

76.92% Correct | 23.08% Incorrect

• 26 Solutions
• 20 Solvers

Last Solution submitted on Aug 30, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers20

Suggested Problems

• Quote Doubler

  3331 Solvers

• Nearest

  170 Solvers

• Back to basics 9 - Indexed References

  447 Solvers

• Find max

  10397 Solvers

• Find the nearest integer

  352 Solvers