Question

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

score 173 · Answer 1 · 2026-05-07 16:53:05

173

Views

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

Published on 07 May 2026 - 16:53

score 5.2k · Answer 2 · 2026-04-12 10:55:03

5.2k

Views

Show that a matrix is invertible with norm less than one

Published on 12 Apr 2026 - 10:55

score 52 · Answer 3 · 2026-04-11 21:30:18

52

Views

Euclidean Division Rest Question

Published on 11 Apr 2026 - 21:30

score 173 · Answer 4 · 2026-04-13 15:34:05

173

Views

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

Published on 13 Apr 2026 - 15:34

score 173 · Answer 5 · 2026-04-17 15:52:25

173

Views

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

Published on 17 Apr 2026 - 15:52

score 474 · Answer 6 · 2026-04-29 12:22:44

474

Views

Homogeneous representation of the line passing through the points

Published on 29 Apr 2026 - 12:22

score 154 · Answer 7 · 2026-04-15 09:58:14

154

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 15 Apr 2026 - 9:58

score 46 · Answer 8 · 2026-04-12 08:13:50

46

Views

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

Published on 12 Apr 2026 - 8:13

score 813 · Answer 9 · 2026-04-14 00:21:22

813

Views

AP + BQ = 1 (Euclidean algorithm)

Published on 14 Apr 2026 - 0:21

score 82 · Answer 10 · 2026-04-13 17:25:12

82

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 13 Apr 2026 - 17:25

score 725 · Answer 11 · 2026-04-12 19:40:02

725

Views

Computing linear congruence - Euclidean algorithm

Published on 12 Apr 2026 - 19:40

score 119 · Answer 12 · 2026-04-13 20:15:48

119

Views

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

Published on 13 Apr 2026 - 20:15

score 1.2k · Answer 13 · 2026-04-14 05:27:59

1.2k

Views

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

Published on 14 Apr 2026 - 5:27

score 341 · Answer 14 · 2026-04-16 22:36:33

341

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 16 Apr 2026 - 22:36

score 88 · Answer 15 · 2026-04-15 20:28:29

88

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 15 Apr 2026 - 20:28

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