if a and b are co-primes then show that gcd of a-b and a b equals 1 or 2
Published 5 years ago • 17K plays • Length 4:27Download video MP4
Download video MP3
Similar videos
-
7:04
number theory proof: if a|b and b|a then a = b or a = -b
-
![[discrete mathematics] primes and gcd](https://i.ytimg.com/vi/Dorm0_UyKFw/mqdefault.jpg)
8:23
[discrete mathematics] primes and gcd
-
8:43
it's so elegant! 😍 prove gcd(a,b)*lcm(a,b)=a*b with the gcd is a linear combination theorem
-
11:42
if gcd(a,b) =1 then show that gcd(2a b,a 2b)=1 or 3
-
12:11
if gcd (a,b) = 1 then prove that gcd(a b , a^2 -ab b^2) =1 or 3.
-
3:24
show that gcd (a,a 2)={1, a is odd} or {2, a is even}
-
18:20
bézout's identity: ax by=gcd(a,b)
-
17:06
direct proofs involving divisibility
-
7:09
proof: there are infinitely many primes numbers
-
3:21
if a divides c and b divides c with gcd(a,b)=1 then ab will divide c
-
21:06
number theory 25 - greatest common division
-
4:11
co-prime | theorem of co-prime | gcd | if a,b co-prime and a|bc then a|c |#is mathematics tricks
-
27:41
any two fermat numbers are relatively prime. if gcd(a,b)=d then gcd(a/d,b/d)=1 and gcd(a,a-b)=d
-
8:58
4.3 primes and greatest common divisor
-
8:14
divisibility |part 4| relative primes, euclid's lemma
-
2:41
number theory 14: gcd of a,b,c and gcd=1 does not imply pairwise prime
-
5:48
number theory 08: greatest common factor and relatively prime
-
5:09
if a and b are any two integers not both zero then gcd (a,b) exists and is unique || number theory
-
21:28
lecture 11 section 2.4 primes and gcd part 1
-
![[deprecated] number theory primer lecture 6 relatively prime integers | #numbertheory](https://i.ytimg.com/vi/5W0Sz33KeuM/mqdefault.jpg)
8:38
[deprecated] number theory primer lecture 6 relatively prime integers | #numbertheory
-
8:58
number theory if a=bq r prove gcd (a,b)=gcd (b,r)|greatest common divisor algorithm|abstract algebra
-
7:55
theorem 20: if (a,b)=1 then show that (a-b,a b)=1 or 2 full proof in hindi urdu