Question

reverse construction chinese remainder theorem

score 24 · Answer 1 · 2026-03-29 20:38:31

24

Views

reverse construction chinese remainder theorem

Published on 29 Mar 2026 - 20:38

score 23 · Answer 2 · 2024-03-04 17:29:07

23

Views

Can we find an explicit formula for $r$ and $s$ as a function of $k$

Published on 04 Mar 2024 - 17:29

score 28 · Answer 3 · 2026-03-26 22:13:11

28

Views

factorization into coprimes subordinate to two given coprimes in GCD domain

Published on 26 Mar 2026 - 22:13

score 96 · Answer 4 · 2026-03-26 04:35:16

96

Views

Conjecture: $\forall n \geq n_0\exists k \geq 0: \gcd(2^k-1, \frac{p_n\#}{6}) = 1$.

Published on 26 Mar 2026 - 4:35

score 33 · Answer 5 · 2024-03-13 10:57:58

33

Views

How to complete my proof on $a \mid c$, $b \mid c$ and $HCF(a,b)=1 \implies ab \mid c$

Published on 13 Mar 2024 - 10:57

score 46 · Answer 6 · 2024-03-14 15:54:39

46

Views

General formula for factoring $ax^2+bx+c$

Published on 14 Mar 2024 - 15:54

score 64 · Answer 7 · 2024-03-16 16:34:06

64

Views

How to prove that $\text{gcd}(a_1, a_2, ..., a_n) = \text{gcd}(a_1, a_1 + a_2, ..., a_1 + a_2 + ... + a_n)$

Published on 16 Mar 2024 - 16:34

score 39 · Answer 8 · 2024-03-18 16:35:47

39

Views

Find gcd of two multivariate polynomials

Published on 18 Mar 2024 - 16:35

score 55 · Answer 9 · 2024-03-21 11:31:32

55

Views

A set $S$ of positive integers is self-indulgent if $\gcd(a, b) = |a-b|$ for any two distinct $a,b\in S$

Published on 21 Mar 2024 - 11:31

score 51 · Answer 10 · 2026-03-26 22:33:15

51

Views

If $a$ and $b$ are coprimes in an euclidean domain, then $a^n$ and $b$ are coprimes.

Published on 26 Mar 2026 - 22:33

score 29 · Answer 11 · 2024-03-25 17:31:07

29

Views

Find a way to compute the number gcd(3^168 −1, 3^140 −1) without using a calculator and compute this number actually.

Published on 25 Mar 2024 - 17:31

score 99 · Answer 12 · 2026-03-27 15:18:19

99

Views

Minimal size of $a^2+b^2$ such that $ad-bc=1$

Published on 27 Mar 2026 - 15:18

score 13 · Answer 13 · 2026-03-23 23:32:00

13

Views

Getting the quotient $A/gcd(A,B)$ with the sub-resultant GCD algorithm

Published on 23 Mar 2026 - 23:32

score 508 · Answer 14 · 2015-01-15 23:09:01

508

Views

If $\gcd (a,b) = 1$, what can be said about $\gcd (a+b,a-b)$?

Published on 15 Jan 2015 - 23:09

score 94 · Answer 15 · 2015-01-21 07:15:43

94

Views

Greatest common divisor of an integer 'a' and its sum with 2.

Published on 21 Jan 2015 - 7:15

List Question

reverse construction chinese remainder theorem

Can we find an explicit formula for $r$ and $s$ as a function of $k$

factorization into coprimes subordinate to two given coprimes in GCD domain

Conjecture: $\forall n \geq n_0\exists k \geq 0: \gcd(2^k-1, \frac{p_n\#}{6}) = 1$.

How to complete my proof on $a \mid c$, $b \mid c$ and $HCF(a,b)=1 \implies ab \mid c$

General formula for factoring $ax^2+bx+c$

How to prove that $\text{gcd}(a_1, a_2, ..., a_n) = \text{gcd}(a_1, a_1 + a_2, ..., a_1 + a_2 + ... + a_n)$

Find gcd of two multivariate polynomials

A set $S$ of positive integers is self-indulgent if $\gcd(a, b) = |a-b|$ for any two distinct $a,b\in S$

If $a$ and $b$ are coprimes in an euclidean domain, then $a^n$ and $b$ are coprimes.

Find a way to compute the number gcd(3^168 −1, 3^140 −1) without using a calculator and compute this number actually.

Minimal size of $a^2+b^2$ such that $ad-bc=1$

Getting the quotient $A/gcd(A,B)$ with the sub-resultant GCD algorithm

If $\gcd (a,b) = 1$, what can be said about $\gcd (a+b,a-b)$?

Greatest common divisor of an integer 'a' and its sum with 2.

Trending Questions

Popular # Hahtags

Popular Questions