Question

Unknown number x, 45•G.C.F(125, x) = L.C.M (125, x)

score 165 · Answer 1 · 2026-03-22 12:30:15

165

Views

Unknown number x, 45•G.C.F(125, x) = L.C.M (125, x)

Published on 22 Mar 2026 - 12:30

score 43 · Answer 2 · 2019-05-22 15:39:53

43

Views

GCD of $f=X^3 +9X^2 +10X +3$ and $g= X^2 -X -2$ in $\mathbb{Z}/5\mathbb{Z}$.

Published on 22 May 2019 - 15:39

score 44 · Answer 3 · 2019-05-23 15:32:27

Without using the Euclidean algorithm, show that in $\mathbb{Z}[i]$ for $x,y \in \mathbb{Z}$ s.t $x^2+9 = y^3$, $x+3i$ and $x-3i$ are relative prime.

score 143 · Answer 4 · 2019-05-24 03:18:04

143

Views

How to compute gcd of two polynomials efficiently

Published on 24 May 2019 - 3:18

score 95 · Answer 5 · 2019-05-24 12:05:20

95

Views

Find the $\gcd(x^m+ a^m,x^n+a^n) $

Published on 24 May 2019 - 12:05

score 613 · Answer 6 · 2019-05-27 20:20:13

613

Views

Probability of a fraction $a/b$ that cannot be simplified

Published on 27 May 2019 - 20:20

score 249 · Answer 7 · 2019-05-28 02:57:43

249

Views

For relatively prime integers x and y, what are all possible values for gcd(7x−y, x+ 2y)?

Published on 28 May 2019 - 2:57

score 875 · Answer 8 · 2026-03-21 20:08:11

875

Views

Greatest common factors and least common multiples GCSE exam question

Published on 21 Mar 2026 - 20:08

score 588 · Answer 9 · 2026-03-21 21:23:41

588

Views

Is maximizing an LCM equivalent to minimizing a GCD?

Published on 21 Mar 2026 - 21:23

score 134 · Answer 10 · 2019-06-01 12:35:10

134

Views

GCD of two ring elements in $\mathbb{Z}[\sqrt{d}]$

Published on 01 Jun 2019 - 12:35

score 115 · Answer 11 · 2026-03-25 09:28:29

115

Views

Frequency of integers $x, x+2$ such that gcd$\left(x(x+2),p\right)=1$

Published on 25 Mar 2026 - 9:28

score 241 · Answer 12 · 2019-06-03 08:31:58

241

Views

If gcd$(a,b)=$1 and $p$ is a odd prime then show that gcd$\left(a+b,\frac{a^p+b^p}{a+b}\right)=1$

Published on 03 Jun 2019 - 8:31

score 96 · Answer 13 · 2026-03-22 10:15:20

96

Views

Old bell rang problem with different starting time

Published on 22 Mar 2026 - 10:15

score 74 · Answer 14 · 2019-06-05 02:10:33

Prove that if $a,m,n \in \mathbb{Z}^+$ and $m \ne n$ then $\gcd(a^{2^m}+1,a^{2^n}+1)$ is 1 if a is even and 2 if a is odd.

score 653 · Answer 15 · 2019-06-05 13:42:33

653

Views

How to complete a primitive vector to a unimodular matrix

Published on 05 Jun 2019 - 13:42

List Question

Unknown number x, 45•G.C.F(125, x) = L.C.M (125, x)

GCD of $f=X^3 +9X^2 +10X +3$ and $g= X^2 -X -2$ in $\mathbb{Z}/5\mathbb{Z}$.

Without using the Euclidean algorithm, show that in $\mathbb{Z}[i]$ for $x,y \in \mathbb{Z}$ s.t $x^2+9 = y^3$, $x+3i$ and $x-3i$ are relative prime.

How to compute gcd of two polynomials efficiently

Find the $\gcd(x^m+ a^m,x^n+a^n) $

Probability of a fraction $a/b$ that cannot be simplified

For relatively prime integers x and y, what are all possible values for gcd(7x−y, x+ 2y)?

Greatest common factors and least common multiples GCSE exam question

Is maximizing an LCM equivalent to minimizing a GCD?

GCD of two ring elements in $\mathbb{Z}[\sqrt{d}]$

Frequency of integers $x, x+2$ such that gcd$\left(x(x+2),p\right)=1$

If gcd$(a,b)=$1 and $p$ is a odd prime then show that gcd$\left(a+b,\frac{a^p+b^p}{a+b}\right)=1$

Old bell rang problem with different starting time

Prove that if $a,m,n \in \mathbb{Z}^+$ and $m \ne n$ then $\gcd(a^{2^m}+1,a^{2^n}+1)$ is 1 if a is even and 2 if a is odd.

How to complete a primitive vector to a unimodular matrix

Trending Questions

Popular # Hahtags

Popular Questions