Question

How can I do the Euclidian's algorithm and the Extended Euclidean algorithm at the same time?

score 168 · Answer 1 · 2026-03-19 20:44:39

168

Views

How can I do the Euclidian's algorithm and the Extended Euclidean algorithm at the same time?

Published on 19 Mar 2026 - 20:44

score 5.2k · Answer 2 · 2018-04-17 22:27:17

5.2k

Views

Show that a matrix is invertible with norm less than one

Published on 17 Apr 2018 - 22:27

score 47 · Answer 3 · 2018-04-21 10:05:32

47

Views

Euclidean Division Rest Question

Published on 21 Apr 2018 - 10:05

score 170 · Answer 4 · 2018-04-25 20:08:02

170

Views

How to find examples of non-unique euclidean division in $\Bbb Z[i]$?

Published on 25 Apr 2018 - 20:08

score 171 · Answer 5 · 2018-04-26 18:23:09

171

Views

Number of integers satisfying $\left[\frac{x}{100}\left[\frac{x}{100}\right]\right]=5$

Published on 26 Apr 2018 - 18:23

score 466 · Answer 6 · 2026-03-24 23:45:57

466

Views

Homogeneous representation of the line passing through the points

Published on 24 Mar 2026 - 23:45

score 151 · Answer 7 · 2018-04-30 00:53:58

151

Views

All ideals of $\mathbb Z[x]$ are of the form $\langle n\rangle\langle f(x)\rangle, \langle n,f(x)\rangle$, attempt inside but not complete

Published on 30 Apr 2018 - 0:53

score 43 · Answer 8 · 2018-05-03 22:33:07

43

Views

How do you justify a preference for the positive purely real integer in a GCD computation?

Published on 03 May 2018 - 22:33

score 809 · Answer 9 · 2018-05-04 15:55:23

809

Views

AP + BQ = 1 (Euclidean algorithm)

Published on 04 May 2018 - 15:55

score 79 · Answer 10 · 2018-05-11 15:32:51

79

Views

Use the Euclid's Algorithm to find the value of $[23]^{-1}$ and $[42]^{-1}$ in ($\mathbb{Z}/73\mathbb{Z}) \setminus \{0\}, *$)

Published on 11 May 2018 - 15:32

score 722 · Answer 11 · 2018-05-27 18:15:18

722

Views

Computing linear congruence - Euclidean algorithm

Published on 27 May 2018 - 18:15

score 116 · Answer 12 · 2018-06-09 22:32:12

116

Views

Is there an intuitive way to tell if some integers are relatively prime?

Published on 09 Jun 2018 - 22:32

score 1.2k · Answer 13 · 2018-06-15 16:00:16

1.2k

Views

Calculation of modular multiplicative inverse of A mod B when A > B

Published on 15 Jun 2018 - 16:00

score 339 · Answer 14 · 2018-06-17 18:50:06

339

Views

Confused by induction on $\max(n ,m)$ in proof of $\gcd(t^n-1, t^m-1)=t^{\gcd(n,m)}-1$

Published on 17 Jun 2018 - 18:50

score 85 · Answer 15 · 2018-06-19 01:35:36

85

Views

Finding the inverse of $x^3+x^2+1$ in $\Bbb F_2[x]/(x^4+x^2)$ with the Euclidean algorithm

Published on 19 Jun 2018 - 1:35

List Question

How can I do the Euclidian's algorithm and the Extended Euclidean algorithm at the same time?

Show that a matrix is invertible with norm less than one

Euclidean Division Rest Question

How to find examples of non-unique euclidean division in $\Bbb Z[i]$?

Number of integers satisfying $\left[\frac{x}{100}\left[\frac{x}{100}\right]\right]=5$

Homogeneous representation of the line passing through the points

All ideals of $\mathbb Z[x]$ are of the form $\langle n\rangle\langle f(x)\rangle, \langle n,f(x)\rangle$, attempt inside but not complete

How do you justify a preference for the positive purely real integer in a GCD computation?

AP + BQ = 1 (Euclidean algorithm)

Use the Euclid's Algorithm to find the value of $[23]^{-1}$ and $[42]^{-1}$ in ($\mathbb{Z}/73\mathbb{Z}) \setminus \{0\}, *$)

Computing linear congruence - Euclidean algorithm

Is there an intuitive way to tell if some integers are relatively prime?

Calculation of modular multiplicative inverse of A mod B when A > B

Confused by induction on $\max(n ,m)$ in proof of $\gcd(t^n-1, t^m-1)=t^{\gcd(n,m)}-1$

Finding the inverse of $x^3+x^2+1$ in $\Bbb F_2[x]/(x^4+x^2)$ with the Euclidean algorithm

Trending Questions

Popular # Hahtags

Popular Questions