Question

Why doesn't one see more induction on the number of primes arguments?

score 206 · Answer 1 · 2019-02-01 03:07:23

206

Views

Why doesn't one see more induction on the number of primes arguments?

Published on 01 Feb 2019 - 3:07

score 29 · Answer 2 · 2026-03-26 13:52:18

29

Views

Given $k$, for every $n>1$, constructing a set of size $n$ of non-zero integers having gcd $k$ so that no proper subset has gcd $k$

Published on 26 Mar 2026 - 13:52

score 80 · Answer 3 · 2019-02-02 02:22:44

80

Views

Prove (15n+17,10n+11) = 1

Published on 02 Feb 2019 - 2:22

score 63 · Answer 4 · 2019-02-05 06:11:38

63

Views

If $gcd(a,b)=1$ then $gcd\big(\frac{a^{p}+b^{p}}{a+b},a+b\big)=1$ unless $p|a+b$

Published on 05 Feb 2019 - 6:11

score 127 · Answer 5 · 2026-02-23 09:01:50

127

Views

Find divisors $n_i$ of $a_i$, mutualy coprime, with $\prod n_i=\operatorname{lcm}(a_i)$

Published on 23 Feb 2026 - 9:01

score 159 · Answer 6 · 2026-03-25 07:52:27

159

Views

If $\sigma(n)/n = 5/3$, then $5 \nmid n$. Does it also follow that $3 \nmid \sigma(n)$?

Published on 25 Mar 2026 - 7:52

score 117 · Answer 7 · 2026-03-25 15:43:44

117

Views

What are $x$ and $y$ in $xF_n$ + $yF_{n-1}$ = $1$?

Published on 25 Mar 2026 - 15:43

score 680 · Answer 8 · 2019-02-09 18:08:40

680

Views

Prove $\gcd(m, n)=\gcd(m, 2n)$

Published on 09 Feb 2019 - 18:08

score 275 · Answer 9 · 2019-02-09 20:58:56

275

Views

Prove gcd(f(n), f(n+1))=1

Published on 09 Feb 2019 - 20:58

score 85 · Answer 10 · 2019-02-11 01:13:03

85

Views

trying to prove that if m, n and a are in the integers then $gcd(m, n) = gcd(n, m - an)$

Published on 11 Feb 2019 - 1:13

score 71 · Answer 11 · 2026-02-23 03:01:20

71

Views

Show that there exist $a,b \in K [X_1,X_2,\cdots,X_n]$ and $d \in K[X_1,X_2,\cdots,X_{n-1}]$ such that $aF+bG = d.$

Published on 23 Feb 2026 - 3:01

score 114 · Answer 12 · 2019-02-12 08:49:40

114

Views

Find x such that $495x \equiv 90 \pmod{6}$ or explain why it does not exist

Published on 12 Feb 2019 - 8:49

score 293 · Answer 13 · 2019-02-16 18:13:39

293

Views

Show that if $\gcd(abc,d^2)=1$, then $\gcd(a,d)=\gcd(b,d)=\gcd(c,d)=1$.

Published on 16 Feb 2019 - 18:13

score 237 · Answer 14 · 2026-03-23 04:48:13

237

Views

Numerical example for $\gcd(a,b)=\prod p_i^{\min(a_i,b_i)}$

Published on 23 Mar 2026 - 4:48

score 49 · Answer 15 · 2019-02-17 23:06:25

49

Views

Greatest common divisor with $a \cdot s + b \cdot t = ggT(a,b)$

Published on 17 Feb 2019 - 23:06

List Question

Why doesn't one see more induction on the number of primes arguments?

Given $k$, for every $n>1$, constructing a set of size $n$ of non-zero integers having gcd $k$ so that no proper subset has gcd $k$

Prove (15n+17,10n+11) = 1

If $gcd(a,b)=1$ then $gcd\big(\frac{a^{p}+b^{p}}{a+b},a+b\big)=1$ unless $p|a+b$

Find divisors $n_i$ of $a_i$, mutualy coprime, with $\prod n_i=\operatorname{lcm}(a_i)$

If $\sigma(n)/n = 5/3$, then $5 \nmid n$. Does it also follow that $3 \nmid \sigma(n)$?

What are $x$ and $y$ in $xF_n$ + $yF_{n-1}$ = $1$?

Prove $\gcd(m, n)=\gcd(m, 2n)$

Prove gcd(f(n), f(n+1))=1

trying to prove that if m, n and a are in the integers then $gcd(m, n) = gcd(n, m - an)$

Show that there exist $a,b \in K [X_1,X_2,\cdots,X_n]$ and $d \in K[X_1,X_2,\cdots,X_{n-1}]$ such that $aF+bG = d.$

Find x such that $495x \equiv 90 \pmod{6}$ or explain why it does not exist

Show that if $\gcd(abc,d^2)=1$, then $\gcd(a,d)=\gcd(b,d)=\gcd(c,d)=1$.

Numerical example for $\gcd(a,b)=\prod p_i^{\min(a_i,b_i)}$

Greatest common divisor with $a \cdot s + b \cdot t = ggT(a,b)$

Trending Questions

Popular # Hahtags

Popular Questions