Question

Which kind of distance is this one? I want to compare if two images (matrices) are the same

score 144 · Answer 1 · 2020-06-10 07:11:52

144

Views

Which kind of distance is this one? I want to compare if two images (matrices) are the same

Published on 10 Jun 2020 - 7:11

score 161 · Answer 2 · 2020-06-20 12:09:27

161

Views

Bézout's coefficients, modular inverse

Published on 20 Jun 2020 - 12:09

score 69 · Answer 3 · 2026-03-26 06:02:35

69

Views

Find idempotent given generator poly and check poynomial by Bezout algorithm

Published on 26 Mar 2026 - 6:02

score 567 · Answer 4 · 2020-06-25 20:00:02

567

Views

How can I find the max number of times the Euclidean Algorithm must be executed for a given starting remainder?

Published on 25 Jun 2020 - 20:00

score 315 · Answer 5 · 2020-06-26 00:17:31

315

Views

Computational complexity of a modified Euclidean algorithm

Published on 26 Jun 2020 - 0:17

score 338 · Answer 6 · 2020-06-28 16:26:22

338

Views

Euclidean algorithm worst case: why never be more than five times the number of its digits (base 10)?

Published on 28 Jun 2020 - 16:26

score 946 · Answer 7 · 2020-07-05 10:36:45

946

Views

when $a$ and $b$ are relatively primes, how is $ax - by= 1$ always possible?

Published on 05 Jul 2020 - 10:36

score 61 · Answer 8 · 2026-02-23 12:08:50

61

Views

Given that $a,b \in \mathbb{Z}$ and are nonzero. Why is it that $\frac{a}{\gcd(a,b)}$ and $\frac{b}{\gcd(a,b)}$ are coprime?

Published on 23 Feb 2026 - 12:08

score 196 · Answer 9 · 2020-07-05 15:28:49

196

Views

Let $a,b \in \mathbb{Z}$ and let $d = gcd(a,b)$. Show that $\{ ka + lb: k,l \in \mathbb{Z}\} = \{md : m \in \mathbb{Z} \}$

Published on 05 Jul 2020 - 15:28

score 193 · Answer 10 · 2020-07-05 17:43:08

193

Views

Visualization for Euclidean Algorithm

Published on 05 Jul 2020 - 17:43

score 303 · Answer 11 · 2020-07-07 09:26:43

303

Views

A question regarding the proof of $\gcd(a^m-1, a^n-1) = a^{\gcd(m,n)}-1$

Published on 07 Jul 2020 - 9:26

score 348 · Answer 12 · 2020-07-14 21:21:41

348

Views

Optimality of Johnson-Lindenstrauss lemma

Published on 14 Jul 2020 - 21:21

score 643 · Answer 13 · 2020-07-20 22:29:02

643

Views

How to find positive coefficients in Bezout's Identity?

Published on 20 Jul 2020 - 22:29

score 129 · Answer 14 · 2026-03-26 08:02:37

129

Views

For this broad definition of Euclidean domain, is there a non-trivial example with finite set of norms?

Published on 26 Mar 2026 - 8:02

score 975 · Answer 15 · 2016-07-11 21:37:28

975

Views

Have I found an example of norm-Euclidean failure in $\mathbb Z [\sqrt{14}]$?

Published on 11 Jul 2016 - 21:37

List Question

Which kind of distance is this one? I want to compare if two images (matrices) are the same

Bézout's coefficients, modular inverse

Find idempotent given generator poly and check poynomial by Bezout algorithm

How can I find the max number of times the Euclidean Algorithm must be executed for a given starting remainder?

Computational complexity of a modified Euclidean algorithm

Euclidean algorithm worst case: why never be more than five times the number of its digits (base 10)?

when $a$ and $b$ are relatively primes, how is $ax - by= 1$ always possible?

Given that $a,b \in \mathbb{Z}$ and are nonzero. Why is it that $\frac{a}{\gcd(a,b)}$ and $\frac{b}{\gcd(a,b)}$ are coprime?

Let $a,b \in \mathbb{Z}$ and let $d = gcd(a,b)$. Show that $\{ ka + lb: k,l \in \mathbb{Z}\} = \{md : m \in \mathbb{Z} \}$

Visualization for Euclidean Algorithm

A question regarding the proof of $\gcd(a^m-1, a^n-1) = a^{\gcd(m,n)}-1$

Optimality of Johnson-Lindenstrauss lemma

How to find positive coefficients in Bezout's Identity?

For this broad definition of Euclidean domain, is there a non-trivial example with finite set of norms?

Have I found an example of norm-Euclidean failure in $\mathbb Z [\sqrt{14}]$?

Trending Questions

Popular # Hahtags

Popular Questions