If g cd ( 3 0 , 1 5 4 ) = 2 , find g cd ( 3 0 5 , 1 5 4 5 ) .
Notation: g cd ( ⋅ , ⋅ ) denotes the greatest common divisor function.
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.
The actual intention of this problem was to help those recognize this following fact who haven't recognized it yet:
For any integer a and b (with not both zero) and any positive integer n , g c d ( a n , b n ) = ( g c d ( a , b ) ) n .
Given g c d ( 3 0 , 1 5 4 ) = 2 , applying this fact, g c d ( 3 0 5 , 1 5 4 5 ) = ( g c d ( 3 0 , 1 5 4 ) ) 5 = 2 5 = 3 2 .
Problem Loading...
Note Loading...
Set Loading...
g cd ( 3 0 5 , 1 5 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 = 3 2