Problem 53810. List the Beatriz numbers

• Created by ChrisR

×

Like (3)

Difficulty:

(107)

Rate

• Solve Later   
• Add To GroupÂ

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.

An oblique hint is that I call solutions to “Beatriz numbers” in honor of a good friend and former co-worker of EmilyR and JessicaR. The natural search will not help, unless you are interested in combinatorics related to Higham’s conjecture.

Solve

Solution Stats

64.29% Correct | 35.71% Incorrect

• 14 Solutions
• 7 Solvers

Last Solution submitted on Mar 20, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers7

Suggested Problems

• Back to basics 9 - Indexed References

  446 Solvers

• middleAsColumn: Return all but first and last element as a column vector

  613 Solvers

• Multiply 2 numbers

  341 Solvers

• Generate a vector like 1,2,2,3,3,3,4,4,4,4

  12005 Solvers

• Chebyshev polynomials of the 1st Kind

  71 Solvers

More from this Author292

• Compute the unitary totient of a number

  4 Solvers

• Find patterns in subprime Fibonacci sequences

  3 Solvers

• Extend the digamma function to negative arguments

  4 Solvers

• Compute the totient summatory function

  5 Solvers

• Find the zeros of the Bessel function of the first kind

  4 Solvers