GCD - Euclidean Algorithm (Method 1)

preview_player
Показать описание
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.

Music:
Axol x Alex Skrindo - You [NCS Release]

#NetworkSecurityByNeso #Cryptography #NetworkSecurity #EuclideanAlgorithm
Рекомендации по теме
Комментарии
Автор

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

AlphaZubair
Автор

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

vikasbagri
Автор

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

ramadhanayieko
Автор

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

ramadhanayieko
Автор

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

guliyevshahriyar
Автор

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

bolemnageswrarao
Автор

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

iamfutureflashx
Автор

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

Krishna-zgr
Автор

Neso is always known for the easiest explanation

minwithtech
Автор

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

vaneesafxavier
Автор

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

mohmedabdirahaman
Автор

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

gauravdev
Автор

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

rot
Автор

Bundle of Thanks Sir.
Learn in very simple way.

SulaimanKhan
Автор

Best explanation on YT
Thank you sir.

bibekbouri
Автор

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

rajveersingh
Автор

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

adeypurohit
Автор

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

AGCreation-yg
Автор

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

Logicalhood
Автор

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

saga-Q