Question

If $ar + bs =1$, then $\gcd(a,s) = \gcd(r,b) = \gcd(r,s) = 1$

score 6.9k · Answer 1 · 2026-03-28 00:48:01

6.9k

Views

If $ar + bs =1$, then $\gcd(a,s) = \gcd(r,b) = \gcd(r,s) = 1$

Published on 28 Mar 2026 - 0:48

score 179 · Answer 2 · 2014-09-10 14:18:44

179

Views

If $a^n-1$ is divisible by $b^n-1$ for all $n$, then $a$ is a power of $b$

Published on 10 Sep 2014 - 14:18

score 58 · Answer 3 · 2014-09-10 14:29:29

58

Views

Question about G.C.D.

Published on 10 Sep 2014 - 14:29

score 1.3k · Answer 4 · 2014-09-10 18:02:51

1.3k

Views

If $c\mid ab$ and $\gcd(c,a)=d$, then $c\mid db$

Published on 10 Sep 2014 - 18:02

score 122 · Answer 5 · 2014-09-10 18:33:45

122

Views

Any $p + 1$ consecutive integers contain at least two invertible elements modulo $p!!$ if $p$ is odd

Published on 10 Sep 2014 - 18:33

score 133 · Answer 6 · 2014-09-10 23:13:26

133

Views

Divisibility: if $a \mid b$ and $b \mid c$, then $a \mid (b+c)$

Published on 10 Sep 2014 - 23:13

score 221 · Answer 7 · 2014-09-12 20:07:58

221

Views

GCD between a polynomial with terms of even degree and a polynomial with terms of odd degree.

Published on 12 Sep 2014 - 20:07

score 5.7k · Answer 8 · 2026-03-26 21:27:15

5.7k

Views

How many integers in the range [1,999] are divisible by exactly 1 of 7 and 11?

Published on 26 Mar 2026 - 21:27

score 139 · Answer 9 · 2026-03-30 15:52:01

139

Views

Solving for a variable in an integer divisibility problem

Published on 30 Mar 2026 - 15:52

score 581 · Answer 10 · 2014-09-13 16:27:07

581

Views

What is wrong with my algorithm for finding how many positive integers are divisible by a number d in range [x,y]?

Published on 13 Sep 2014 - 16:27

score 202 · Answer 11 · 2014-09-14 04:07:41

202

Views

Formula for the floor of $n/2$, to be proved by induction

Published on 14 Sep 2014 - 4:07

score 115 · Answer 12 · 2026-03-27 07:17:17

115

Views

Divisors of numbers of the form $a^2+2b^2$ with $\gcd(a,b)=1$

Published on 27 Mar 2026 - 7:17

score 180 · Answer 13 · 2014-09-14 19:03:09

180

Views

Is it true that the gcd of cubes is the cube of gcd?

Published on 14 Sep 2014 - 19:03

score 1.3k · Answer 14 · 2014-09-14 19:11:27

1.3k

Views

Proof of $g^a \equiv 1 \pmod{m}$ and $g^b \equiv 1 \pmod{m} \quad \implies \quad g^{\gcd(a,b)} \equiv 1 \pmod{m}$

Published on 14 Sep 2014 - 19:11

score 99 · Answer 15 · 2014-09-15 01:22:56

99

Views

Prove if $2\mid(x^2-1) $, then $4\mid(x^2-1)$

Published on 15 Sep 2014 - 1:22

List Question

If $ar + bs =1$, then $\gcd(a,s) = \gcd(r,b) = \gcd(r,s) = 1$

If $a^n-1$ is divisible by $b^n-1$ for all $n$, then $a$ is a power of $b$

Question about G.C.D.

If $c\mid ab$ and $\gcd(c,a)=d$, then $c\mid db$

Any $p + 1$ consecutive integers contain at least two invertible elements modulo $p!!$ if $p$ is odd

Divisibility: if $a \mid b$ and $b \mid c$, then $a \mid (b+c)$

GCD between a polynomial with terms of even degree and a polynomial with terms of odd degree.

How many integers in the range [1,999] are divisible by exactly 1 of 7 and 11?

Solving for a variable in an integer divisibility problem

What is wrong with my algorithm for finding how many positive integers are divisible by a number d in range [x,y]?

Formula for the floor of $n/2$, to be proved by induction

Divisors of numbers of the form $a^2+2b^2$ with $\gcd(a,b)=1$

Is it true that the gcd of cubes is the cube of gcd?

Proof of $g^a \equiv 1 \pmod{m}$ and $g^b \equiv 1 \pmod{m} \quad \implies \quad g^{\gcd(a,b)} \equiv 1 \pmod{m}$

Prove if $2\mid(x^2-1) $, then $4\mid(x^2-1)$

Trending Questions

Popular # Hahtags

Popular Questions