Divisor Pairs
Problem 561
Let be the number of pairs of distinct divisors of such that divides .
For we get the following pairs: and . So .
Let be the product of the first prime numbers, so .
Let be the highest integer such that divides .
since is the highest power of 2 that divides S(6)=5.
Let
.
For we get the following pairs: and . So .
Let be the product of the first prime numbers, so .
Let be the highest integer such that divides .
since is the highest power of 2 that divides S(6)=5.
Let
.
Evaluate .