Question

Prove that gcd(a, b) divides a−b.

score 1.4k · Answer 1 · 2026-03-14 21:57:56

1.4k

Views

Prove that gcd(a, b) divides a−b.

Published on 14 Mar 2026 - 21:57

score 90 · Answer 2 · 2026-03-14 04:29:57

90

Views

Measure exactly $n$ gallons of water using 9- and 15- gallon jugs...

Published on 14 Mar 2026 - 4:29

score 37 · Answer 3 · 2026-03-11 22:37:20

37

Views

What is $|\{n\in N:n\mid p^2q\}|$?

Published on 11 Mar 2026 - 22:37

score 315 · Answer 4 · 2026-03-12 09:04:12

315

Views

Bivariate polynomials coprime implies finitely many common roots

Published on 12 Mar 2026 - 9:04

score 1.7k · Answer 5 · 2026-03-12 00:01:42

1.7k

Views

$ \gcd(x^n-1,x^m-1)=x^d-1$

Published on 12 Mar 2026 - 0:01

score 74 · Answer 6 · 2026-03-25 01:27:03

74

Views

What does it meant :$4$ and $2(1+\sqrt{5}))$ without Great commone divisor?

Published on 25 Mar 2026 - 1:27

score 324 · Answer 7 · 2026-03-23 12:49:29

324

Views

Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = \gcd(a,b)$

Published on 23 Mar 2026 - 12:49

score 609 · Answer 8 · 2026-03-24 22:07:37

609

Views

Suppose $\gcd(a,b)=1$ and $c|ab$. Prove there exist integers $r$ and $s$ such that $c=rs, r|a, s|b$, and $\gcd(r,s)=1$

Published on 24 Mar 2026 - 22:07

score 137 · Answer 9 · 2026-03-25 01:20:37

137

Views

If $c \mid a, c \mid b$ and $d = \gcd(a, b)$, then $\gcd(\frac{a}{c},\frac{b}{c}) = \frac{d}{c}$.

Published on 25 Mar 2026 - 1:20

score 58 · Answer 10 · 2026-03-22 15:26:39

58

Views

Prove that any positive integer that divides both $c-a$ and $c+a$ must be equal to 1 or 2

Published on 22 Mar 2026 - 15:26

score 39 · Answer 11 · 2026-03-21 17:55:59

39

Views

Elementary Number Theory - question maybe using modular arithmetic

Published on 21 Mar 2026 - 17:55

score 101 · Answer 12 · 2026-03-22 15:49:24

101

Views

Confirmation of Proof: $\gcd(k,b) \Rightarrow \gcd(ka,b) = \gcd(a,b)$

Published on 22 Mar 2026 - 15:49

score 419 · Answer 13 · 2026-03-24 23:45:51

419

Views

Prove $a \mid m$ and $b \mid m \implies \frac{a \cdot b}{\text{gcd}(a, b)} \mid m$

Published on 24 Mar 2026 - 23:45

score 86 · Answer 14 · 2026-03-11 23:03:14

86

Views

Prove that $hxyz$ is a perfect square.

Published on 11 Mar 2026 - 23:03

score 108 · Answer 15 · 2026-03-24 00:57:13

108

Views

Number theory Proof on GCD

Published on 24 Mar 2026 - 0:57

List Question

Prove that gcd(a, b) divides a−b.

Measure exactly $n$ gallons of water using 9- and 15- gallon jugs...

What is $|\{n\in N:n\mid p^2q\}|$?

Bivariate polynomials coprime implies finitely many common roots

$ \gcd(x^n-1,x^m-1)=x^d-1$

What does it meant :$4$ and $2(1+\sqrt{5}))$ without Great commone divisor?

Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = \gcd(a,b)$

Suppose $\gcd(a,b)=1$ and $c|ab$. Prove there exist integers $r$ and $s$ such that $c=rs, r|a, s|b$, and $\gcd(r,s)=1$

If $c \mid a, c \mid b$ and $d = \gcd(a, b)$, then $\gcd(\frac{a}{c},\frac{b}{c}) = \frac{d}{c}$.

Prove that any positive integer that divides both $c-a$ and $c+a$ must be equal to 1 or 2

Elementary Number Theory - question maybe using modular arithmetic

Confirmation of Proof: $\gcd(k,b) \Rightarrow \gcd(ka,b) = \gcd(a,b)$

Prove $a \mid m$ and $b \mid m \implies \frac{a \cdot b}{\text{gcd}(a, b)} \mid m$

Prove that $hxyz$ is a perfect square.

Number theory Proof on GCD

Trending Questions

Popular # Hahtags

Popular Questions