if gcd(a,b)=1 and c|(a b), then gcd(a,c)=gcd(b,c)=1
Published 3 days ago • 53 plays • Length 6:24Download video MP4
Download video MP3
Similar videos
-
2:59
if gcd(a,b)=1, d|ac, and d|bc, then d|c.
-
10:24
if gcd(a,b)=1, then gcd(a^2,b^2)=1.
-
![prove if gcd(a,b) = 1 then gcd(a^n,b^n) = 1 [iliekmathphysics]](https://i.ytimg.com/vi/B0lQuIW6w6g/mqdefault.jpg)
4:43
prove if gcd(a,b) = 1 then gcd(a^n,b^n) = 1 [iliekmathphysics]
-
5:07
||lecture#18||if gcd(a,b)=1 and c|a then gcd(b,c)=1||number theory||prof.latif sajid
-
9:11
prove ax mod n = 1 if and only if gcd(a,n) = 1
-
6:36
gdc and formula booklet tips
-
3:19
extended euclidean algorithm|express gcd(a,b) as linear combination
-
8:49
if gcd(a,b)=1 and gcd(a,c)=1 then prove that gcd(a,bc)=1.
-
6:30
||lecture#29||if gcd(a,b)=1,then gcd(a b,a-b)=1 or 2 ||prof.latif sajid
-
10:13
||lecture#19||if gcd(a,b)=1 then gcd(ac,b)=gcd(c,b)||number theory||prof.latif sajid
-
3:21
if a divides c and b divides c with gcd(a,b)=1 then ab will divide c
-
5:47
(number theory) lecture 18: if a|c and b|c with gcd (a,b)= 1 then ab|c