List questions from euclidean-algorithm

Published on 14 Feb 2017 - 9:40

390

Views

Prove that for any $m > 0$, $\gcd(mb,mc) = m\gcd(b,c)$.

Published on 14 Feb 2017 - 10:56

786

Views

How can 2D points be interpolated?

Published on 14 Feb 2017 - 22:57

68

Views

$(x,y) \in \mathbb Z \times\mathbb Z$ with $336x+378y=\gcd(336,378)$

Published on 16 Feb 2017 - 8:42

175

Views

A small question about multiplicative inverses

Published on 16 Feb 2017 - 21:27

97

Views

Prove that for distinct prime numbers $p$ and $q$, and natural numbers $m$ and $n$, $\phi(p^{m}q^{n}) = (p^{m} − p^{m−1})(q^{n} − q^{n−1})$.

Published on 03 Mar 2017 - 2:57

52

Views

Simple p-adic algebra problem

Published on 04 Mar 2017 - 17:02

1.1k

Views

Finding consecutive naturals that all fail to have inverses modulo $70$

Published on 06 Mar 2017 - 14:03

773

Views

Find the GCD of the following values in $Z[i]$

Published on 10 Mar 2017 - 1:11

101

Views

Use extended Euclidean algorithm to find $j,k$ such that $52j+15k=3$

Published on 11 Mar 2017 - 15:22

1k

Views

gcd($x, pq$) = 1 $\Rightarrow$ gcd($x, p$) = 1 and gcd($x, q$) = 1

Published on 12 Mar 2017 - 11:04

334

Views

Find inverse modulo using extended euclid's algorithm

Published on 13 Mar 2017 - 17:55

1.2k

Views

division of polynomials in $\mathbb{Z_2}$

Published on 14 Mar 2017 - 4:49

784

Views

how to formally prove that $R[x]/ \langle f(x)\rangle$ is isomorphic to $R[α]$

Published on 17 Mar 2017 - 4:29

53

Views

Extend triple of coprime numbers to summation of coprime numbers

Published on 26 Mar 2026 - 19:01

List Question

Euclidean distance question

Prove that for any $m > 0$, $\gcd(mb,mc) = m\gcd(b,c)$.

How can 2D points be interpolated?

$(x,y) \in \mathbb Z \times\mathbb Z$ with $336x+378y=\gcd(336,378)$

A small question about multiplicative inverses

Prove that for distinct prime numbers $p$ and $q$, and natural numbers $m$ and $n$, $\phi(p^{m}q^{n}) = (p^{m} − p^{m−1})(q^{n} − q^{n−1})$.

Simple p-adic algebra problem

Finding consecutive naturals that all fail to have inverses modulo $70$

Find the GCD of the following values in $Z[i]$

Use extended Euclidean algorithm to find $j,k$ such that $52j+15k=3$

gcd($x, pq$) = 1 $\Rightarrow$ gcd($x, p$) = 1 and gcd($x, q$) = 1

Find inverse modulo using extended euclid's algorithm

division of polynomials in $\mathbb{Z_2}$

how to formally prove that $R[x]/ \langle f(x)\rangle$ is isomorphic to $R[α]$

Extend triple of coprime numbers to summation of coprime numbers

Trending Questions

Popular # Hahtags

Popular Questions