Network Security: Relatively Prime (Co-Prime) Numbers
Topics discussed:
1) Explanation of divisor/factor, common divisor/common factor.
2) Finding the Greatest Common Divisor (GCD)/Highest Common Factor (HCF).
3) Explanation on how to determine whether the given two numbers are relatively prime to each other or not.
4) Justification on the need to compute the GCD using Euclid’s Algorithm to check whether the given numbers are relatively prime or not.
5) Various scenarios to prove NOT to take decisions of relatively prime numbers just by looking at the numbers.
Follow Neso Academy on Instagram: @nesoacademy (https://bit.ly/2XP63OE)
Contribute: https://www.nesoacademy.org/donate
Memberships: https://bit.ly/2U7YSPI
Books: https://www.nesoacademy.org/recommended-books
Website ► https://www.nesoacademy.org/
Forum ► https://forum.nesoacademy.org/
Facebook ► https://goo.gl/Nt0PmB
Twitter ► https://twitter.com/nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#NetworkSecurityByNeso #Cryptography #NetworkSecurity #RelativelyPrimeNumbers #CoPrimeNumbers