Cody

Problem 46046. Determine whether a number is a cluster prime

Solution 2694428

Submitted on 15 Jul 2020 by Tim
  • Size: 34
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
n = 2; assert(~isClusterPrime(n))

2   Pass
n = 53; assert(isClusterPrime(n))

3   Pass
n = 87; assert(~isClusterPrime(n))

4   Pass
n = 97; assert(~isClusterPrime(n))

5   Pass
n = 311; assert(isClusterPrime(n))

6   Pass
n = 314; assert(~isClusterPrime(n))

7   Pass
n = 509; assert(isClusterPrime(n))

8   Pass
n = 631; assert(~isClusterPrime(n))

9   Pass
n = 751; assert(~isClusterPrime(n))

10   Pass
n = 983; assert(isClusterPrime(n))

11   Pass
n = 2707; assert(~isClusterPrime(n))

12   Pass
n = 4597; assert(~isClusterPrime(n))

13   Pass
n = 10891; assert(isClusterPrime(n));