If and represent digits, what is the biggest number of the form that is divisible by both and ?
For this problem, it will help to recall the divisibility rules for and .
The solution to the problem is given in a series of steps, each of which can be unlocked by a password. To unlock the first step, the password is the biggest number that is less than 100 that is divisible by both and .