List questions from gcd-and-lcm

Published on 30 Mar 2026 - 15:14

2.4k

Views

GCD of odd numbers - Proof

Published on 13 Dec 2017 - 12:18

106

Views

If $ab - a'b' = \pm 1$, then $(a + a', b + b') = 1$

Published on 14 Dec 2017 - 13:28

337

Views

Smallest integer satisfying inequality

Published on 15 Dec 2017 - 12:03

263

Views

What is variable c in Bezout's Identity

Published on 16 Dec 2017 - 13:37

598

Views

Prove $(p-1)^{q-1}\equiv (q-1)^{p-1} \pmod{pq}$

Published on 24 Feb 2026 - 11:58

137

Views

For $a , b \in \mathbb{Z}^+$ prove that if $\gcd(a , b) = 1$ then $\gcd{(a^n + b^n , a^n - b^n)} \le 2 ~~~\forall n \in \mathbb{N}$.

Published on 20 Dec 2017 - 18:04

14k

Views

Find common factors of any two numbers

Published on 24 Feb 2026 - 12:00

1.2k

Views

The difference of two coprime composites

Published on 31 Mar 2026 - 5:40

232

Views

Extended Euclidean Algorithm As Row Operations

Published on 29 Mar 2026 - 5:43

97

Views

$\gcd(A,B) \leq \gcd(B,A-B)$

Published on 26 Dec 2017 - 13:00

258

Views

if $gcd(x,y) = 1$ and $xa = yb$ then $xa = lcm(a,b)$

Published on 29 Dec 2017 - 19:34

6.4k

Views

Ladder method for lcm and gcd

Published on 24 Feb 2026 - 11:53

1k

Views

Find $\gcd(p^n-1,p^m+1)$.

Published on 02 Jan 2018 - 8:46

27

Views

Prove that this process will stop

Published on 24 Feb 2026 - 11:52

List Question

On the equation $(\sigma(ab))^2=2a^2(\sigma(b))^2+2b^2(\sigma(a))^2$, for integers $1<a<b$

GCD of odd numbers - Proof

If $ab - a'b' = \pm 1$, then $(a + a', b + b') = 1$

Smallest integer satisfying inequality

What is variable c in Bezout's Identity

Prove $(p-1)^{q-1}\equiv (q-1)^{p-1} \pmod{pq}$

For $a , b \in \mathbb{Z}^+$ prove that if $\gcd(a , b) = 1$ then $\gcd{(a^n + b^n , a^n - b^n)} \le 2 ~~~\forall n \in \mathbb{N}$.

Find common factors of any two numbers

The difference of two coprime composites

Extended Euclidean Algorithm As Row Operations

$\gcd(A,B) \leq \gcd(B,A-B)$

if $gcd(x,y) = 1$ and $xa = yb$ then $xa = lcm(a,b)$

Ladder method for lcm and gcd

Find $\gcd(p^n-1,p^m+1)$.

Prove that this process will stop

Trending Questions

Popular # Hahtags

Popular Questions