Problem 46060. Identify primorial primes
Cody Problems 46054 and 46057 deal with the primorial #, which is the product of all primes up to and including the nth prime . The primorials corresponding to n = 1 through 5 are 2, 6, 30, 210, and 2310. Primorial primes are prime numbers that are either one smaller or one larger than a primorial. Examples include 3, 5, 7, 29, 31, 211, 2309, and 2311.
Write a function to identify primorial primes and their associated primorials. Given an input x, return a variable y with one of the following values:
y = 1 if x is a primorial prime
y = 0 if x is prime but not a primorial prime
y = -Inf if x is composite or 1
Also return a variable p that is the associated primorial in the first case and NaN in the other two cases.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers15
Suggested Problems
-
Find state names that end with the letter A
1175 Solvers
-
Numbers with prime factors 2, 3 and 5.
475 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
120 Solvers
-
255 Solvers
-
174 Solvers
More from this Author279
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!