Problem:
Let be a three-digit integer such that the difference between any two positive integer factors of is divisible by . Let denote the number of positive integers which divide . Find the maximum possible value of .
Problem:
Let be a three-digit integer such that the difference between any two positive integer factors of is divisible by . Let denote the number of positive integers which divide . Find the maximum possible value of .
Solution:
We first note that all the prime factors of must be modulo (and thus modulo ). The smallest primes with this property are . Since , the number can have at most prime factors (including repeats). Since , the most factors can have is .
Consider the number , which has factors. For this choice of , .
For another to do better, it must have at least factors, for otherwise, . It is easy to verify that is the greatest number with prime factors satisfying our conditions, so the answer must be .