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

Prime Numbers III
- 19 Problems
- 4 Finishers
- List the Moran numbers
- List the cuban primes
- Compute the largest number whose prime factors sum to n
- List the Beatriz numbers
- List the Euclid numbers
- List odd twin composites
- List the semiprimes
- Solve an equation involving primes and fractions
- List the two-bit primes
- List numbers such that every sum of consecutive positive integers ending in those numbers is composite
- Identify de Polignac numbers
- List the Fermi-Dirac primes
- Factor a number into Fermi-Dirac primes
- Compute the Sisyphus sequence
- Compute the bubble popper fidget spinner sequence
- Determine whether a number is a Zeisel number
- Express numbers as the sum of a prime, a square, and a cube
- Determine whether a number is a Gaussian prime
- List primes of the form xy+z
Problem Recent Solvers7
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!