GCD - Euclidean Algorithm (Method 1)

[@AlphaZubair]

Even our teacher who has visited many foriegn countries and a Phd person use your slide.A true salute to You..

[@vikasbagri1225]

Very easy explanation sir Thanku so much GCD(1005,105) = 15

[@Krishna-z1g5r]

Very easy explanation sir Thank you very much GCD(1005,105) = 15

[@ramadhanayieko207]

I knew that Euclidean Algorithm was a pain in the back however after watching this tutorial am confident that I can solve any problem on GCDs.Kudos Neso Academy

[@vaneesafxavier7503]

Thanks for such a clear teaching sir. Gcd (1005,105)=15

[@bolemnageswrarao3081]

I just loved your teaching. I think we r very lucky to listen your classes

[@ramadhanayieko207]

Ever since I started watching thins channel and subscribed to it I have been always at the top ,be blessed NESO ACADEMY

[@gauravdev5884]

Thank you sir!!!! 😊 GCD(1005,105) = 15

[@programmers8245]

Could u please tell how u solve it as i solve it and the result 105

[@raunakyadush]

@programmer (Dividend/Divisor),(1005/105, rem =60),(105/60 ,rem=45),(60/45, rem 15), (45/15 ,rem=0), (15/0 =when we get divisor =0 then we considered dividend as a GCD)

[@guliyevshahriyar]

This is one of the first referred location to understand new stuff. Thank you very much for a valuable work!

[@mohmedabdirahaman6007]

Thank You You are the best instructor i have ever seen on KZbin

[@1minwithtech495]

Neso is always known for the easiest explanation

[@iamfutureflashx]

enter a:- 1005 enter b:- 105 quotient = 9 a = 1005 b = 105 reminder = 60 quotient = 1 a = 105 b = 60 reminder = 45 quotient = 1 a = 60 b = 45 reminder = 15 quotient = 3 a = 45 b = 15 reminder = 0 GCD of (1005,105) is:- 15 Process finished with exit code 0

[@ro0t115]

subscribed after listening to this awesome explanation as math is my biggest weakness and I finally get to understand this . thankyou .

[@SulaimanKhan1991]

Bundle of Thanks Sir. Learn in very simple way.

[@saga-Q312]

Quite easy and simple explanation And the answer of GCD(1005, 105)=15

[@AGCreation-y2g]

Concentrate on this lecture you will give better knowledge than other ❤ loving from nashik

[@bibekbouri3955]

Best explanation on YT Thank you sir.

[@santhipriyapriya9828]

Thank you...GCD(1005,105)= 15.

[@jonitoloule3479]

that's right

[@Tejas_Chavan_23]

​@@jonitoloule3479

[@FredKayange-g3f]

GCD(1005,105)=15 Thank you sir .

[@Logicalhood]

WELL DONE SIR love from logicalhood....... GCD (1005 ,105) = 15

[@adeypurohit01]

Best video on internet for Euclidian's Algo for GCD !

[@Abdullah-no6hg]

How to find divisor

[@AshishKumar-gf4nn]

Teaching style was so nice

[@archiferos]

wow its so easy after watching this video even in the class it was not able to understand thanks

[@ThomasJohnMolnga]

Sir, thank you very much. Now, I am fully understand.

[@ShermukhammadKarimov]

Thank you much. You explained this very well. But my question is that how are we sure that the remainder will eventually turn exactly 0?

[@candy_f1oss]

tysm for making it so easy to understand

[@susanalexis3905]

Thank you sir 😊😊I love and learn a lot from your explanation and it saves my exams 😊😊

[@rajveersingh2056]

7:25 it doesn't matter if you take biggest number or smaller number for variable A... As soon as R is zero, take B as answer....

[@jairajsingh1850]

kisi ne pucha tere se?

[@coding3752]

No , wrong

[@coding3752]

We are using it for programming, order matters

[@rakeshvarmaputti8471]

Gcd of ( 270 , 192) can solve the answer for this

[@NatashaBwalya-xn4ep]

Hey I was going through my lecture notes and we were told to find GCD the solution there wasn't making sense until I thought of watching a tutorial video on it thanks alot I understand now and this is my ans GCD for 1005 and 105 is 15

[@aqsanoor8162]

GCD (1005 ,105 )=15 ....Thank you Sir....Ma samjti thi ka num theroy asa subject ha jisy rata lagy gay tu yaad ho ga...lkin ap ka lecture na mri soch ko galt kar diya....Thank u soo much

[@Varkode248]

GCD(1005,105) = 15 Thanks for your presentation.

[@Abdullah-no6hg]

How to find divisor

[@subhamkumar2057]

gcd of (1005,105)is 15 thankyou sir for this nice class

[@ankitayadav-tt1yp]

Amazing explanation..... crystal clear sir 🙏🏻🙏🏻

[@SyedAbdulRahman-gl1sh]

Thanks sir and the answer of the question is (15)

[@UbacheQuas]

This video explained it so well...compared with other videos I have watched. I got 15. Looking at the comments, I guess I have learned something!

[@mohammedsufiyankhan306]

Thanks from Buttom of my heart for explaining in easy and understandable ways. ❤🎉😮😮

[@RaviShrivastav-l2u]

Thank you sir!!!! GCD(1005,105) = 15

[@Funny_Video_Creations]

Thank you so much sir Iam easily Understand How to Find GCD😊 The Home Work Answer Is 15

[@andrewstell6648]

Easiest explanation possiable. GCD of 1005 and 105 is 15

[@masterleague8349]

