In discussing the unique factorization of numbers in Elementary Number Theory, Underwood Dudley devised a new number system:
“Consider the integers 1, 5, 9, 13, 17,…; that is, all integers of the form 
, 
We will call an element of this set prome if it has no divisors other than 1 and itself in the set. For example, 21 is prome, whereas 
is not."
, We will call an element of this set prome if it has no divisors other than 1 and itself in the set. For example, 21 is prome, whereas is not."Write a function to determine whether a number is prome. Take 1 to be not prome.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers8
Suggested Problems
-
7464 Solvers
-
403 Solvers
-
Rosenbrock's Banana Function and its derivatives
163 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
181 Solvers
-
Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
322 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Underwood Dudley seems to be prone (prome?) to joking -- as befits anyone bearing such a cromulent name --: these are usually called Hilbert primes or S-primes instead.