Question

Proof verification for a $\gcd$ number theory proof

score 42 · Answer 1 · 2020-09-29 11:55:46

42

Views

Proof verification for a $\gcd$ number theory proof

Published on 29 Sep 2020 - 11:55

score 143 · Answer 2 · 2020-09-30 16:50:54

How do I answer a question when only one number is given and the other we need to find and the lcm and hcf are given

score 33 · Answer 3 · 2020-10-02 06:43:50

33

Views

Proving relatively prime in a sequence?

Published on 02 Oct 2020 - 6:43

score 56 · Answer 4 · 2020-10-02 09:57:20

56

Views

Is the following statement true and why/why not?

Published on 02 Oct 2020 - 9:57

score 32 · Answer 5 · 2020-10-02 11:55:23

32

Views

will any divisor of $0<a,b$ also divide $\gcd(a,b)$?

Published on 02 Oct 2020 - 11:55

score 87 · Answer 6 · 2020-10-04 05:04:28

87

Views

Let a, b, c be ints. $\frac{ab}{c} + \frac{bc}{a} + \frac{ac}{b}$ is an int, show that each of $\frac{ab}{c}, \frac{bc}{a}, \frac{ac}{b}$ is an int.

Published on 04 Oct 2020 - 5:04

score 100 · Answer 7 · 2020-10-04 11:48:05

100

Views

Doubt in the proof of $\operatorname{lcm}(m,n) = mn / \operatorname{gcd}(m,n)$

Published on 04 Oct 2020 - 11:48

score 44 · Answer 8 · 2020-10-04 18:57:06

44

Views

Find the cardinal of a specific set>

Published on 04 Oct 2020 - 18:57

score 43 · Answer 9 · 2020-10-05 09:31:59

43

Views

prime numbers & gcd

Published on 05 Oct 2020 - 9:31

score 506 · Answer 10 · 2020-10-06 21:55:38

506

Views

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

Published on 06 Oct 2020 - 21:55

score 219 · Answer 11 · 2020-10-07 06:13:01

219

Views

Assume $(G,\times)$ is a group and for $a,b \in G$: $ab=ba$, $\text{ord}(a)=n$, $\text{ord} (b)=m$

Published on 07 Oct 2020 - 6:13

score 183 · Answer 12 · 2026-03-30 00:16:47

183

Views

GCD computation in Modular Residue Number System

Published on 30 Mar 2026 - 0:16

score 96 · Answer 13 · 2020-10-08 14:28:58

96

Views

Calculation of GCD of two polynomials

Published on 08 Oct 2020 - 14:28

score 51 · Answer 14 · 2020-10-08 19:02:37

51

Views

$\gcd(p, qx_1 + rx_2) = 1$ for primes $p,q,r \ge 2^k$ and $x_1, x_2 < 2^k$

Published on 08 Oct 2020 - 19:02

score 279 · Answer 15 · 2020-10-08 23:53:10

279

Views

Show that for any positive integer n, the kth root of n is either an integer or irrational

Published on 08 Oct 2020 - 23:53

List Question

Proof verification for a $\gcd$ number theory proof

How do I answer a question when only one number is given and the other we need to find and the lcm and hcf are given

Proving relatively prime in a sequence?

Is the following statement true and why/why not?

will any divisor of $0<a,b$ also divide $\gcd(a,b)$?

Let a, b, c be ints. $\frac{ab}{c} + \frac{bc}{a} + \frac{ac}{b}$ is an int, show that each of $\frac{ab}{c}, \frac{bc}{a}, \frac{ac}{b}$ is an int.

Doubt in the proof of $\operatorname{lcm}(m,n) = mn / \operatorname{gcd}(m,n)$

Find the cardinal of a specific set>

prime numbers & gcd

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

Assume $(G,\times)$ is a group and for $a,b \in G$: $ab=ba$, $\text{ord}(a)=n$, $\text{ord} (b)=m$

GCD computation in Modular Residue Number System

Calculation of GCD of two polynomials

$\gcd(p, qx_1 + rx_2) = 1$ for primes $p,q,r \ge 2^k$ and $x_1, x_2 < 2^k$

Show that for any positive integer n, the kth root of n is either an integer or irrational

Trending Questions

Popular # Hahtags

Popular Questions