List questions from gcd-and-lcm

Published on 03 Feb 2022 - 22:58

52

Views

Show for all $a,b,c\in\mathbb{N}$, $gcd(a,b)\cdot gcd(b,c) |b\cdot gcd(a,c)$

Published on 04 Feb 2022 - 16:39

20

Views

How can I show that the order of this element divides the gcd?

Published on 03 Apr 2026 - 6:53

362

Views

How to prove that $\gcd(m,n) = xm+yn$?

Published on 29 Mar 2026 - 20:38

273

Views

Using Least Common Multiple to find the number of rectangle pieces of a given size to fit a square surface

Published on 04 Apr 2026 - 23:24

38

Views

How can we show $1<\gcd(b^s-1,N)<N$ here? (well-definedness of Shor's algorithm)

Published on 15 Feb 2022 - 17:03

46

Views

$\gcd(a,b)=1$ from $2\min(a,b)-\max(a,b)=p$ where $p$ is odd prime

Published on 17 Feb 2022 - 13:58

137

Views

Prove that there is an infinite number of pairs $x$ and $y$ that satisfy $x+y=203$, and $\gcd(x,y)=7$

Published on 17 Feb 2022 - 17:38

58

Views

Asymptotic growth of $\gcd$ appearing in a summand

Published on 18 Feb 2022 - 10:15

33

Views

Simple divisiblity problem and gcd

Published on 21 Feb 2022 - 14:19

352

Views

A singular variant of the OEIS sequence A349576

Published on 21 Feb 2022 - 20:07

27

Views

How to reduce a triplet of integers into a triplet of pair-wise coprime integers?

Published on 23 Feb 2022 - 10:45

263

Views

Finding the $\gcd$ of two polynomials over $\Bbb Z[x]$

Published on 09 Apr 2026 - 0:00

426

Views

Does $\sigma(m^2)/p^k$ divide $m^2 - p^k$, if $p^k m^2$ is an odd perfect number with special prime $p$?

Published on 27 Mar 2026 - 22:57

179

Views

Calculate $\gcd(2a+4b, 2a +8b)$, if $a\equiv b \pmod{\! 5},\ 6a+11b = 5$

Published on 03 Mar 2022 - 22:32

List Question

divisibility problem and gcd

Show for all $a,b,c\in\mathbb{N}$, $gcd(a,b)\cdot gcd(b,c) |b\cdot gcd(a,c)$

How can I show that the order of this element divides the gcd?

How to prove that $\gcd(m,n) = xm+yn$?

Using Least Common Multiple to find the number of rectangle pieces of a given size to fit a square surface

How can we show $1<\gcd(b^s-1,N)<N$ here? (well-definedness of Shor's algorithm)

$\gcd(a,b)=1$ from $2\min(a,b)-\max(a,b)=p$ where $p$ is odd prime

Prove that there is an infinite number of pairs $x$ and $y$ that satisfy $x+y=203$, and $\gcd(x,y)=7$

Asymptotic growth of $\gcd$ appearing in a summand

Simple divisiblity problem and gcd

A singular variant of the OEIS sequence A349576

How to reduce a triplet of integers into a triplet of pair-wise coprime integers?

Finding the $\gcd$ of two polynomials over $\Bbb Z[x]$

Does $\sigma(m^2)/p^k$ divide $m^2 - p^k$, if $p^k m^2$ is an odd perfect number with special prime $p$?

Calculate $\gcd(2a+4b, 2a +8b)$, if $a\equiv b \pmod{\! 5},\ 6a+11b = 5$

Trending Questions

Popular # Hahtags

Popular Questions