GCD - Euclidean Algorithm (Method 2)

[@alberttoo5807]

Thank you I swear your videos have been saving my semesters😂

[@brienaustinclayton]

That too before 2hrs

[@df8xentono68]

Tomorrow is my dm exam😂

[@DwipBonik]

@@df8xentono68 tommorow is mine bro

[@prajapatikaushik6674]

The GCD of 529 and 123 is 1 and so they are relatively prime numbers.

[@alokendughosh7013]

Answer is 1, so 529 and 123 are relatively prime.😊

[@sravanthip5082]

All the best 4r ur exam😂... @happy ni8 out🎉😂

[@ashishlkhmn48]

The pre-requisite of a>b is not necessary in Euclid's algorithm. You can take any two values in a and b and the answer will be correct.. The only thing is that in case of a

[@DandelionHope]

Yeah

[@ucanhly1166]

true i try this by myself it works.So incredible!!

[@rajeevranjan9172]

yes when the first time else part run it makes a>b if initially b>a

[@mdafeef3911]

GCD(529,123) = 1

[@mandadirohitreddy8086]

So both are relatively prime numbers

[@cseHarsha]

How?

[@c.c.c11]

GCD (529,123) = 1.

[@David-qq3uo]

Wonderful! Thank you for your Services.

[@perumalma4707]

Your neso academy teaching methods are really super

[@abinayabalamahendran5065]

Thank you for these videos really very helpful for my PhD coursework

[@sridamul1331]

Hey, the algorithm also works for b > a. There is no requirement of prerequisite a > b.

[@devpriyashivani1855]

GCD(529, 123) = 1
GCD(529, 123) = GCD(123, 529%123) = GCD(123, 37)
GCD(123, 37) = GCD(37, 123%37) = GCD(37, 12)
GCD(37, 12) = GCD(12, 37%12) = GCD(12, 1)
GCD(12, 1) = GCD(1, 0) Since, b=0, it will return a=1
Hence, GCD(529, 123) = 1 Answer

[@chibuikemchigbo3680]

this was so much explained than my teacher in class

[@darrshanseshathrri3573]

Two reduce one iteration or recursion, we can end the iteration or recursion by checking if rendering is zero and return b

[@sujalbalar316]

Thank you sir
Keep it up.
Can you please make video on data encryption standard (DES)?

[@UMT6174]

nice explanation and nice algorithm

[@tanmaydeopurkar4818]

Superb simple explanation. Thank You

[@UMT6174]

way work methode 1 and 2 is same because that of expresion equation . example gcd(a,b) when a>b then we have a=bx+c when c is remainder

[@debojitbiswastirtho8062]

Thanks a lot ! Really great content

[@SimpleAwesome-l3i]

Thank you sir ❤

[@sujalbalar316]

My ens subject's sir was asked about this method in viva today.

[@kalyanreddy_4024]

Fan of this channel

[@helpingwallahngo5798]

very helpful. Thank you so much

[@williesanape3900]

crystal clear explanation! Thank you so much.

[@harshgohil35]

Nice explanation bruh

[@ashanhabib4195]

Great bosss thanks for the best video

[@mahrou616]

Thank you

[@itenigneer21]

If I say that Time complexity of Euclid's method is "logb base a", is it correct ?

[@bhuppidhamii]

int gcd(int A, int B)
{
int maxi=max(A,B);
int mini=min(A,B);
if(B == 0 ){
return A;
}else{
return gcd(mini,maxi%mini);
}
}

[@merveillesmbiami1288]

thank you very much

[@skgeddha3207]

gcd(529,123) = 1

[@Hosain_Ahmed]

Thanks

[@SequinBrain]

Using a program someone wrote using a function on Matlab:
GCD(529,123)
ans =
1

[@Alien.Coderzzz]

Amazing

[@UMT6174]

we can find gcd(a,b) from forming an equation that has a and b where for example a>b then we can make it a=bx+c where if x and c are integers then if we get gcd(b, c ) then surely we can make the equation a=bx+c into factorization form a=(..)(...) for example gcd(b,c)=k then we can make a=k(((b/k) ) ) *x)+c/k) where because k is gcd(b,c) then surely b/k has a remainder of 0 as well as for c/k so at the same time we get gcd(a,b) i.e. gcd( b, c) so that gcd(a,b) = gcd(b,c) and if you want to find gcd(b,c) again, you can make the equation again so you can get gcd(b,c) and so on until the most It's simple, so method 1 is made in the form of a table, actually methods 1 and 2 are basically the same, namely from the equation

[@siddharthp1]

Homework Answer is 1.

[@utilizator1701]

Homework answer: 1.

[@OmarMohamed-ge2zg]

thank you thank you thank you thank youuuuuuuuuuuuu

[@IOAmitChaurasiya]

H.W ans: gcd(529,123) = 1

[@stacydevries4241]

Homework answer HCF = 1

[@gowthamip6688]

Home work sum ans is 1

[@aqsanoor8162]

GCD(529,123)=20

[@vaddemohan3777]

def find_gcd(a,b):
if b==0:
return a
else:
return find_gcd(b,a%b)
a = 529
b = 123
print(find_gcd(a,b))

[@rajeshprajapati4863]

Answer to H.W.
GCD(529, 123) = 1

[@Vishal-co8fd]

15 is The Answer

[@motivation_with_harsh]

answer is 1

[@rithikarithika4514]

1 is the answer right...

[@stacydevries4241]

GCD =1

[@ilyaskhan38]

Osm method

[@MildredRubio-s6g]

Lewis John Harris Gary Garcia Edward

[@Umar-nl3ny]

ahla kalam

[@yasina63]

83 mod 19 = Reminder is 7. How please can you be more specific? I didn't get it now.

[@davidthomas6043]

If you divide 83 by 19 you get 4 plus remainder of 7.

[@gotterdammerung1837]

83/19 = 4.368421053
4.368421053 - 4 = 0.368421052 ( calculator did)
0.368421052 * 19 = 7
calculator can do with brainlessly

[@kayleewardfera7660]

Anderson Michelle Robinson James Thompson Paul

[@ahmadmaqsood2069]

1,0=1

[@stupid_coder01]

#include
int main(void)
{
int num1, num2, gcd;
printf("Enter the nums: ");
scanf("%d %d", &num1, &num2 );
while (num2 !=0 )
{
gcd = num1;
num1 = num2;
num2 = gcd % num2;
}
printf("Gcd is: %d
", num1);
return 0;
}

[@SharadDwivedi-yt5rg]

Bamodb

[@SharadDwivedi-yt5rg]

बमोदबा 😂

[@monicabattacharya6416]

Please start teaching FULL STACK DEVELOPMENT COURSE. I am learning now 😌. if you start it now , it will be helpful for many students who are preparing for placements.

[@preeti4534]

GCD(529, 123) = 1

[@mihirmathur5855]

GCD(529,123)=1

[@josephwamuti]

GCD (529,123)=1