Please Keep posting....I have cryptography paper next Thursday....I would really love something on AES and DES

[@AthishKrishnaM]

Thank you @Neso Academy . My question is how to find the 'Divisor' and 'Common Divisors' for the big integers like GCD(24140, 16762)? The GCD for this is 34.

[@fatimabintezaman5801]

GCD(1005, 105) = 15 Thank you!

[@ombassemnour4283]

I dont know how can i thank you. God bless you your are awesome

[@zelma_ahmet]

The answer is 15... thank you very much

[@rajeshprajapati1851]

I had no idea that someone could teach Maths without Pen. It is just AMAZING.

[@agbaiobasi7390]

Thanks a lot, I salute you genius. The answer is 15.

[@sonikaur2718]

Thanks sir 🎉very helpful for me 🎉

[@utilizator1701]

Homework answer: 15.

[@spreagle9648]

saabaash 😂

[@mdhyderalikhan8725]

​@@spreagle9648Hasna tha kya

[@spreagle9648]

@@mdhyderalikhan8725 roode bhai 😆 iss se jyada kuch karr bhi toh nahi sakta

[@mdhyderalikhan8725]

@@spreagle9648 thike g

[@Abdullah-no6hg]

Divisor kesy find krna

[@rakeshkumarsahoo1769]

helpful before 2hours of exam

[@samanthasavoy3490]

You explained this so well! Really appreciate you and hope you have a great night/day!

[@ans7452]

You are one of the best tutors🎉❤

[@512_madutkuajokmabilmadut5]

Thanks a lot for your good explanation, respected sir

[@masukunhlonipho]

thank you sir, that was very helpful

[@habieell3696]

So ez to understand, thankyouuuu sir

[@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.

[@abhijeetrawat]

Did u get placed😅😅

[@abhayrai1432]

Just curious, did you get placed?

[@atifrown8825]

I will teach you😊

[@janardannn]

wow beautiful video

[@lightingstrike7285]

So well explained. Thanks!

[@sarderrafid5751]

it was a great explanation. Thanks sir

[@fatmamohmed58]

it's simple and useful thanks💙💙💙💙

[@shaa3980]

Thank you for you explanation ❤❤❤

[@antwiboasiakoemmanuel3053]

best teacher

[@7xsurahhartofmuslim112]

love it..nice explation.. love from bangladesh

[@UMT6174]

nice algorithm and nice explanation

[@mvartcraft9232]

Explained so good tq sir

[@tharunkumarreesu7529]

GCD (1005,105)=15

[@shivasai9161]

it's so simple to understand the problem ,the solution is 15

[@nimmakajogeswararao7770]

Thank you so much sir love you ❤❤❤❤🙏🙏🙏

[@SilentKiller2]

thanks for explaining

[@selvamhanusha9251]

Thankyou so much sir it is very easy put more videos thankyou

[@krishan4737]

I am clear now tnx a lot

[@elmalkiahmed-v7o]

thanks bro

[@sistersgalaxy8896]

Thank you. 👌 explained

[@iamlegend2865]

Thank you so much sir

[@Inder_pal_singh]

Lots of Love u brother

[@ivayloivanov5766]

Can you help me with this, please: x ≡ 2 (mod 11) x ≡ 9 (mod 15) x ≡ 7 (mod 9) x ≡ 5 (mod 7) ?

[@rohitsolanki667]

very easy explanation thank you so much

[@glazefrect1337]

HW ans is: GCD(1005, 105) = 15.

[@srujanam3746]

Gcd(1005,105)=15

[@minhphuclu5570]

Good Job! Thanks a lot

[@VictoriaOtunsha]

Thank you for this breakdown

[@Kbmsongie082]

Answer:GCD(1005,105)=15

[@markgevero7094]

a = bq + r 1005 = 105 (9) + 60 105 = 60 (1) + 45 60 = 45(1) + 15 45 = 15(3) + 0 GCD (1005,105) = 3

[@merveillesmbiami1288]

thank you well explained

[@ashutoshchoudhary818]

Thanks 😊 GCD (1005,105) = 15

[@a3spa.na3v1s]

why do we have a column for quotient while it's unnecessary for finding the gcd

[@subhashkumawat9268]

gcd of(1005,105) is 15

[@vineetgoyal2642]

very great video thank you Sir!!

[@muhammadzeeshannaeem1918]

wow

[@SwastikSukla-u9r]

thank you sir

[@sagormajomder]

Thank you very much.

[@Sindhuuu99]

GCD (1005,105) is 15

[@amitkumarchoubey2003]

जय तपोवन बिहारी लाल सरकार की जय 🕉️🚩🕉️🌹🌹🙏🇮🇳🌞⛳⛳💯🎯📙🕉️जय तपोवन बिहारी लाल सरकार की जय 🕉️🚩🕉️🌹🌹🙏🇮🇳🌞⛳⛳💯🎯📙🕉️

[@shaswatpandey7264]

GCD of (1005, 105) = 15

[@zeeu]

thank you

[@Shashee99]

#include using namespace std; int gcd(int x,int y){ if(x0){ q=x/y; r=x%y; temp=y; y=r; x=temp; } return x; } int main(){ int value = gcd(1005,105); cout

[@shyguy6148]

Bete moj krdi😂

[@soumyathelegend.4066]

Excellent 👌

[@shumailariffat3363]

Thanks sir 🇵🇰💖

[@DeborahJJ]

Thanks bro 😅 l just got smarter.

[@Dd_SEN]

Thank you so much.....

[@kuntisao8632]

Thanks sir