Question

Generate the worst case 256-bit input for GCD

score 56 · Answer 1 · 2026-03-29 04:34:14

56

Views

Generate the worst case 256-bit input for GCD

Published on 29 Mar 2026 - 4:34

score 437 · Answer 2 · 2020-06-23 13:20:04

437

Views

How would one use Bézout's theorem to prove that if $d = \gcd(a,b)\ \text{then} \ \gcd(\dfrac{a}{d}, \dfrac{b}{d}) = 1$.

Published on 23 Jun 2020 - 13:20

score 549 · Answer 3 · 2020-06-24 08:42:48

549

Views

If $\operatorname{lcm}(m, m + k) = \operatorname{lcm}(n, n + k)$, then $m = n$

Published on 24 Jun 2020 - 8:42

score 316 · Answer 4 · 2026-03-26 17:51:33

316

Views

Computational complexity of a modified Euclidean algorithm

Published on 26 Mar 2026 - 17:51

score 88 · Answer 5 · 2020-06-27 10:16:11

88

Views

Is the statement "$(m, n)=d$ if and only if there exist integers $r$ and $s$ such that $r m+s n=d$" problematic?

Published on 27 Jun 2020 - 10:16

score 511 · Answer 6 · 2026-03-26 06:01:36

511

Views

If $N = q^k n^2$ is an odd perfect number with special prime $q$, then can $N$ be of the form $q^k \cdot (\sigma(q^k)/2) \cdot {n}$?

Published on 26 Mar 2026 - 6:01

score 297 · Answer 7 · 2020-06-30 03:15:32

297

Views

Is it true that $HCF(HCF(a,b),c)=HCF(a,HCF(b,c))$

Published on 30 Jun 2020 - 3:15

score 2.1k · Answer 8 · 2020-07-01 04:12:51

2.1k

Views

Prove that the set of all positive integers less than $n$ and relatively prime to n form a group under multiplication modulo n

Published on 01 Jul 2020 - 4:12

score 66 · Answer 9 · 2020-07-04 16:00:38

66

Views

Prove $\gcd (2^n- 1 ;2^m-1) = (2^d-1)$

Published on 04 Jul 2020 - 16:00

score 61 · Answer 10 · 2026-02-23 12:08:50

61

Views

Given that $a,b \in \mathbb{Z}$ and are nonzero. Why is it that $\frac{a}{\gcd(a,b)}$ and $\frac{b}{\gcd(a,b)}$ are coprime?

Published on 23 Feb 2026 - 12:08

score 197 · Answer 11 · 2026-03-26 13:02:13

197

Views

Let $a,b \in \mathbb{Z}$ and let $d = gcd(a,b)$. Show that $\{ ka + lb: k,l \in \mathbb{Z}\} = \{md : m \in \mathbb{Z} \}$

Published on 26 Mar 2026 - 13:02

score 82 · Answer 12 · 2020-07-07 05:18:00

82

Views

Proof verification of a number theory problem involving sequences.

Published on 07 Jul 2020 - 5:18

score 304 · Answer 13 · 2026-03-26 13:02:18

304

Views

A question regarding the proof of $\gcd(a^m-1, a^n-1) = a^{\gcd(m,n)}-1$

Published on 26 Mar 2026 - 13:02

score 433 · Answer 14 · 2026-03-25 19:05:20

433

Views

GCD of Ideal: How we get $\gcd(I, J) = I + J $?

Published on 25 Mar 2026 - 19:05

score 170 · Answer 15 · 2020-07-08 20:31:15

170

Views

Find smallest $x$ such that $\gcd(a + x, b + x) = c$.

Published on 08 Jul 2020 - 20:31

List Question

Generate the worst case 256-bit input for GCD

How would one use Bézout's theorem to prove that if $d = \gcd(a,b)\ \text{then} \ \gcd(\dfrac{a}{d}, \dfrac{b}{d}) = 1$.

If $\operatorname{lcm}(m, m + k) = \operatorname{lcm}(n, n + k)$, then $m = n$

Computational complexity of a modified Euclidean algorithm

Is the statement "$(m, n)=d$ if and only if there exist integers $r$ and $s$ such that $r m+s n=d$" problematic?

If $N = q^k n^2$ is an odd perfect number with special prime $q$, then can $N$ be of the form $q^k \cdot (\sigma(q^k)/2) \cdot {n}$?

Is it true that $HCF(HCF(a,b),c)=HCF(a,HCF(b,c))$

Prove that the set of all positive integers less than $n$ and relatively prime to n form a group under multiplication modulo n

Prove $\gcd (2^n- 1 ;2^m-1) = (2^d-1)$

Given that $a,b \in \mathbb{Z}$ and are nonzero. Why is it that $\frac{a}{\gcd(a,b)}$ and $\frac{b}{\gcd(a,b)}$ are coprime?

Let $a,b \in \mathbb{Z}$ and let $d = gcd(a,b)$. Show that $\{ ka + lb: k,l \in \mathbb{Z}\} = \{md : m \in \mathbb{Z} \}$

Proof verification of a number theory problem involving sequences.

A question regarding the proof of $\gcd(a^m-1, a^n-1) = a^{\gcd(m,n)}-1$

GCD of Ideal: How we get $\gcd(I, J) = I + J $?

Find smallest $x$ such that $\gcd(a + x, b + x) = c$.

Trending Questions

Popular # Hahtags

Popular Questions