Question

sub-resultant GCD algorithm for polynomials over a field

score 273 · Answer 1 · 2019-07-17 09:05:03

273

Views

sub-resultant GCD algorithm for polynomials over a field

Published on 17 Jul 2019 - 9:05

score 44 · Answer 2 · 2026-02-23 04:57:26

44

Views

Suppose two integers $a,N$, where N is prime, is there a difference between requiring $gcd(a,N)=1$ and $N \not\mid \!\!\;a $?

Published on 23 Feb 2026 - 4:57

score 53 · Answer 3 · 2026-03-22 06:05:14

53

Views

Is brute force trial the only approach to find smallest k such that (840k + 3) is a multiple of 9?

Published on 22 Mar 2026 - 6:05

score 104 · Answer 4 · 2019-07-26 06:06:36

104

Views

Let $R$ be a UFD and $a,b,c \in R$ be nonzero. If $c \mid ab$ and $\gcd(a, c) = 1$, then $c \mid b$.

Published on 26 Jul 2019 - 6:06

score 51 · Answer 5 · 2019-07-26 15:56:43

51

Views

Divisibility Question, a bit difficult(for me).

Published on 26 Jul 2019 - 15:56

score 1.8k · Answer 6 · 2026-03-22 02:04:16

1.8k

Views

Find all positive integers $a$ and $b$ satisfying $\gcd (a,b)=10$ and $\operatorname{lcm} (a,b)=100$ simultaneously.

Published on 22 Mar 2026 - 2:04

score 131 · Answer 7 · 2019-07-28 12:17:56

131

Views

Maximum Pairwise GCD from an even subsequence of an array

Published on 28 Jul 2019 - 12:17

score 187 · Answer 8 · 2019-07-28 21:28:53

187

Views

$\gcd(p,q) = 1$, but $\gcd(p+k_1N,q)>1$

Published on 28 Jul 2019 - 21:28

score 98 · Answer 9 · 2019-08-01 08:44:57

98

Views

Problem in proof concerning division algorithm.

Published on 01 Aug 2019 - 8:44

score 44 · Answer 10 · 2019-08-05 14:37:59

44

Views

If $GCD(a,b)=1$, then $GCD((a+b)^m , (a-b)^m )$ is at most $2^m$?

Published on 05 Aug 2019 - 14:37

score 61 · Answer 11 · 2026-03-25 17:18:26

61

Views

Graphing a function.. the definition contains min, max, gcd.

Published on 25 Mar 2026 - 17:18

score 489 · Answer 12 · 2026-03-25 21:44:52

489

Views

euclidean algorithm and linear combination for gcd

Published on 25 Mar 2026 - 21:44

score 28 · Answer 13 · 2026-03-25 16:02:16

28

Views

Does $\gcd(r, \sigma(r)) = 2r - \sigma(r)$ always hold when $r$ is deficient-perfect?

Published on 25 Mar 2026 - 16:02

score 376 · Answer 14 · 2026-03-22 06:50:03

376

Views

GCD and LCM properties proof

Published on 22 Mar 2026 - 6:50

score 192 · Answer 15 · 2019-08-17 09:20:09

192

Views

Prove there exists $2011$ consecutive amazing integers

Published on 17 Aug 2019 - 9:20

List Question

sub-resultant GCD algorithm for polynomials over a field

Suppose two integers $a,N$, where N is prime, is there a difference between requiring $gcd(a,N)=1$ and $N \not\mid \!\!\;a $?

Is brute force trial the only approach to find smallest k such that (840k + 3) is a multiple of 9?

Let $R$ be a UFD and $a,b,c \in R$ be nonzero. If $c \mid ab$ and $\gcd(a, c) = 1$, then $c \mid b$.

Divisibility Question, a bit difficult(for me).

Find all positive integers $a$ and $b$ satisfying $\gcd (a,b)=10$ and $\operatorname{lcm} (a,b)=100$ simultaneously.

Maximum Pairwise GCD from an even subsequence of an array

$\gcd(p,q) = 1$, but $\gcd(p+k_1N,q)>1$

Problem in proof concerning division algorithm.

If $GCD(a,b)=1$, then $GCD((a+b)^m , (a-b)^m )$ is at most $2^m$?

Graphing a function.. the definition contains min, max, gcd.

euclidean algorithm and linear combination for gcd

Does $\gcd(r, \sigma(r)) = 2r - \sigma(r)$ always hold when $r$ is deficient-perfect?

GCD and LCM properties proof

Prove there exists $2011$ consecutive amazing integers

Trending Questions

Popular # Hahtags

Popular Questions