(i) divisors(72)=[1,2,3,4,6,8,9,12,18,24,36,72]
divisors(120)=[1,2,3,4,5,6,8,10,12,15,20,24,30,40,60,120]
Keeping the divisors of 72 that also divide 120: common-divisors =[1,2,3,4,6,8,12,24], so gcd(72,120)=24.
(ii) divisors(24)=[1,2,3,4,6,8,12,24], the same list, so the claim holds here.
Why: if blocks of size d tile 120 and 72, they also tile 120−72=48, then 72−48=24 (Euclid's steps gcd(120,72)→gcd(72,48)→gcd(48,24)→gcd(24,24)→gcd(24,0) never change the common divisors). So every common divisor divides 24. Conversely, blocks that tile 24 also tile 72=3×24 and 120=5×24. So the common divisors are exactly the divisors of 24.