Solution: Since gcd(d,60)=5, we know that d=5id′ for some integer i>0 and some integer d′ which is relatively prime to 60. Consequently, d′ is a divisor of (15!)/5; eliminating common factors with 60 gives that d′ is a factor of (72)(11)(13), which has (2+1)(1+1)(1+1)=12 factors. Finally, i can be 1,2, or 3, so there are a total of 3⋅12=36 possibilities.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.