Newbetuts
.
New posts in euclidean-algorithm
Gcd and lcm of $a_1, a_2, \dots,a_n$ exist in $R$ when $R$ is a UFD.
abstract-algebra
ring-theory
euclidean-algorithm
What is $\frac{1}{1+\sqrt[3]{2}}$ in $\mathbb{Q}(\sqrt[3]{2})$?
algebraic-number-theory
euclidean-algorithm
Is there a clever way to find a smaller number that produces the Euclidean algorithm of given length?
number-theory
elementary-number-theory
modular-arithmetic
euclidean-algorithm
Finding consecutive naturals that all fail to have inverses modulo $70$
elementary-number-theory
discrete-mathematics
euclidean-algorithm
What other forms can Euclidean failure take?
algebraic-number-theory
euclidean-algorithm
Proving the number of iterations in the Euclidean algorithm
euclidean-algorithm
Using GCD with remainder to list all the integer elements in the set
elementary-number-theory
gcd-and-lcm
euclidean-algorithm
GCD in arbitrary domain
abstract-algebra
commutative-algebra
gcd-and-lcm
euclidean-algorithm
euclidean-domain
How to show every field is a Euclidean Domain.
abstract-algebra
field-theory
integral-domain
euclidean-algorithm
Why does the Euclidean algorithm for finding GCD work?
gcd-and-lcm
euclidean-algorithm
Localization Preserves Euclidean Domains
abstract-algebra
ring-theory
euclidean-algorithm
localization
Have I found an example of norm-Euclidean failure in $\mathbb Z [\sqrt{14}]$?
algebraic-number-theory
euclidean-algorithm
Why are Fibonacci numbers bad for Euclid's Algorithm and how to derive this upper bound on number of steps needed in general?
elementary-number-theory
fibonacci-numbers
gcd-and-lcm
euclidean-algorithm
The ring $\mathbb Z[\sqrt{-2}]= \{a+b\sqrt{-2} ; a\in \mathbb Z,b\in \mathbb Z \}$ has a Euclidean algorithm
abstract-algebra
elementary-number-theory
euclidean-algorithm
Inverse with Extended Euclidean Algorithm
cryptography
euclidean-algorithm
numerical-calculus
Does modulus m need to be prime in finding the modular inverse? [duplicate]
elementary-number-theory
modular-arithmetic
euclidean-algorithm
'Gauss's Algorithm' for computing modular fractions and inverses
elementary-number-theory
modular-arithmetic
euclidean-algorithm
Extended Euclidean Algorithm: backward vs. forward
divisibility
euclidean-algorithm
Linear diophantine equation $100x - 23y = -19$
elementary-number-theory
modular-arithmetic
diophantine-equations
euclidean-algorithm
linear-diophantine-equations
How to use the Extended Euclidean Algorithm manually?
elementary-number-theory
algorithms
gcd-and-lcm
euclidean-algorithm
Prev