RMO 2015! #9

Number Theory Level 4

Find :

g c d [ 2002 + 2 , 200 2 2 + 2 , 200 2 3 + 2 , . . . . . ] gcd[2002 + 2, 2002^2 + 2, 2002^3 + 2, .....]


The answer is 6.

Dev Sharma by Dev Sharma , 20, India

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.

1 solution

By Euclidean Algorithm, the GCD of 1st and 2nd term= 6. The GCD of 2nd and 3rd term= 6, and so on.

1 Helpful 0 Interesting 0 Brilliant 0 Confused

wat is the euclidean algorithm u r talking about ?

Ganesh Ayyappan - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...