Question

Solve the Following Congruences, or Explain Why They Have No Solution

score 2.4k · Answer 1 · 2026-04-14 13:16:54

2.4k

Views

Solve the Following Congruences, or Explain Why They Have No Solution

Published on 14 Apr 2026 - 13:16

score 146 · Answer 2 · 2026-04-14 04:59:08

146

Views

Continued Fraction of $ \frac{7 + 2 \sqrt{2}}{9 + \;\,\sqrt{2}}$ with coefficients in $\mathbb{Z}[\sqrt{2}]$

Published on 14 Apr 2026 - 4:59

score 198 · Answer 3 · 2026-04-25 12:20:57

198

Views

Organizing objects in a near-square pattern

Published on 25 Apr 2026 - 12:20

score 84 · Answer 4 · 2026-04-13 16:15:53

84

Views

Confused about multiplicative inverse of 11 in $\Bbb{Z}_{26}$?

Published on 13 Apr 2026 - 16:15

score 113 · Answer 5 · 2026-04-11 09:36:27

113

Views

Finding the correct $x$ to $ax - by = 1$

Published on 11 Apr 2026 - 9:36

score 49 · Answer 6 · 2026-04-16 10:57:28

49

Views

Finding the inverse of $\sum\limits_{i=0}^{49}u^i$ where $u$ is a complex root of $x^{50}-2$

Published on 16 Apr 2026 - 10:57

score 31 · Answer 7 · 2026-04-14 19:20:53

31

Views

(x,y) = (m_1,n_1) is the least positive solution of bx-ay= 1 while performing euclidean algorithm

Published on 14 Apr 2026 - 19:20

score 342 · Answer 8 · 2026-05-10 13:45:56

342

Views

Need help with Euclidean Algorithm in $\mathbb{Z}[i]$

Published on 10 May 2026 - 13:45

score 181 · Answer 9 · 2026-04-11 18:44:08

181

Views

Diophantine Equation - least values for n : absolute values

Published on 11 Apr 2026 - 18:44

score 93 · Answer 10 · 2026-04-16 02:02:41

93

Views

Solve $m \equiv 2014^{2014}\mod 17$ for the least positive value of $m$

Published on 16 Apr 2026 - 2:02

score 754 · Answer 11 · 2026-05-10 12:39:57

754

Views

GCD in arbitrary domain

Published on 10 May 2026 - 12:39

score 174 · Answer 12 · 2026-04-14 20:58:35

174

Views

Are there online Euclidean GCD calculators for Euclidean domains other than $\textbf Z$?

Published on 14 Apr 2026 - 20:58

score 799 · Answer 13 · 2026-04-10 05:05:39

799

Views

What is the worst case for the Euclidean algorithm in $\mathbb Z[i]$?

Published on 10 Apr 2026 - 5:05

score 159 · Answer 14 · 2026-04-15 08:04:52

159

Views

Division on a real quadratic ring of integers.

Published on 15 Apr 2026 - 8:04

score 502 · Answer 15 · 2026-04-09 17:25:39

502

Views

General solution for a Diophantine equation with more than two variables

Published on 09 Apr 2026 - 17:25

List Question

Solve the Following Congruences, or Explain Why They Have No Solution

Continued Fraction of $ \frac{7 + 2 \sqrt{2}}{9 + \;\,\sqrt{2}}$ with coefficients in $\mathbb{Z}[\sqrt{2}]$

Organizing objects in a near-square pattern

Confused about multiplicative inverse of 11 in $\Bbb{Z}_{26}$?

Finding the correct $x$ to $ax - by = 1$

Finding the inverse of $\sum\limits_{i=0}^{49}u^i$ where $u$ is a complex root of $x^{50}-2$

(x,y) = (m_1,n_1) is the least positive solution of bx-ay= 1 while performing euclidean algorithm

Need help with Euclidean Algorithm in $\mathbb{Z}[i]$

Diophantine Equation - least values for n : absolute values

Solve $m \equiv 2014^{2014}\mod 17$ for the least positive value of $m$

GCD in arbitrary domain

Are there online Euclidean GCD calculators for Euclidean domains other than $\textbf Z$?

What is the worst case for the Euclidean algorithm in $\mathbb Z[i]$?

Division on a real quadratic ring of integers.

General solution for a Diophantine equation with more than two variables

Trending Questions

Popular # Hahtags

Popular Questions