Find number of ordered quadruples (a,b,c,d) [of positive integers] such that $lcm[a,b,c]= lcm[a,b,d]= lcm[a,c,d]= lcm[b,c,d] = 2^r\cdot3^s$
So i approached it like two of a,b,c,d has max power of 2 = r. For rest two, they have r+1 choices each. So it would be $\binom{4}{2} \cdot (r+1)^2$. Same for the power of three.
So as per me answer should be $(\binom{4}{2} \cdot (r+1) \cdot (s+1))^2$ but the answer to this problem is not given in my book.
I would really appreciate if you could tell whether my answer is correct and whether this is the correct approach and if it is not correct approach, then why?
Thanks!