Question

if $\gcd(a,b)=1$ and $c^2$ divides $ab$, prove that $c^2$ divides $a$ or $b$.

score 308 · Answer 1 · 2016-11-27 17:46:30

308

Views

if $\gcd(a,b)=1$ and $c^2$ divides $ab$, prove that $c^2$ divides $a$ or $b$.

Published on 27 Nov 2016 - 17:46

score 8k · Answer 2 · 2016-11-27 21:39:11

8k

Views

Uniqueness of multiplicative (and additive) inverses in $\Bbb Z_n$ (or any abelian monoid)

Published on 27 Nov 2016 - 21:39

score 44 · Answer 3 · 2016-12-01 03:55:21

44

Views

Greatest Factor of $n$ that divides $\binom{n}{r}$

Published on 01 Dec 2016 - 3:55

score 65 · Answer 4 · 2016-12-02 11:24:50

65

Views

Find $(2^{a}+1,2^{b}+1),$ where $a$ and $b$ are prime numbers greater than $3$ and $(x,y)$ represents the $\gcd(x,y).$

Published on 02 Dec 2016 - 11:24

score 107 · Answer 5 · 2016-12-03 11:26:06

107

Views

Find gcd($a,c$) with gcd($a,b$) and gcd($b,c$) is given?

Published on 03 Dec 2016 - 11:26

score 58 · Answer 6 · 2016-12-04 13:00:55

58

Views

Prove that $ (n,m)=2 \sum\limits_{i=1}^{n-1} \left[ \frac{i m}{n}\right]+n+m - n m. $

Published on 04 Dec 2016 - 13:00

score 88 · Answer 7 · 2026-03-27 00:58:06

88

Views

Find numbers a, b, so that gcd(Fₙ, Fₙ₊₁) = aFₙ + bFₙ₊₁ holds using Euclidean Algorithm

Published on 27 Mar 2026 - 0:58

score 91 · Answer 8 · 2016-12-08 23:05:37

91

Views

Is there integer :$n>0$ for which $\displaystyle\frac{n^4+(n+1)^4}{n²+(n+1)^2}$ is integer?

Published on 08 Dec 2016 - 23:05

score 174 · Answer 9 · 2016-12-10 08:48:50

174

Views

Common divisors of $a , b$ and $a$ mod $b$

Published on 10 Dec 2016 - 8:48

score 63 · Answer 10 · 2016-12-10 18:26:30

63

Views

Particular method to prove that if $\gcd(a,b,c)=1$ then there exists $n\in \mathbb{Z}$ such that :

Published on 10 Dec 2016 - 18:26

score 657 · Answer 11 · 2026-03-25 04:17:10

657

Views

Multiplying a floor function

Published on 25 Mar 2026 - 4:17

score 100 · Answer 12 · 2016-12-12 06:29:37

100

Views

Prove gcd is one of the following {1, 3}

Published on 12 Dec 2016 - 6:29

score 134 · Answer 13 · 2026-03-29 20:53:36

134

Views

$gcd(f_k, f_{k+3})$, where $f_k$ is the k'th Fibonacci number

Published on 29 Mar 2026 - 20:53

score 364 · Answer 14 · 2016-12-15 23:56:21

364

Views

Finding gcd using euclid's algorithm

Published on 15 Dec 2016 - 23:56

score 257 · Answer 15 · 2026-03-26 14:20:55

257

Views

The ring of real "entire" functions: gcd domain?

Published on 26 Mar 2026 - 14:20

List Question

if $\gcd(a,b)=1$ and $c^2$ divides $ab$, prove that $c^2$ divides $a$ or $b$.

Uniqueness of multiplicative (and additive) inverses in $\Bbb Z_n$ (or any abelian monoid)

Greatest Factor of $n$ that divides $\binom{n}{r}$

Find $(2^{a}+1,2^{b}+1),$ where $a$ and $b$ are prime numbers greater than $3$ and $(x,y)$ represents the $\gcd(x,y).$

Find gcd($a,c$) with gcd($a,b$) and gcd($b,c$) is given?

Prove that $ (n,m)=2 \sum\limits_{i=1}^{n-1} \left[ \frac{i m}{n}\right]+n+m - n m. $

Find numbers a, b, so that gcd(Fₙ, Fₙ₊₁) = aFₙ + bFₙ₊₁ holds using Euclidean Algorithm

Is there integer :$n>0$ for which $\displaystyle\frac{n^4+(n+1)^4}{n²+(n+1)^2}$ is integer?

Common divisors of $a , b$ and $a$ mod $b$

Particular method to prove that if $\gcd(a,b,c)=1$ then there exists $n\in \mathbb{Z}$ such that :

Multiplying a floor function

Prove gcd is one of the following {1, 3}

$gcd(f_k, f_{k+3})$, where $f_k$ is the k'th Fibonacci number

Finding gcd using euclid's algorithm

The ring of real "entire" functions: gcd domain?

Trending Questions

Popular # Hahtags

Popular Questions