GCD of Powers

If gcd ( 30 , 154 ) = 2 \gcd(30,154)=2 , find gcd ( 3 0 5 , 15 4 5 ) \gcd(30^5,154^5) .

Notation: gcd ( , ) \gcd(\, \cdot \, , \cdot) denotes the greatest common divisor function.


The answer is 32.

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.

2 solutions

Madelyn Yu
Jan 1, 2017

gcd ( 3 0 5 , 15 4 5 ) = g c d ( 2 5 1 5 5 , 2 5 7 7 5 ) = 2 5 g c d ( 1 5 5 , 7 7 5 ) = 2 5 = 32 \gcd(30^5,154^5) = gcd(2^5*15^5,2^5*77^5) = 2^5 gcd(15^5,77^5) = 2^5 = 32

The actual intention of this problem was to help those recognize this following fact who haven't recognized it yet:

For any integer a a and b b (with not both zero) and any positive integer n n , g c d ( a n , b n ) = ( g c d ( a , b ) ) n . gcd(a^n,b^n)=(gcd(a,b))^n.

Given g c d ( 30 , 154 ) = 2 gcd(30,154)=2 , applying this fact, g c d ( 3 0 5 , 15 4 5 ) = ( g c d ( 30 , 154 ) ) 5 = 2 5 = 32 gcd(30^5,154^5)=(gcd(30,154))^5=2^5=32 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...