List questions from divisibility

Published on 29 Mar 2026 - 17:31

376

Views

How to get a number that is divisible by $n$ - without obviously seeing it?

Published on 17 Apr 2014 - 19:11

52

Views

Feedback on Euclidean Algorithm: $gcd(277, 301)$

Published on 27 Mar 2026 - 7:57

7.1k

Views

Prove for all $n \in N$, $\gcd(2n+1,9n+4)=1$

Published on 27 Mar 2026 - 21:18

1.9k

Views

Euclidean algorithm in the ring of polynomials over a field

Published on 18 Apr 2014 - 15:21

732

Views

If $\gcd(a, b) = 1$ then prove that $\gcd(a+b, a^2-ab+b^2) = 1$ or $3$?

Published on 27 Mar 2026 - 21:19

106

Views

Given n , what is the sum of all gcd integers upto n with n?

Published on 26 Mar 2026 - 21:27

437

Views

question about division algorithm described in handbook of applied crypto

Published on 20 Apr 2014 - 20:22

139

Views

Let n be an integer greater than 3. Find a formula for gcd(n, n + 3)

Published on 21 Apr 2014 - 9:18

209

Views

Why does Euclid's algorithm taken one step past the GCD seem to yield the LCM?

Published on 21 Apr 2014 - 13:01

327

Views

proof with divisibility

Published on 21 Apr 2014 - 22:17

1.1k

Views

gcd and linear combinations proof

Published on 21 Apr 2014 - 22:42

580

Views

Prove:$a|bc$ and $\gcd(a,b)=1$ implies $a|c$

Published on 27 Mar 2026 - 21:22

4.5k

Views

Prove $\gcd(ka,kb) = k*\gcd(a,b)$

Published on 22 Apr 2014 - 3:31

316

Views

$Q\mid P\ {\rm in}\ \Bbb R[X]\,$ if $\,Q\mid P\ {\rm in}\ \Bbb C[X]\ $ [divisibility stable under polynomial coef. ring extension]

Published on 25 Mar 2026 - 21:49

List Question

Solve a system of diophantine equations

How to get a number that is divisible by $n$ - without obviously seeing it?

Feedback on Euclidean Algorithm: $gcd(277, 301)$

Prove for all $n \in N$, $\gcd(2n+1,9n+4)=1$

Euclidean algorithm in the ring of polynomials over a field

If $\gcd(a, b) = 1$ then prove that $\gcd(a+b, a^2-ab+b^2) = 1$ or $3$?

Given n , what is the sum of all gcd integers upto n with n?

question about division algorithm described in handbook of applied crypto

Let n be an integer greater than 3. Find a formula for gcd(n, n + 3)

Why does Euclid's algorithm taken one step past the GCD seem to yield the LCM?

proof with divisibility

gcd and linear combinations proof

Prove:$a|bc$ and $\gcd(a,b)=1$ implies $a|c$

Prove $\gcd(ka,kb) = k*\gcd(a,b)$

$Q\mid P\ {\rm in}\ \Bbb R[X]\,$ if $\,Q\mid P\ {\rm in}\ \Bbb C[X]\ $ [divisibility stable under polynomial coef. ring extension]

Trending Questions

Popular # Hahtags

Popular Questions