For each positive integer n, let d(n) be the number of positive integer divisors of n.
Prove that for all pairs of positive integers (a,b) we have that:
d(a)+d(b)≤d(gcd(a,b))+d(lcm(a,b))
and determine all pairs of positive integers (a,b) where we have equality case. number theoryDivisorsGCD and LCM