Problem 46046. Determine whether a number is a cluster prime

• Created by ChrisR

×

Like (4)

Difficulty:

(662)

Rate

• Solve Later   
• Add To GroupÂ

A cluster prime is an odd prime number p such that all even numbers less than or equal to can be expressed as a difference of two primes q and that are no larger than p.

Write a function to determine whether a number is a cluster prime.

Solve

Solution Stats

54.76% Correct | 45.24% Incorrect

• 42 Solutions
• 18 Solvers

Last Solution submitted on Sep 08, 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 Solvers18

Suggested Problems

• Project Euler: Problem 1, Multiples of 3 and 5

  3384 Solvers

• Back to basics 23 - Triangular matrix

  1037 Solvers

• Make a Star Pyramid

  197 Solvers

• Convert given decimal number to binary number.

  2115 Solvers

• String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values

  1729 Solvers

More from this Author292

• List ways to make a sum in Killer Sudoku

  3 Solvers

• Count the square-full divisors of a number

  7 Solvers

• Determine whether one vector is a subset of another

  13 Solvers

• List numbers that are not in the Fibonacci sequence

  7 Solvers

• List Proth primes

  11 Solvers