Question

Showing that if $(a,b)=1$ and if $a\mid c$ and $b\mid c$ then $ab \mid c$, in GCD domains

score 163 · Answer 1 · 2026-03-27 13:48:33

163

Views

Showing that if $(a,b)=1$ and if $a\mid c$ and $b\mid c$ then $ab \mid c$, in GCD domains

Published on 27 Mar 2026 - 13:48

score 574 · Answer 2 · 2015-10-12 15:42:55

574

Views

N bits, flip exactly M bits at a time, what is minimum number of operations to get all 0's to all 1's?

Published on 12 Oct 2015 - 15:42

score 183 · Answer 3 · 2026-04-02 19:40:26

183

Views

Adding fractions with variables and using common denominator. Merging and shortening $\frac{1}{2a+8} + \frac{4}{a^2-16} + \frac{4}{a-4}$

Published on 02 Apr 2026 - 19:40

score 35 · Answer 4 · 2026-03-20 01:07:30

35

Views

How to find the g.c.d when I have another g.c.d

Published on 20 Mar 2026 - 1:07

score 514 · Answer 5 · 2015-10-13 16:29:41

514

Views

Finding $\sum_{i = 1}^{n} \frac{n} { \gcd(i, n)}$

Published on 13 Oct 2015 - 16:29

score 293 · Answer 6 · 2015-10-14 20:41:38

293

Views

Let $n$ be a positive integer. Prove that if $18|n^3$, then $18|n^2$.

Published on 14 Oct 2015 - 20:41

score 59 · Answer 7 · 2026-03-06 22:16:10

59

Views

If $n$ is an odd integer, and $n$ divides $x^2-1$ then $n = \gcd(n, x-1)\cdot\gcd(n, x+1)$

Published on 06 Mar 2026 - 22:16

score 39 · Answer 8 · 2026-04-01 00:06:50

39

Views

Prove that if $c|gcd(a,b)$, then $c|a$ and $c|b$.

Published on 01 Apr 2026 - 0:06

score 81 · Answer 9 · 2026-04-01 07:32:16

81

Views

If $3|n^3$, does $3|n$?

Published on 01 Apr 2026 - 7:32

score 109 · Answer 10 · 2015-10-15 00:38:05

109

Views

Given that $18|n^3$, can we conclude $18|n^2$?

Published on 15 Oct 2015 - 0:38

score 151 · Answer 11 · 2015-10-15 16:16:34

151

Views

Show that if $gcd(a,b)|c$ then $ax+by=c$ has infinitely many solutions.

Published on 15 Oct 2015 - 16:16

score 110 · Answer 12 · 2015-10-15 16:59:47

110

Views

Prove gcd and common divisor

Published on 15 Oct 2015 - 16:59

score 50 · Answer 13 · 2026-03-28 01:08:37

50

Views

Prove Bezout Equation Problem

Published on 28 Mar 2026 - 1:08

score 1.9k · Answer 14 · 2026-04-01 08:06:25

1.9k

Views

Common prime divisors of 2 integers

Published on 01 Apr 2026 - 8:06

score 50 · Answer 15 · 2015-10-15 20:09:31

50

Views

proofs of elementary number theory

Published on 15 Oct 2015 - 20:09

List Question

Showing that if $(a,b)=1$ and if $a\mid c$ and $b\mid c$ then $ab \mid c$, in GCD domains

N bits, flip exactly M bits at a time, what is minimum number of operations to get all 0's to all 1's?

Adding fractions with variables and using common denominator. Merging and shortening $\frac{1}{2a+8} + \frac{4}{a^2-16} + \frac{4}{a-4}$

How to find the g.c.d when I have another g.c.d

Finding $\sum_{i = 1}^{n} \frac{n} { \gcd(i, n)}$

Let $n$ be a positive integer. Prove that if $18|n^3$, then $18|n^2$.

If $n$ is an odd integer, and $n$ divides $x^2-1$ then $n = \gcd(n, x-1)\cdot\gcd(n, x+1)$

Prove that if $c|gcd(a,b)$, then $c|a$ and $c|b$.

If $3|n^3$, does $3|n$?

Given that $18|n^3$, can we conclude $18|n^2$?

Show that if $gcd(a,b)|c$ then $ax+by=c$ has infinitely many solutions.

Prove gcd and common divisor

Prove Bezout Equation Problem

Common prime divisors of 2 integers

proofs of elementary number theory

Trending Questions

Popular # Hahtags

Popular Questions