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
@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)
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
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
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
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.
#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 @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.
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
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
Very easy explanation sir
Thank you very much
GCD(1005,105) = 15
I just loved your teaching. I think we r very lucky to listen your classes
Thanks for such a clear teaching 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!
Thank you sir!!!! 😊
GCD(1005,105) = 15
Could u please tell how u solve it as i solve it and the result 105
@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)
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
Ever since I started watching thins channel and subscribed to it I have been always at the top ,be blessed NESO ACADEMY
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....
kisi ne pucha tere se?
No , wrong
We are using it for programming, order matters
Gcd of ( 270 , 192) can solve the answer for this
Bundle of Thanks Sir.
Learn in very simple way.
Thank You You are the best instructor i have ever seen on TH-cam
Best explanation on YT
Thank you sir.
Thank you...GCD(1005,105)= 15.
that's right
@@jonitoloule3479
subscribed after listening to this awesome explanation as math is my biggest weakness and I finally get to understand this .
thankyou .
WELL DONE SIR love from logicalhood.......
GCD (1005 ,105) = 15
Best video on internet for Euclidian's Algo for GCD !
How to find divisor
जय तपोवन बिहारी लाल सरकार की जय 🕉️🚩🕉️🌹🌹🙏🇮🇳🌞⛳⛳💯🎯📙🕉️जय तपोवन बिहारी लाल सरकार की जय 🕉️🚩🕉️🌹🌹🙏🇮🇳🌞⛳⛳💯🎯📙🕉️
Concentrate on this lecture you will give better knowledge than other ❤ loving from nashik
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!
Quite easy and simple explanation
And the answer of GCD(1005, 105)=15
Homework answer: 15.
saabaash 😂
@@spreagle9648Hasna tha kya
@@mdhyderalikhan8725 roode bhai 😆 iss se jyada kuch karr bhi toh nahi sakta
@@spreagle9648 thike g
Divisor kesy find krna
I had no idea that someone could teach Maths without Pen. It is just AMAZING.
Teaching style was so nice
You explained this so well! Really appreciate you and hope you have a great night/day!
Please Keep posting....I have cryptography paper next Thursday....I would really love something on AES and DES
Amazing explanation..... crystal clear sir 🙏🏻🙏🏻
Thank you sir 😊😊I love and learn a lot from your explanation and it saves my exams 😊😊
Thanks a lot for your good explanation, respected sir
GCD(1005,105)=15
Thank you sir .
Thank you sir!!!!
GCD(1005,105) = 15
wow its so easy after watching this video even in the class it was not able to understand thanks
You are one of the best tutors🎉❤
Sir, thank you very much. Now, I am fully understand.
GCD(1005,105) = 15
Thanks for your presentation.
How to find divisor
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
Thanks a lot, I salute you genius. The answer is 15.
Thanks from Buttom of my heart for explaining in easy and understandable ways. ❤🎉😮😮
Easiest explanation possiable.
GCD of 1005 and 105 is
15
GCD(1005, 105) = 15
Thank you!
This is satisfying. Thank you
Thank you so much sir Iam easily Understand How to Find GCD😊
The Home Work Answer Is 15
gcd of (1005,105)is 15
thankyou sir for this nice class
The answer is 15... thank you very much
So well explained. Thanks!
Thanks sir and the answer of the question is (15)
love it..nice explation.. love from bangladesh
GCD (1005,105)=15
tysm for making it so easy to understand
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
I dont know how can i thank you. God bless you your are awesome
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?
Thanks sir 🎉very helpful for me 🎉
Thanks sir 🇵🇰💖
helpful before 2hours of exam
it's simple and useful thanks💙💙💙💙
So ez to understand, thankyouuuu sir
Thank you for you explanation ❤❤❤
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.
Did u get placed😅😅
Just curious, did you get placed?
I will teach you😊
it was a great explanation. Thanks sir
thank you sir, that was very helpful
#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
Bete moj krdi😂
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.
nice algorithm and nice explanation
Gcd(1005,105)=15
wow beautiful video
best teacher
Explained so good tq sir
Thank you. 👌 explained
thanks for explaining
14:12
gcd(1005,105)=15
Thank you for this breakdown
Thank you so much sir love you ❤❤❤❤🙏🙏🙏
thanks bro
very easy explanation thank you so much
Thank you soo much sir 😊
Thankyou so much sir it is very easy put more videos thankyou
it's so simple to understand the problem ,the solution is 15
Lots of Love u brother
thank you
Thank you so much sir
thank you well explained
Thanks 😊
GCD (1005,105) = 15
a = bq + r
1005 = 105 (9) + 60
105 = 60 (1) + 45
60 = 45(1) + 15
45 = 15(3) + 0
GCD (1005,105) = 3
I am clear now
tnx a lot
Thnx sir 🎉
Good Job! Thanks a lot
GCD (1005,105) is 15
very great video thank you Sir!!
Excellent 👌
Thank you very much.
Thanks 💜💜💜💜💜💜
Thanks bro 😅 l just got smarter.
GCD of (1005, 105) = 15
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) ?
Thank you. GCD or HCF of (1005,105)=15. I have a question hat if remainder is never zero like (35,47)?
1
do it properly i have remainder 0 for (35,47)
gcd of(1005,105) is 15