Problem 53810. List the Beatriz numbers
Write a function to find integers n less than or equal to an input value m that solve the equation . The function gives the sum of divisors of x; for example, . The totient function counts numbers less than x that are relatively prime to x. For example, because 1, 2, 4, 7, 8, 11, 13, and 14 are relatively prime to 15; that is, the greatest common divisor of 15 and each of the eight numbers is 1.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1393 Solvers
-
Check if number exists in vector
10714 Solvers
-
Volume difference between Ellipsoid and Sphere
125 Solvers
-
Diophantine Equations (Inspired by Project Euler, problem 66)
57 Solvers
-
731 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!