Тёмный

GCD - Euclidean Algorithm (Method 1) 

Neso Academy
Подписаться 2,6 млн
Просмотров 518 тыс.
50% 1

Network Security: GCD - Euclidean Algorithm (Method 1)
Topics discussed:
1) Explanation of divisor/factor, common divisor/common factor.
2) Finding the Greatest Common Divisor (GCD)/Highest Common Factor (HCF).
3) Manual way of understanding and finding the GCD of two numbers with examples GCD(12,33), GCD(25,150), and GCD(13,31).
4) Euclid’s Algorithm or Euclidean Algorithm for finding the GCD/HCD of two numbers with examples.
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommende...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#NetworkSecurityByNeso #Cryptography #NetworkSecurity #EuclideanAlgorithm

Опубликовано:

 

21 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 250   
@AlphaZubair
@AlphaZubair 7 месяцев назад
Even our teacher who has visited many foriegn countries and a Phd person use your slide.A true salute to You..
@vikasbagri1225
@vikasbagri1225 2 года назад
Very easy explanation sir Thanku so much GCD(1005,105) = 15
@guliyevshahriyar
@guliyevshahriyar Год назад
This is one of the first referred location to understand new stuff. Thank you very much for a valuable work!
@bolemnageswrarao3081
@bolemnageswrarao3081 2 года назад
I just loved your teaching. I think we r very lucky to listen your classes
@SulaimanKhan1991
@SulaimanKhan1991 Год назад
Bundle of Thanks Sir. Learn in very simple way.
@1minwithtech495
@1minwithtech495 7 месяцев назад
Neso is always known for the easiest explanation
@samanthasavoy3490
@samanthasavoy3490 Год назад
You explained this so well! Really appreciate you and hope you have a great night/day!
@ro0t115
@ro0t115 Год назад
subscribed after listening to this awesome explanation as math is my biggest weakness and I finally get to understand this . thankyou .
@bibekbouri3955
@bibekbouri3955 2 года назад
Best explanation on YT Thank you sir.
@mohmedabdirahaman6007
@mohmedabdirahaman6007 10 месяцев назад
Thank You You are the best instructor i have ever seen on RU-vid
@512_madutkuajokmabilmadut5
@512_madutkuajokmabilmadut5 Год назад
Thanks a lot for your good explanation, respected sir
@lightingstrike7285
@lightingstrike7285 Год назад
So well explained. Thanks!
@vaneesafxavier7503
@vaneesafxavier7503 Год назад
Thanks for such a clear teaching sir. Gcd (1005,105)=15
@ans7452
@ans7452 Год назад
You are one of the best tutors🎉❤
@masterleague8349
@masterleague8349 2 года назад
Please Keep posting....I have cryptography paper next Thursday....I would really love something on AES and DES
@susanalexis3905
@susanalexis3905 Год назад
Thank you sir 😊😊I love and learn a lot from your explanation and it saves my exams 😊😊
@VictoriaOtunsha
@VictoriaOtunsha Год назад
Thank you for this breakdown
@gauravdev5884
@gauravdev5884 2 года назад
Thank you sir!!!! 😊 GCD(1005,105) = 15
@programmers8245
@programmers8245 2 года назад
Could u please tell how u solve it as i solve it and the result 105
@raunakyadush
@raunakyadush 2 года назад
@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)
@mohammedsufiyankhan306
@mohammedsufiyankhan306 10 месяцев назад
Thanks from Buttom of my heart for explaining in easy and understandable ways. ❤🎉😮😮
@masukunhlonipho
@masukunhlonipho Месяц назад
thank you sir, that was very helpful
@rohitsolanki667
@rohitsolanki667 2 года назад
very easy explanation thank you so much
@user-zt5lt4vb5x
@user-zt5lt4vb5x 4 месяца назад
Very easy explanation sir Thank you very much GCD(1005,105) = 15
@adeypurohit01
@adeypurohit01 5 месяцев назад
Best video on internet for Euclidian's Algo for GCD !
@Abdullah-no6hg
@Abdullah-no6hg 4 месяца назад
How to find divisor
@vineetgoyal2642
@vineetgoyal2642 Год назад
very great video thank you Sir!!
@UMT6174
@UMT6174 2 года назад
nice algorithm and nice explanation
@ankitayadav-tt1yp
@ankitayadav-tt1yp 3 месяца назад
Amazing explanation..... crystal clear sir 🙏🏻🙏🏻
@ombassemnour4283
@ombassemnour4283 Год назад
I dont know how can i thank you. God bless you your are awesome
@sarderrafid5751
@sarderrafid5751 9 месяцев назад
it was a great explanation. Thanks sir
@ThomasJohnMolnga
@ThomasJohnMolnga 2 месяца назад
Sir, thank you very much. Now, I am fully understand.
@iamfutureflashx
@iamfutureflashx 2 года назад
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
@fatmamohmed58
@fatmamohmed58 Год назад
it's simple and useful thanks💙💙💙💙
@Logicalhood
@Logicalhood 2 года назад
WELL DONE SIR love from logicalhood....... GCD (1005 ,105) = 15
@UbacheQuas
@UbacheQuas 7 месяцев назад
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!
@user-lb4dt1dz8r
@user-lb4dt1dz8r 7 месяцев назад
Concentrate on this lecture you will give better knowledge than other ❤ loving from nashik
@NatashaBwalya-xn4ep
@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
@AshishKumar-gf4nn
@AshishKumar-gf4nn 4 месяца назад
Teaching style was so nice
@muhammadzeeshannaeem1918
@muhammadzeeshannaeem1918 Год назад
wow
@user-zg6hh5sy2e
@user-zg6hh5sy2e 9 месяцев назад
wow its so easy after watching this video even in the class it was not able to understand thanks
@habieell3696
@habieell3696 5 месяцев назад
So ez to understand, thankyouuuu sir
@sistersgalaxy8896
@sistersgalaxy8896 Год назад
Thank you. 👌 explained
@shaa3980
@shaa3980 10 месяцев назад
Thank you for you explanation ❤❤❤
@merveillesmbiami1288
@merveillesmbiami1288 Год назад
thank you well explained
@elif4116
@elif4116 8 месяцев назад
Thank you!
@iamlegend2865
@iamlegend2865 2 месяца назад
Thank you so much sir
@minhphuclu5570
@minhphuclu5570 Год назад
Good Job! Thanks a lot
@SilentKiller2
@SilentKiller2 Год назад
thanks for explaining
@ShermukhammadKarimov
@ShermukhammadKarimov 4 месяца назад
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?
@santhipriyapriya9828
@santhipriyapriya9828 2 года назад
Thank you...GCD(1005,105)= 15.
@jonitoloule3479
@jonitoloule3479 2 года назад
that's right
@tejaschavan4643
@tejaschavan4643 Год назад
​@@jonitoloule3479
@AthishKrishnaM
@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.
@mvartcraft9232
@mvartcraft9232 7 месяцев назад
Explained so good tq sir
@sagormajomder
@sagormajomder 2 года назад
Thank you very much.
@sarfaraztamboli2945
@sarfaraztamboli2945 11 месяцев назад
Thank you
@sasanidulmika1292
@sasanidulmika1292 5 месяцев назад
Thank you❤
@selvamhanusha9251
@selvamhanusha9251 2 года назад
Thankyou so much sir it is very easy put more videos thankyou
@nimmakajogeswararao7770
@nimmakajogeswararao7770 Месяц назад
Thank you so much sir love you ❤❤❤❤🙏🙏🙏
@user-br9gx7lh8b
@user-br9gx7lh8b 5 месяцев назад
thank you sir
@harshrana2004
@harshrana2004 2 года назад
Thanks sir!
@krishan4737
@krishan4737 8 месяцев назад
I am clear now tnx a lot
@soumyathelegend.4066
@soumyathelegend.4066 Год назад
Excellent 👌
@helenabdulwahid6574
@helenabdulwahid6574 Год назад
Thanksss alot👏🏻👏🏻
@varunpathak6219
@varunpathak6219 Год назад
thank you broooo
@zeeu
@zeeu 2 года назад
thank you
@7xsurahhartofmuslim112
@7xsurahhartofmuslim112 2 года назад
love it..nice explation.. love from bangladesh
@agbaiobasi7390
@agbaiobasi7390 5 месяцев назад
Thanks a lot, I salute you genius. The answer is 15.
@mutayyab01
@mutayyab01 2 года назад
Amazing 🤩❤
@rohitbhatt1815
@rohitbhatt1815 3 месяца назад
Thanks to u man
@subhamkumar2057
@subhamkumar2057 3 месяца назад
gcd of (1005,105)is 15 thankyou sir for this nice class
@saga-Q312
@saga-Q312 3 месяца назад
Quite easy and simple explanation And the answer of GCD(1005, 105)=15
@chathuranibotheju839
@chathuranibotheju839 2 года назад
thank you 🙏
@rajveersingh2056
@rajveersingh2056 2 года назад
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
@jairajsingh1850 2 года назад
kisi ne pucha tere se?
@coding3752
@coding3752 2 года назад
No , wrong
@coding3752
@coding3752 2 года назад
We are using it for programming, order matters
@rakeshvarmaputti8471
@rakeshvarmaputti8471 8 месяцев назад
Gcd of ( 270 , 192) can solve the answer for this
@nasirulislam7722
@nasirulislam7722 Год назад
It was great
@Dd_SEN
@Dd_SEN Год назад
Thank you so much.....
@LanaAmericana
@LanaAmericana 11 дней назад
thaj you so much
@user-yt2bb7jq5h
@user-yt2bb7jq5h 3 месяца назад
Thank you sir!!!! GCD(1005,105) = 15
@Inder_pal_singh
@Inder_pal_singh Год назад
Lots of Love u brother
@antwiboasiakoemmanuel3053
@antwiboasiakoemmanuel3053 Год назад
best teacher
@pwstudents6586
@pwstudents6586 Год назад
Thnx
@Funny_Video_Creations
@Funny_Video_Creations Год назад
Thank you so much sir Iam easily Understand How to Find GCD😊 The Home Work Answer Is 15
@kumarrathod9160
@kumarrathod9160 2 года назад
Thanks
@ivayloivanov5766
@ivayloivanov5766 Год назад
Can you help me with this, please: x ≡ 2 (mod 11) x ≡ 9 (mod 15) x ≡ 7 (mod 9) x ≡ 5 (mod 7) ?
@pujithagaddale7171
@pujithagaddale7171 2 года назад
Thanks 💜💜💜💜💜💜
@generalmedia5672
@generalmedia5672 Год назад
very best
@syedhamid01
@syedhamid01 2 года назад
thats too good
@ilhandhimbil2837
@ilhandhimbil2837 Год назад
Thanks broo 🥰
@tcreatesllc
@tcreatesllc 2 года назад
Perfect
@joseblanco9277
@joseblanco9277 7 месяцев назад
great
@hashcodez757
@hashcodez757 Год назад
god bless you!!
@zelma_ahmet
@zelma_ahmet Год назад
The answer is 15... thank you very much
@tharunkumarreesu7529
@tharunkumarreesu7529 2 года назад
GCD (1005,105)=15
@okrkck
@okrkck 2 года назад
Tnx
@aqsanoor8162
@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
@jadebutler6713
@jadebutler6713 Год назад
i love u thank u kind man
@bilaljan321
@bilaljan321 Год назад
Thank you. GCD or HCF of (1005,105)=15. I have a question hat if remainder is never zero like (35,47)?
@omkarlohat1371
@omkarlohat1371 Год назад
1
@vasanthakumarpandian2294
@vasanthakumarpandian2294 Год назад
do it properly i have remainder 0 for (35,47)
@fatimabintezaman5801
@fatimabintezaman5801 2 месяца назад
GCD(1005, 105) = 15 Thank you!
@andrewstell6648
@andrewstell6648 2 года назад
Easiest explanation possiable. GCD of 1005 and 105 is 15
@allinoneplace3816
@allinoneplace3816 2 года назад
Useful video and GCD = 15
@rajeshprajapati1851
@rajeshprajapati1851 2 года назад
I had no idea that someone could teach Maths without Pen. It is just AMAZING.
@utilizator1701
@utilizator1701 2 года назад
Homework answer: 15.
@spreagle9648
@spreagle9648 10 месяцев назад
saabaash 😂
@mdhyderalikhan8725
@mdhyderalikhan8725 7 месяцев назад
​@@spreagle9648Hasna tha kya
@spreagle9648
@spreagle9648 7 месяцев назад
@@mdhyderalikhan8725 roode bhai 😆 iss se jyada kuch karr bhi toh nahi sakta
@mdhyderalikhan8725
@mdhyderalikhan8725 7 месяцев назад
@@spreagle9648 thike g
@Abdullah-no6hg
@Abdullah-no6hg 4 месяца назад
Divisor kesy find krna
@ramyapriyadharshinitg9972
@ramyapriyadharshinitg9972 Год назад
Super sir
@Varkode248
@Varkode248 7 месяцев назад
GCD(1005,105) = 15 Thanks for your presentation.
@Abdullah-no6hg
@Abdullah-no6hg 4 месяца назад
How to find divisor
Далее
GCD - Euclidean Algorithm (Method 2)
10:00
Просмотров 141 тыс.
Extended Euclidean Algorithm (Solved Example 1)
10:16
Просмотров 237 тыс.
ЧУТЬ НЕ УТОНУЛ #shorts
00:27
Просмотров 6 млн
Modular Arithmetic (Part 1)
10:57
Просмотров 314 тыс.
Extended Euclidean Algorithm Example
14:50
Просмотров 307 тыс.
Euler’s Totient Function (Phi Function)
8:40
Просмотров 225 тыс.
The Chinese Remainder Theorem (Solved Example 1)
14:22
Просмотров 517 тыс.
Multiplicative Inverse
10:03
Просмотров 216 тыс.
Fermat's Little Theorem
7:31
Просмотров 207 тыс.