They grew up so beautifully

Find the number of solutions to [ a , b , c ] ( a , b , c ) = a b c [a,b,c](a,b,c) = \sqrt{abc} where a b c a\geq b \geq c are integers ranging from 1 1 to 30 30 .

Here [ a , b , c ] [a,b,c] and ( a , b , c ) (a,b,c) are the least common multiple (LCM) and the greatest common divisor (GCD) of a , b , c a,b,c respectively.


The answer is 49.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...