Problem 60843. Determine the e-divisors of an integer

• Created by ChrisR

×

Like (0)

Difficulty:

(1066)

Rate

• Solve Later   
• Add To GroupÂ

From MathWorld: d is called an e-divisor (or exponential divisor) of a number n with prime factorization

if and

where for . For example, the e-divisors of 36 are , , , and .Write a function to list the e-divisors of an integer. List them in increasing order.

Solve

Solution Stats

100.0% Correct | 0.0% Incorrect

• 4 Solutions
• 4 Solvers

Last Solution submitted on Apr 10, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers4

Suggested Problems

• Determine the e-divisors of an integer

  4 Solvers

More from this Author298

• Investigate the frequency of last non-zero digits of primorials

  11 Solvers

• Convert integers from primary notation to base 10

  7 Solvers

• Determine whether a number is a Ludic prime

  5 Solvers

• Compute the Euler totient function

  9 Solvers

• Integrate a product of gamma functions

  5 Solvers