Processing math: 100%
 
+0  
 
0
541
1
avatar

Using the Euclidian Algorithm, calculate

                                                                                             gcd(2601,2801)

 Jul 30, 2020
 #1
avatar+26396 
+2

Using the Euclidian Algorithm, calculate gcd(2601,2801)

 

 

Formula: gcd(a,b)=gcd(b,a) gcd(a,b)=gcd(anb,b) gcd(a,a)=a

 

 

gcd(2601, 2801)=gcd(2801, 2601)2801=1+2+22+23++2792601=1+2+22+23++259220(2601)=220+221++279(2801)220(2601)=1+2+22+23++219(2801)220(2601)=2201=gcd((2801)220(2601), 2601)=gcd(2201, 2601)

 

gcd(2201, 2601)=gcd(2601, 2201)2601=1+2+22+23++2592201=1+2+22+23++219240(2201)=240+241++259(2601)240(2201)=1+2+22+23++239(2601)240(2201)=2401=gcd((2601)240(2201), 2201)=gcd(2401, 2201)

 

gcd(2401, 2201)2401=1+2+22+23++2392201=1+2+22+23++219220(2201)=220+221++239(2401)220(2201)=1+2+22+23++219(2401)220(2201)=2201=gcd((2401)220(2201), 2201)=gcd(2201, 2201)=2201=1048575

 

gcd(2601, 2801)=gcd(2601, 2201)=gcd(2401, 2201)=gcd(2201, 2201)=2201=1048575

 

laugh

 Jul 31, 2020

3 Online Users

avatar