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 Solvers9
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
251 Solvers
-
Project Euler: Problem 10, Sum of Primes
2086 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
103 Solvers
-
Create a vector whose elements depend on the previous element
777 Solvers
-
Create an index-powered vector
927 Solvers
More from this Author319
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!