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

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

Neso is always known for the easiest explanation

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

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

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

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

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

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

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

Best explanation on YT Thank you sir.

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

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

Bundle of Thanks Sir. Learn in very simple way.

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

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

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

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

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

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

thank you sir, that was very helpful

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!

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

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

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

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

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

Thanks sir 🎉very helpful for me 🎉

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

Teaching style was so nice

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

You are one of the best tutors🎉❤

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

Thanks a lot for your good explanation, respected sir

helpful before 2hours of exam

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

Homework answer: 15.

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

So well explained. Thanks!

GCD(1005, 105) = 15 Thank you!

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

So ez to understand, thankyouuuu sir

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

Easiest explanation possiable. GCD of 1005 and 105 is 15

Thank you so much sir

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?

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.

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.

I am clear now tnx a lot

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

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

Thank you!

it was a great explanation. Thanks sir

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

it's simple and useful thanks💙💙💙💙

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

GCD (1005,105)=15

Thank you for you explanation ❤❤❤

The answer is 15... thank you very much

love it..nice explation.. love from bangladesh

thank you sir

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

Thank you

Thank you❤

Explained so good tq sir

thanks for explaining

wow

Thank you. 👌 explained

best teacher

Thank you for this breakdown

nice algorithm and nice explanation

very easy explanation thank you so much

thank you

thank you well explained

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

thank you broooo

Good Job! Thanks a lot

Thanks to u man

Thanksss alot👏🏻👏🏻

thaj you so much

Lots of Love u brother

Thank you very much.

Gcd(1005,105)=15

very great video thank you Sir!!

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

It was great

Thanks 💜💜💜💜💜💜

gcd(1005,105)=15

Excellent 👌

#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

thank you 🙏

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

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

Thank you so much.....

Thanks

very best

Thnx

Thanks bro 😅 l just got smarter.

Thanks sir!

1000,105,=15gcd