prove that the integer 8n 3 and 5n 2 are relatively prime. theory of numbers || discrete mathematics
Published 2 years ago • 1.9K plays • Length 5:46Download video MP4
Download video MP3
Similar videos
-
3:06
division algorithm || number theory || discrete mathematics || dr kabita sarkar
-
![[discrete mathematics] primes and gcd](https://i.ytimg.com/vi/Dorm0_UyKFw/mqdefault.jpg)
8:23
[discrete mathematics] primes and gcd
-
8:24
|i factorial| you won't believe the outcome
-
15:23
euler’s pi prime product and riemann’s zeta function
-
5:03
the secret behind -1 factorial
-
9:17
no induction necessary! prove 5n 3 and 7n 4 are relatively prime for all n in ℤ
-
![think thursday: multiples [discrete]](https://i.ytimg.com/vi/JL6DRMr9TQw/mqdefault.jpg)
5:13
think thursday: multiples [discrete]
-
21:06
number theory 25 - greatest common division
-
9:25
pigeonhole principle example: why are there always a pair of relatively prime numbers.
-
4:43
is 1 relatively prime to itself? | number theory