Question

Another elementary number theory problem

score 67 · Answer 1 · 2019-08-06 02:58:07

67

Views

Another elementary number theory problem

Published on 06 Aug 2019 - 2:58

score 140 · Answer 2 · 2019-08-10 00:26:30

140

Views

Stuck on Euclidean Algorithm Answer

Published on 10 Aug 2019 - 0:26

score 488 · Answer 3 · 2019-08-10 09:49:47

488

Views

euclidean algorithm and linear combination for gcd

Published on 10 Aug 2019 - 9:49

score 65 · Answer 4 · 2019-08-12 10:29:06

65

Views

Polynomial division: the degree of the remainder

Published on 12 Aug 2019 - 10:29

score 23 · Answer 5 · 2019-08-12 13:09:31

23

Views

A polynomial geometric progression with small-degree terms

Published on 12 Aug 2019 - 13:09

score 421 · Answer 6 · 2019-08-15 20:42:55

421

Views

Linear Combinations and Euclidean Algorithm question

Published on 15 Aug 2019 - 20:42

score 2.7k · Answer 7 · 2019-08-22 22:40:30

2.7k

Views

Using the Euclidean Algorithm how to find the inverse of 41 in Z(131)

Published on 22 Aug 2019 - 22:40

score 74 · Answer 8 · 2019-08-25 15:34:54

74

Views

Variable confusion in Euclid division lemma

Published on 25 Aug 2019 - 15:34

score 32 · Answer 9 · 2019-09-03 19:09:04

32

Views

If $|n|< b^m$ then $|n|= \sum_{i=0}^{m-1} x_i b^i$ (representation of a number in terms of radix/ base $b$)

Published on 03 Sep 2019 - 19:09

score 81 · Answer 10 · 2019-09-09 14:58:45

81

Views

$m$ square-free integer such that $4\vert m-1\implies 2$ irreducible in $\mathbb{Z}[\sqrt{m}]$

Published on 09 Sep 2019 - 14:58

score 117 · Answer 11 · 2019-09-09 17:04:05

117

Views

GCD Euclidean algorithm x WolframAlpha

Published on 09 Sep 2019 - 17:04

score 151 · Answer 12 · 2026-03-25 07:45:47

151

Views

A man exchanges 9763 yen for USD and CAD. 99 yen = 1USD, 86yen = 1CAD how much of each currency did he exchange?

Published on 25 Mar 2026 - 7:45

score 298 · Answer 13 · 2019-09-30 15:09:41

298

Views

Prove that for every natural number $n$, there is a set $S$ of $n$ natural numbers such that for any two different numbers $a,b$ From $S$ the number…

Published on 30 Sep 2019 - 15:09

score 315 · Answer 14 · 2014-04-22 14:18:52

315

Views

$Q\mid P\ {\rm in}\ \Bbb R[X]\,$ if $\,Q\mid P\ {\rm in}\ \Bbb C[X]\ $ [divisibility stable under polynomial coef. ring extension]

Published on 22 Apr 2014 - 14:18

score 262 · Answer 15 · 2014-05-22 11:42:50

262

Views

Euclidean algorithm of two polynomials

Published on 22 May 2014 - 11:42

List Question

Another elementary number theory problem

Stuck on Euclidean Algorithm Answer

euclidean algorithm and linear combination for gcd

Polynomial division: the degree of the remainder

A polynomial geometric progression with small-degree terms

Linear Combinations and Euclidean Algorithm question

Using the Euclidean Algorithm how to find the inverse of 41 in Z(131)

Variable confusion in Euclid division lemma

If $|n|< b^m$ then $|n|= \sum_{i=0}^{m-1} x_i b^i$ (representation of a number in terms of radix/ base $b$)

$m$ square-free integer such that $4\vert m-1\implies 2$ irreducible in $\mathbb{Z}[\sqrt{m}]$

GCD Euclidean algorithm x WolframAlpha

A man exchanges 9763 yen for USD and CAD. 99 yen = 1USD, 86yen = 1CAD how much of each currency did he exchange?

Prove that for every natural number $n$, there is a set $S$ of $n$ natural numbers such that for any two different numbers $a,b$ From $S$ the number…

$Q\mid P\ {\rm in}\ \Bbb R[X]\,$ if $\,Q\mid P\ {\rm in}\ \Bbb C[X]\ $ [divisibility stable under polynomial coef. ring extension]

Euclidean algorithm of two polynomials

Trending Questions

Popular # Hahtags

Popular Questions