Problem 60845. Sum powers of e-divisors

• Created by ChrisR

×

Like (0)

Difficulty:

(4)

Rate

• Solve Later   
• Add To GroupÂ

In number theory the function produces the sum of divisors of an integer n raised to the power m. Setting sums the divisors, as in Cody Problem 46898, and setting counts the divisors, as in Cody Problem 2664.

This problem involves e-divisors of an integer, which you listed in Cody Problem 60843 and counted in Cody Problem 60844.

Write a function to sum powers of e-divisors of an integer. If the argument m is not specified, take it to be 1.

Solve

Solution Stats

100.0% Correct | 0.0% Incorrect

• 4 Solutions
• 4 Solvers

Last Solution submitted on Apr 15, 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

• Sum powers of e-divisors

  4 Solvers

More from this Author298

• Compute infiltration and runoff under constant precipitation with the Green-Ampt method

  2 Solvers

• Compute piezometric head in a leaky confined aquifer

  3 Solvers

• Solve an ODE: concentrations predicted by the cells-in-series model

  3 Solvers

• Compute the sum of reciprocals of quadratics

  10 Solvers

• Determine whether a property description closes

  5 Solvers