List questions from gcd-and-lcm

Published on 02 Apr 2018 - 16:26

70

Views

RSA explanation

Published on 25 Mar 2026 - 9:33

124

Views

Using the Euclidean algorithm, deduce that $\gcd(x^3+2x^2+x +4;x^2+1)=1$

Published on 25 Mar 2026 - 6:00

36

Views

How to compute $x_{2i}$ directly from $x_i$ in this $x^2 \mod N$ sequence?

Published on 25 Mar 2026 - 9:26

709

Views

Proof for showing the order of $a^k$ is $\frac{d}{gcd(k,d)}$.

Published on 08 Apr 2018 - 19:46

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

289

Views

The first number larger than 300 that is a multiple of both 6 and 8.

Published on 13 Apr 2018 - 20:06

222

Views

The biggest $\gcd(11n+4, 7n+2)$?

Published on 17 Apr 2018 - 19:49

189

Views

Map $\tau(s,t)=(as+bt)\mod{ab}$ is bijection iff $gcd(a,b)=1$

Published on 21 Apr 2018 - 11:05

22

Views

Defining a suitable Euclidean Ring s.t. $\exists a,b \in \mathbb{Z}$ st $512a + 972b = 4$

Published on 22 Apr 2018 - 16:11

57

Views

To show $(n,n+1)=1$ for all $n>0$

Published on 24 Apr 2018 - 9:32

84

Views

If $a\mid b$ and $a>0$ then $(a,b)=a$

Published on 24 Apr 2018 - 10:19

370

Views

Solve it through LCM and HCF

Published on 23 Mar 2026 - 10:31

56

Views

Finding smaller number of two numbers using HCF and LCM

Published on 23 Mar 2026 - 9:48

152

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 25 Mar 2026 - 6:22

List Question

Greatest Common Divisors of powers - 1?

RSA explanation

Using the Euclidean algorithm, deduce that $\gcd(x^3+2x^2+x +4;x^2+1)=1$

How to compute $x_{2i}$ directly from $x_i$ in this $x^2 \mod N$ sequence?

Proof for showing the order of $a^k$ is $\frac{d}{gcd(k,d)}$.

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

The first number larger than 300 that is a multiple of both 6 and 8.

The biggest $\gcd(11n+4, 7n+2)$?

Map $\tau(s,t)=(as+bt)\mod{ab}$ is bijection iff $gcd(a,b)=1$

Defining a suitable Euclidean Ring s.t. $\exists a,b \in \mathbb{Z}$ st $512a + 972b = 4$

To show $(n,n+1)=1$ for all $n>0$

If $a\mid b$ and $a>0$ then $(a,b)=a$

Solve it through LCM and HCF

Finding smaller number of two numbers using HCF and LCM

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

Trending Questions

Popular # Hahtags

Popular Questions