List questions from gcd-and-lcm

Published on 03 Feb 2016 - 12:12

207

Views

Is this true :$\zeta(s-1)=\sum_{n=1}^{\infty}\frac{\gcd(n,n)}{{\operatorname{lcm}(n,n)}^{s}}$?

Published on 24 Feb 2026 - 3:52

836

Views

Area of minimum regular polygon given three vertices

Published on 29 Mar 2026 - 2:45

117

Views

Computing the GCD of two polynomials

Published on 04 Feb 2016 - 15:51

856

Views

If $a$ is an integer, prove that $gcd(14a + 3, 21a + 4) = 1$

Published on 06 Feb 2016 - 22:37

114

Views

If $\gcd(a, c) = 1$ and $b | c$, prove that $(a, b) = 1$

Published on 06 Feb 2016 - 23:01

1k

Views

If $a > 0$,$b>0$, and $\frac{1}{a} + \frac{1}{b}$ is an integer, prove that $a=b$. And show that $a = 1$ or $2$

Published on 07 Feb 2016 - 0:23

143

Views

Sums of remainders in Euclidean GCD algorithm

Published on 08 Feb 2016 - 21:24

360

Views

Abstract Algebra GCD and division.

Published on 09 Feb 2016 - 20:16

562

Views

defining gcd on rings

Published on 25 Mar 2026 - 9:40

1.5k

Views

For complex polynomials $\gcd(f,g)=1$ if and only if $f$ and $g$ have no common root

Published on 13 Feb 2016 - 1:19

107

Views

Prime factorization and hcf

Published on 01 Apr 2026 - 17:02

156

Views

How to prove that $\gcd(a,m) \le \gcd(a,mn)$ for any integer n

Published on 14 Feb 2016 - 0:04

71

Views

Proof using Division by GCD

Published on 14 Feb 2016 - 11:28

85

Views

Determine greatest common divisor, possibly involving the euc. algorithm

Published on 28 Mar 2026 - 6:06

List Question

Number theory: Can we reach from $(x_0,y_0)$ to $(x_1,y_1)$ ,with following transitions?

Is this true :$\zeta(s-1)=\sum_{n=1}^{\infty}\frac{\gcd(n,n)}{{\operatorname{lcm}(n,n)}^{s}}$?

Area of minimum regular polygon given three vertices

Computing the GCD of two polynomials

If $a$ is an integer, prove that $gcd(14a + 3, 21a + 4) = 1$

If $\gcd(a, c) = 1$ and $b | c$, prove that $(a, b) = 1$

If $a > 0$,$b>0$, and $\frac{1}{a} + \frac{1}{b}$ is an integer, prove that $a=b$. And show that $a = 1$ or $2$

Sums of remainders in Euclidean GCD algorithm

Abstract Algebra GCD and division.

defining gcd on rings

For complex polynomials $\gcd(f,g)=1$ if and only if $f$ and $g$ have no common root

Prime factorization and hcf

How to prove that $\gcd(a,m) \le \gcd(a,mn)$ for any integer n

Proof using Division by GCD

Determine greatest common divisor, possibly involving the euc. algorithm

Trending Questions

Popular # Hahtags

Popular Questions