I am having difficulties with a problem from my exercise sheet for a University exam.
The problem statement is as following:
When dividing a number by 12, 15 or 48 there will always be a remainder of 10. If the number is the least posible, how many divisors does the number have?
How would you solve that problem?