Problem 58379. Determine whether a number is prome
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."
Write a function to determine whether a number is prome. Take 1 to be not prome.
Solution Stats
Problem Comments
-
1 Comment
Christian Schröder
on 1 Jun 2023
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.
Solution Comments
Show commentsProblem Recent Solvers8
Suggested Problems
-
844 Solvers
-
1632 Solvers
-
520 Solvers
-
Visualization of experimental data across a surface
39 Solvers
-
Area of an equilateral triangle
6528 Solvers
More from this Author307
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!