Question

Let $g\in A$ be a regular element and $f\in A$, when do we have the preimage of $(x-f/g)\subset A_g[x]$ in $A[x]$ is $(gx-f)$?

score 82 · Answer 1 · 2026-04-01 18:11:45

82

Views

Let $g\in A$ be a regular element and $f\in A$, when do we have the preimage of $(x-f/g)\subset A_g[x]$ in $A[x]$ is $(gx-f)$?

Published on 01 Apr 2026 - 18:11

score 44 · Answer 2 · 2022-12-02 12:20:47

44

Views

Which sequence is $a_n=\gcd(50+n^2,50+(n+1)^2)$

Published on 02 Dec 2022 - 12:20

score 63 · Answer 3 · 2022-12-03 02:39:03

63

Views

prove there are $b > a+1$ so that for $a+1\leq k<b, \gcd(a,k) > 1$ or $\gcd(b,k) > 1$

Published on 03 Dec 2022 - 2:39

score 44 · Answer 4 · 2022-12-07 02:24:16

44

Views

Find all integer solutions for k1 and k2, where 3/4 = k1/k2, and both values must be divisible by 64?

Published on 07 Dec 2022 - 2:24

score 63 · Answer 5 · 2022-12-09 20:46:38

63

Views

Number Theory prove gcd[(gcd(x,y),y)] = gcd(x,y)

Published on 09 Dec 2022 - 20:46

score 28 · Answer 6 · 2026-04-11 07:41:50

28

Views

Can you solve a diophantine equation considering negative remainders in the GCD step?

Published on 11 Apr 2026 - 7:41

score 167 · Answer 7 · 2026-04-01 09:48:01

167

Views

Integer GCD computation via Chinese Remainder Theorem

Published on 01 Apr 2026 - 9:48

score 70 · Answer 8 · 2026-04-05 21:30:28

70

Views

Suppose a, b are integers and LCM(a, b) = GCD(a, b)^2. What can be said about the prime decompositions of a and b?

Published on 05 Apr 2026 - 21:30

score 84 · Answer 9 · 2022-12-20 18:46:59

84

Views

Calculating a Least Common Multiple with shifts

Published on 20 Dec 2022 - 18:46

score 163 · Answer 10 · 2022-12-21 13:21:58

163

Views

Greatest common divisor of some binomial coefficients

Published on 21 Dec 2022 - 13:21

score 120 · Answer 11 · 2022-12-26 06:02:55

Does it follow from $\gcd(a,c) \mid \gcd(b,c)$ that $a \mid b$? If not, under what conditions on $a,b,c$ does this implication hold?

score 98 · Answer 12 · 2026-03-28 00:31:02

98

Views

On a consequence of $G \mid I \iff \gcd(G, I) = G$ (Re: Odd Perfect Numbers and GCDs)

Published on 28 Mar 2026 - 0:31

score 21 · Answer 13 · 2026-04-11 00:07:52

21

Views

Proof on LCM; why remainder not strictly less than the divisor?

Published on 11 Apr 2026 - 0:07

score 68 · Answer 14 · 2026-03-28 00:30:59

68

Views

On the prime factorization of $n$ and the quantity $J = \frac{n}{\gcd(n,\sigma(q^k)/2)}$, where $q^k n^2$ is an odd perfect number

Published on 28 Mar 2026 - 0:30

score 506 · Answer 15 · 2023-01-03 16:51:11

506

Views

Is there a combination of $a,b,c\in\mathbb{N}$ such that $\forall n\in\mathbb{N}\; \gcd(n^a+b,(n+c)^a+b)=1$?

Published on 03 Jan 2023 - 16:51

List Question

Let $g\in A$ be a regular element and $f\in A$, when do we have the preimage of $(x-f/g)\subset A_g[x]$ in $A[x]$ is $(gx-f)$?

Which sequence is $a_n=\gcd(50+n^2,50+(n+1)^2)$

prove there are $b > a+1$ so that for $a+1\leq k<b, \gcd(a,k) > 1$ or $\gcd(b,k) > 1$

Find all integer solutions for k1 and k2, where 3/4 = k1/k2, and both values must be divisible by 64?

Number Theory prove gcd[(gcd(x,y),y)] = gcd(x,y)

Can you solve a diophantine equation considering negative remainders in the GCD step?

Integer GCD computation via Chinese Remainder Theorem

Suppose a, b are integers and LCM(a, b) = GCD(a, b)^2. What can be said about the prime decompositions of a and b?

Calculating a Least Common Multiple with shifts

Greatest common divisor of some binomial coefficients

Does it follow from $\gcd(a,c) \mid \gcd(b,c)$ that $a \mid b$? If not, under what conditions on $a,b,c$ does this implication hold?

On a consequence of $G \mid I \iff \gcd(G, I) = G$ (Re: Odd Perfect Numbers and GCDs)

Proof on LCM; why remainder not strictly less than the divisor?

On the prime factorization of $n$ and the quantity $J = \frac{n}{\gcd(n,\sigma(q^k)/2)}$, where $q^k n^2$ is an odd perfect number

Is there a combination of $a,b,c\in\mathbb{N}$ such that $\forall n\in\mathbb{N}\; \gcd(n^a+b,(n+c)^a+b)=1$?

Trending Questions

Popular # Hahtags

Popular Questions