Question

Determine an angle in two overlapping triangles

score 94 · Answer 1 · 2023-09-15 13:18:39

94

Views

Determine an angle in two overlapping triangles

Published on 15 Sep 2023 - 13:18

score 47 · Answer 2 · 2023-10-03 22:08:45

47

Views

Exended Euclidean algorithm, row reduction of Sylvester matrix, and gcd

Published on 03 Oct 2023 - 22:08

score 148 · Answer 3 · 2026-03-25 23:13:05

148

Views

Prove there is a polynomial $d(x) \in \mathbb Q[x]$ that is a gcd of $f(x)$ and $g(x)$ and whose term of minimal degree is $d_rx^r.$ (D&F #9.3.5(a)).

Published on 25 Mar 2026 - 23:13

score 293 · Answer 4 · 2023-10-12 16:20:50

293

Views

What is the correct formula for Within Cluster Sum of Squares

Published on 12 Oct 2023 - 16:20

score 49 · Answer 5 · 2023-11-14 10:31:53

49

Views

help with Lamé's Theorem (Knuth) induction step

Published on 14 Nov 2023 - 10:31

score 14 · Answer 6 · 2026-03-26 20:49:59

14

Views

L2 distance computation with given L2 distance to triangle nodes.

Published on 26 Mar 2026 - 20:49

score 48 · Answer 7 · 2023-11-30 00:06:52

48

Views

How to compute inverses in $\mathbb{Q}[x] / \langle x^3 + 3x + 3 \rangle$

Published on 30 Nov 2023 - 0:06

score 80 · Answer 8 · 2023-12-09 14:32:55

80

Views

Calculating the gcd of two polynomials in integers using a prime field

Published on 09 Dec 2023 - 14:32

score 106 · Answer 9 · 2023-12-09 17:03:20

106

Views

Algebra: find polynomials $M(x)$ and $N(x)$ such that $x^{m}M(x)+(1-x)^{n}N(x)=1$.

Published on 09 Dec 2023 - 17:03

score 51 · Answer 10 · 2023-12-18 14:48:56

51

Views

Extended Euclidian algorithm for polynomials

Published on 18 Dec 2023 - 14:48

score 46 · Answer 11 · 2023-12-24 13:46:10

46

Views

Logic behind the Extended Euclidean Algorithm

Published on 24 Dec 2023 - 13:46

score 138 · Answer 12 · 2023-12-29 16:25:53

138

Views

Seeking Help Understanding Specific Terms in 7-adic and 5-adic Euclidean Algorithms

Published on 29 Dec 2023 - 16:25

score 87 · Answer 13 · 2026-03-26 20:45:20

87

Views

Definition of "division with remainder" for rings?

Published on 26 Mar 2026 - 20:45

score 34 · Answer 14 · 2024-01-21 11:16:29

34

Views

If we have the Bezout coefficient, how to find the smallest possible coefficient that can take its place?

Published on 21 Jan 2024 - 11:16

score 96 · Answer 15 · 2024-01-23 17:34:25

96

Views

An intuitive, geometric and informal proof of the Euclidean algorithm

Published on 23 Jan 2024 - 17:34

List Question

Determine an angle in two overlapping triangles

Exended Euclidean algorithm, row reduction of Sylvester matrix, and gcd

Prove there is a polynomial $d(x) \in \mathbb Q[x]$ that is a gcd of $f(x)$ and $g(x)$ and whose term of minimal degree is $d_rx^r.$ (D&F #9.3.5(a)).

What is the correct formula for Within Cluster Sum of Squares

help with Lamé's Theorem (Knuth) induction step

L2 distance computation with given L2 distance to triangle nodes.

How to compute inverses in $\mathbb{Q}[x] / \langle x^3 + 3x + 3 \rangle$

Calculating the gcd of two polynomials in integers using a prime field

Algebra: find polynomials $M(x)$ and $N(x)$ such that $x^{m}M(x)+(1-x)^{n}N(x)=1$.

Extended Euclidian algorithm for polynomials

Logic behind the Extended Euclidean Algorithm

Seeking Help Understanding Specific Terms in 7-adic and 5-adic Euclidean Algorithms

Definition of "division with remainder" for rings?

If we have the Bezout coefficient, how to find the smallest possible coefficient that can take its place?

An intuitive, geometric and informal proof of the Euclidean algorithm

Trending Questions

Popular # Hahtags

Popular Questions