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 4n+1, n = 0, 1,... 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 25 = 5*5 is not."
Write a function to determine whether a number is prome. Take 1 to be not prome.

Solution Stats

47.37% Correct | 52.63% Incorrect
Last Solution submitted on Aug 09, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers8

Suggested Problems

More from this Author269

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!