Proposition: If n is divisible by 60, then it is divisible by both 5 and 12.
Converse: If n is divisible by both 5 and 12, then it is divisible by 60.
The proposition is true. If n=60k, then n=5×12k and n=12×5k, so n is divisible by 5 and by 12.
The converse is also true. Since n is divisible by 12, write n=12k. Now 5 divides 12k. Since 5 is a prime and does not divide 12 (12=2×2×3), it must divide k; say k=5m. Then
n=12×5m=60m
so n is divisible by 60.
Compare with Question 8: there 4 and 6 had a common factor 2, and the converse failed. Here 5 and 12 have no common factor other than 1, so every common multiple of 5 and 12 is a multiple of 5×12=60.
Both the proposition and its converse are true.