Question

Finding all principal ideals of $\mathbb{Z}[\sqrt{-7}]$ containing a certain element.

score 204 · Answer 1 · 2020-10-09 00:32:24

204

Views

Finding all principal ideals of $\mathbb{Z}[\sqrt{-7}]$ containing a certain element.

Published on 09 Oct 2020 - 0:32

score 434 · Answer 2 · 2020-10-14 06:28:32

434

Views

if m,n are positive integers such that; $3m+n=3 lcm(m,n)+gcd(m,n)$

Published on 14 Oct 2020 - 6:28

score 50 · Answer 3 · 2020-10-16 20:28:07

50

Views

Question about gcd (greatest-common-divisor)

Published on 16 Oct 2020 - 20:28

score 462 · Answer 4 · 2020-10-18 05:14:04

462

Views

What is $\gcd(a^2-1, a^3-1)$?

Published on 18 Oct 2020 - 5:14

score 55 · Answer 5 · 2020-10-18 19:16:41

55

Views

An example in $Z[i√6]$ such that the gcd of two non-zero elements is $1$ but the gcd cannot be expressed as linear combination of the two elements

Published on 18 Oct 2020 - 19:16

score 116 · Answer 6 · 2026-03-27 04:23:39

116

Views

Does every pair of non-zero elements of $Z[\sqrt{3}]$ has a gcd?

Published on 27 Mar 2026 - 4:23

score 207 · Answer 7 · 2020-10-20 13:30:04

207

Views

On finding triplets that satisfy a certain GCD and LCM property.

Published on 20 Oct 2020 - 13:30

score 55 · Answer 8 · 2020-10-21 00:10:18

55

Views

Proof Regarding Relative Primality

Published on 21 Oct 2020 - 0:10

score 86 · Answer 9 · 2026-03-28 13:41:31

86

Views

Solutions to $\sum_{i=1}^n a_i x_i = 0$ with $\gcd(a_1,\dots,a_n)=1$

Published on 28 Mar 2026 - 13:41

score 32 · Answer 10 · 2026-04-03 17:51:25

32

Views

Periodic solution of first order ODE

Published on 03 Apr 2026 - 17:51

score 54 · Answer 11 · 2020-10-21 21:01:06

54

Views

If $\gcd(b,c) = 1$, $b$ and $c$ divides $a$, then $bc$ divides $a$

Published on 21 Oct 2020 - 21:01

score 653 · Answer 12 · 2020-10-22 08:46:26

653

Views

For ideals in a PID: sum = gcd, intersection = lcm

Published on 22 Oct 2020 - 8:46

score 334 · Answer 13 · 2026-04-03 20:17:52

334

Views

Find the greatest number that will divide 43, 91 and 183 so as to leave the same remainder in each case.

Published on 03 Apr 2026 - 20:17

score 319 · Answer 14 · 2026-03-29 07:22:24

319

Views

Compute $\gcd(13n+2,5n-1)$ by generalized Euclidean algorithm

Published on 29 Mar 2026 - 7:22

score 70 · Answer 15 · 2020-10-27 09:49:06

70

Views

Prove $\,\gcd(a,b)\mid {\rm lcm}(a,b)\ $

Published on 27 Oct 2020 - 9:49

List Question

Finding all principal ideals of $\mathbb{Z}[\sqrt{-7}]$ containing a certain element.

if m,n are positive integers such that; $3m+n=3 lcm(m,n)+gcd(m,n)$

Question about gcd (greatest-common-divisor)

What is $\gcd(a^2-1, a^3-1)$?

An example in $Z[i√6]$ such that the gcd of two non-zero elements is $1$ but the gcd cannot be expressed as linear combination of the two elements

Does every pair of non-zero elements of $Z[\sqrt{3}]$ has a gcd?

On finding triplets that satisfy a certain GCD and LCM property.

Proof Regarding Relative Primality

Solutions to $\sum_{i=1}^n a_i x_i = 0$ with $\gcd(a_1,\dots,a_n)=1$

Periodic solution of first order ODE

If $\gcd(b,c) = 1$, $b$ and $c$ divides $a$, then $bc$ divides $a$

For ideals in a PID: sum = gcd, intersection = lcm

Find the greatest number that will divide 43, 91 and 183 so as to leave the same remainder in each case.

Compute $\gcd(13n+2,5n-1)$ by generalized Euclidean algorithm

Prove $\,\gcd(a,b)\mid {\rm lcm}(a,b)\ $

Trending Questions

Popular # Hahtags

Popular Questions