Prove that if a and b are both even, then gcd(a, b)=gcd(a/2, b/2) [NT-Ch.2-S2.4] - Part 17
HTML-код
- Опубликовано: 26 авг 2024
- This vidoe proves that if a and b are both even integers but not zero at the same time, then gcd(a, b)=gcd(a/2, b/2). #maths #gcd #numbertheory #integers #mathematics #numbers
Note that
NT stands for Number Theory,
Ch.2 stands for Chapter 2 Divisibility,
S2.4 denotes Section 2.4 Greatest Common Divisor
![Prove that if a is even and b is odd, then gcd(a, b)=gcd(a/2, b) [NT-Ch.2-S2.4] - Part 18](http://i.ytimg.com/vi/Rzk3TmoXJZs/mqdefault.jpg)
![Prove that if a is even and b is odd, then gcd(a, b)=gcd(a/2, b) [NT-Ch.2-S2.4] - Part 18](/img/tr.png)
![Show that gcd(a^(2^m)+1, a^(2^n)+1)= 1 or 2 [NT-Ch.2-S2.5] - Part 15](http://i.ytimg.com/vi/hHGF1IhYDng/mqdefault.jpg)
