List questions from gcd-and-lcm

Published on 10 May 2026 - 19:14

75

Views

RSA explanation

Published on 10 May 2026 - 19:00

129

Views

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

Published on 10 May 2026 - 11:19

38

Views

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

Published on 16 Apr 2026 - 0:11

711

Views

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

Published on 15 Apr 2026 - 8:26

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

292

Views

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

Published on 16 Apr 2026 - 11:56

225

Views

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

Published on 15 Apr 2026 - 2:41

192

Views

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

Published on 16 Apr 2026 - 19:46

25

Views

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

Published on 14 Apr 2026 - 21:58

60

Views

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

Published on 16 Apr 2026 - 12:12

87

Views

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

Published on 16 Apr 2026 - 14:17

377

Views

Solve it through LCM and HCF

Published on 10 May 2026 - 8:57

61

Views

Finding smaller number of two numbers using HCF and LCM

Published on 10 May 2026 - 14:08

155

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 10 May 2026 - 12:35

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