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 CommentsShow comments
Problem Recent Solvers5