Problem 58379. Determine whether a number is prome

• Created by ChrisR

×

Like (1)

Difficulty:

(23)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

45.0% Correct | 55.0% Incorrect

• 20 Solutions
• 8 Solvers

Last Solution submitted on Jul 30, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Who Deserves Your Praise? Discover the New Contribution Widget!

We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers8

Suggested Problems

• Duplicates

  2352 Solvers

• Interpolator

  3381 Solvers

• Check to see if a Sudoku Puzzle is Solved

  328 Solvers

• All capital?

  651 Solvers

• Project Euler: Problem 3, Largest prime factor

  1601 Solvers

More from this Author292

• Update course numbers and abbreviations

  8 Solvers

• Determine aquifer properties: slug test

  2 Solvers

• Count the ways to make Scorigami

  2 Solvers

• Solve an easy binary puzzle

  4 Solvers

• Count trailing zeros in a primorial

  29 Solvers