Question

What thoughts should I be having when proving the Euclidean Division Algorithm?

score 57 · Answer 1 · 2018-11-06 10:06:03

57

Views

What thoughts should I be having when proving the Euclidean Division Algorithm?

Published on 06 Nov 2018 - 10:06

score 197 · Answer 2 · 2018-11-08 05:27:53

197

Views

Finding the HCF

Published on 08 Nov 2018 - 5:27

score 101 · Answer 3 · 2018-11-08 08:12:37

101

Views

When do Co-Primes have a common factor?

Published on 08 Nov 2018 - 8:12

score 70 · Answer 4 · 2026-02-23 05:12:19

70

Views

Prove that, $\textrm{LCM}(\textrm{GCD}(m,x),\textrm{GCD}(n,x)) = \textrm{GCD}(\textrm{LCM}(m,n),x)$

Published on 23 Feb 2026 - 5:12

score 72 · Answer 5 · 2018-11-13 00:52:25

72

Views

Bezout's identity: which half is larger?

Published on 13 Nov 2018 - 0:52

score 84 · Answer 6 · 2026-02-23 07:01:03

84

Views

Prove $\frac{ab}{m} = \gcd(a,b)$ when $m=\operatorname{lcm}(a,b)$, for all natural numbers $a$ and $b$.

Published on 23 Feb 2026 - 7:01

score 162 · Answer 7 · 2026-03-25 15:22:44

162

Views

Showing that a greatest common divisor must be 1 or 2 using pigeonhole principle

Published on 25 Mar 2026 - 15:22

score 185 · Answer 8 · 2018-11-18 17:58:38

185

Views

Non-integral domain for which there still exists a gcd for each pair of elements.

Published on 18 Nov 2018 - 17:58

score 101 · Answer 9 · 2018-11-19 07:41:12

101

Views

How to prove an equivalence of two equations?

Published on 19 Nov 2018 - 7:41

score 399 · Answer 10 · 2018-11-19 11:45:38

399

Views

When does $(a,b)=(\gcd(a,b))$ hold?

Published on 19 Nov 2018 - 11:45

score 2.1k · Answer 11 · 2018-11-21 16:28:43

2.1k

Views

Find $x,y$ given $\gcd(x,y)$ and ${\rm lcm}(x,y)$

Published on 21 Nov 2018 - 16:28

score 77 · Answer 12 · 2026-03-25 07:45:59

77

Views

What proportion of the positive integers satisfies $\gcd(n^2,\sigma(n^2))>\sigma(n)$, where $\sigma$ is the sum-of-divisors function?

Published on 25 Mar 2026 - 7:45

score 283 · Answer 13 · 2026-03-25 05:59:45

283

Views

Removable singularities for rational functions with floating point coefficients

Published on 25 Mar 2026 - 5:59

score 32 · Answer 14 · 2018-12-04 11:10:48

32

Views

Creating inputs that make a subtraction-based GCD algorithm slow

Published on 04 Dec 2018 - 11:10

score 37 · Answer 15 · 2018-12-04 22:31:02

37

Views

Given an odd integer, $a$ does $\gcd(a,p-1)=1$ has infinitely many prime $p$ solutions?

Published on 04 Dec 2018 - 22:31

List Question

What thoughts should I be having when proving the Euclidean Division Algorithm?

Finding the HCF

When do Co-Primes have a common factor?

Prove that, $\textrm{LCM}(\textrm{GCD}(m,x),\textrm{GCD}(n,x)) = \textrm{GCD}(\textrm{LCM}(m,n),x)$

Bezout's identity: which half is larger?

Prove $\frac{ab}{m} = \gcd(a,b)$ when $m=\operatorname{lcm}(a,b)$, for all natural numbers $a$ and $b$.

Showing that a greatest common divisor must be 1 or 2 using pigeonhole principle

Non-integral domain for which there still exists a gcd for each pair of elements.

How to prove an equivalence of two equations?

When does $(a,b)=(\gcd(a,b))$ hold?

Find $x,y$ given $\gcd(x,y)$ and ${\rm lcm}(x,y)$

What proportion of the positive integers satisfies $\gcd(n^2,\sigma(n^2))>\sigma(n)$, where $\sigma$ is the sum-of-divisors function?

Removable singularities for rational functions with floating point coefficients

Creating inputs that make a subtraction-based GCD algorithm slow

Given an odd integer, $a$ does $\gcd(a,p-1)=1$ has infinitely many prime $p$ solutions?

Trending Questions

Popular # Hahtags

Popular Questions