List questions from euclidean-algorithm

Published on 10 May 2016 - 20:31

418

Views

Using the Euclidean algorithm to show that $\gcd(11k+7, 5k+3)=1$

Published on 13 May 2016 - 22:56

139

Views

Solve $276 x\equiv 90\pmod {666}$

Published on 18 May 2016 - 7:35

425

Views

Using the Affine cipher, do we need $a^{-1}$ if we know gcd(a,26)=1?

Published on 26 Mar 2026 - 4:30

1.9k

Views

Get integer solutions for $13x\equiv1\pmod{60}$ by euclidean method

Published on 19 May 2016 - 14:15

6k

Views

Find the inverse of $2$ modulo $17$ using the Euclidean algorithm

Published on 30 May 2016 - 23:42

2.7k

Views

Prove that $\mathbb{Z}[\sqrt{-2}]$ is a Euclidean domain

Published on 05 Jun 2016 - 18:57

714

Views

Diophantine equations using Euclidean algorithm

Published on 12 Jun 2016 - 2:25

235

Views

Can we characterize all infinite Euclidean domains having exactly one invertible element?

Published on 28 Mar 2026 - 1:24

171

Views

How to find the modulo multiplicative inverse?

Published on 16 Jun 2016 - 1:08

1k

Views

Suppose the integers $m^2$ and $n$ are relatively prime. Show that $m$ and $n^2$ are relatively prime.

Published on 16 Jun 2016 - 2:30

5.4k

Views

Finding integers $x$ and $y$ such that $633x + 255y = 6$

Published on 19 Jun 2016 - 15:01

1.9k

Views

Proof about euclidean algorithm

Published on 22 Jun 2016 - 10:28

171

Views

find $u,v\in \mathbb Z$ such that $231u+45v=1$.

Published on 23 Jun 2016 - 11:11

66

Views

A number theory proof - how do I use these intuitions to prove $c^2 \mid ab$?

Published on 29 Jun 2016 - 15:11

List Question

How Euclidian Algorithm for division works with algebric expressions?

Using the Euclidean algorithm to show that $\gcd(11k+7, 5k+3)=1$

Solve $276 x\equiv 90\pmod {666}$

Using the Affine cipher, do we need $a^{-1}$ if we know gcd(a,26)=1?

Get integer solutions for $13x\equiv1\pmod{60}$ by euclidean method

Find the inverse of $2$ modulo $17$ using the Euclidean algorithm

Prove that $\mathbb{Z}[\sqrt{-2}]$ is a Euclidean domain

Diophantine equations using Euclidean algorithm

Can we characterize all infinite Euclidean domains having exactly one invertible element?

How to find the modulo multiplicative inverse?

Suppose the integers $m^2$ and $n$ are relatively prime. Show that $m$ and $n^2$ are relatively prime.

Finding integers $x$ and $y$ such that $633x + 255y = 6$

Proof about euclidean algorithm

find $u,v\in \mathbb Z$ such that $231u+45v=1$.

A number theory proof - how do I use these intuitions to prove $c^2 \mid ab$?

Trending Questions

Popular # Hahtags

Popular Questions