Divsiors

There exists a positive integer \(n\leq 500\) satisfying the property that its largest proper divisor is equal to 15 times its second smallest positive divisor.

If the total possible values of \(n\) is \(p\), and the smallest possible value of \(n\) is \(q\), submit your answer as \(p + q \).

Bonus: Solve this question again, but this time, replace the number 15 with the number 17 instead.

×

Problem Loading...

Note Loading...

Set Loading...