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 commentsGroup

Easy Sequences Volume II
- 10 Problems
- 5 Finishers
- Easy Sequences 13: Average Speed of Spaceship
- Easy Sequences 16: Volume of Embedded Octahedron
- Easy Sequences 18: Set Bits of Triple Summations
- Easy Sequences 21: Combinatorial Summations
- Easy Sequences 23: Hat Guessing Game!
- Easy Sequences 24: Number of Coprime Lattice Points
- Easy Sequences 25: Product of Series
- Easy Sequences 31: N-N's Sequence
- Easy Sequences 27: Product of Radicals of Integers
- Easy Sequences 28: Sum of Radicals of Integers
Problem Recent Solvers7
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!