There Can Be Infinitely Many

A positive integer \(n\) is called sacred if it is divisible by all odd integers \(a\) for which \(n \geq a^2\). Determine the sum of all sacred numbers.

As an arbitrary example, \(n=15\) is sacred because it is divisible by \(1\) and \(3\).

Problem Credit : A teacher.
×

Problem Loading...

Note Loading...

Set Loading...