document.write( "Question 1148067: Greatest Common Divisors and Least Common Multiples\r
\n" ); document.write( "\n" ); document.write( "I need help with this guys, please. It is the final problem in this section and I am struggling. Thank you in advance!\r
\n" ); document.write( "\n" ); document.write( " Question Help \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The notions of the greatest common divisor and the least common multiple extend naturally to more than two numbers.​ Moreover, the​ prime-factorization method extends naturally to finding​ GCD(a, b,​ c) and​ LCM(a, b,​ c)\r
\n" ); document.write( "\n" ); document.write( "​(a)If a=2 Superscript 1 Baseline x 3 Superscript 1 Baseline x 7cubed
\n" ); document.write( "21•31•73​, b=2 squared x 3 squared x 7 Superscript 1
\n" ); document.write( "22•32•71​, and c=2cubed x 5 squared x 7 Superscript 1
\n" ); document.write( "23•52•71​, compute GCD(a, b, c) and LCM(a, b, c)\r
\n" ); document.write( "\n" ); document.write( "​(b)Is it necessarily true that GCD(a, b, c)•LCM(a, b, c)= ​abc?\r
\n" ); document.write( "\n" ); document.write( "​(c)Find numbers​ r, s, and t such that GCD(r, s, t) •LCM(r, s, t)= rst
\n" ); document.write( "

Algebra.Com's Answer #769487 by Alan3354(69443)\"\" \"About 
You can put this solution on YOUR website!
It's no likely anyone will attempt to decipher that.
\n" ); document.write( "----
\n" ); document.write( "Use math symbols.
\n" ); document.write( "
\n" );