Question

Compute gcd$ \ (7^{n} + 4, \ 7^{n})$

score 385 · Answer 1 · 2026-03-28 22:08:30

385

Views

Compute gcd$ \ (7^{n} + 4, \ 7^{n})$

Published on 28 Mar 2026 - 22:08

score 296 · Answer 2 · 2026-03-28 22:08:29

296

Views

Compute gcd$(24, 54 + 24^{7})$

Published on 28 Mar 2026 - 22:08

score 475 · Answer 3 · 2026-02-24 08:34:18

475

Views

Prove $\text{lcm}(a,b,c) = \frac{a \cdot b \cdot c \cdot \gcd(a,b,c)}{\gcd(a,b)\gcd(b,c)\gcd(a,c)}$

Published on 24 Feb 2026 - 8:34

score 160 · Answer 4 · 2017-08-08 13:44:10

160

Views

For coprime $p$ and $q$, what is the largest number $m$ that can not be written as $ap+bq$ for $a,b \geq 0$.

Published on 08 Aug 2017 - 13:44

score 410 · Answer 5 · 2017-08-09 07:13:05

410

Views

Determining number of integer solutions of Diophantine equation

Published on 09 Aug 2017 - 7:13

score 262 · Answer 6 · 2026-04-03 02:42:18

262

Views

Is this way of factorizing an integer faster than trial division?

Published on 03 Apr 2026 - 2:42

score 2.3k · Answer 7 · 2017-08-13 19:24:19

2.3k

Views

Prove that if $\gcd(a,b) = 1$, then $\gcd(ab,a^2+b^2)=1.$

Published on 13 Aug 2017 - 19:24

score 26 · Answer 8 · 2017-08-16 00:16:06

26

Views

Let $ \ a,b \in \mathbb{N}$. $ \ [(a<b)$ and $ \ (gcd(a,b) \neq a)] \implies [gcd(a,b) < a]$

Published on 16 Aug 2017 - 0:16

score 120 · Answer 9 · 2017-08-16 18:27:32

120

Views

Solving set of GCD Equations

Published on 16 Aug 2017 - 18:27

score 129 · Answer 10 · 2026-02-24 08:29:35

129

Views

A relation between gcd and lcm

Published on 24 Feb 2026 - 8:29

score 37 · Answer 11 · 2017-08-17 18:09:24

37

Views

solving-set-of-gcd-equations (continued discussion)

Published on 17 Aug 2017 - 18:09

score 134 · Answer 12 · 2017-08-17 21:02:54

134

Views

Computing greatest common divisor and determining whether Diophantine equation has solutions

Published on 17 Aug 2017 - 21:02

score 208 · Answer 13 · 2017-08-20 13:35:42

208

Views

Diophantine Equation extended

Published on 20 Aug 2017 - 13:35

score 2k · Answer 14 · 2017-08-21 11:29:49

2k

Views

Show that for any natural number n between $n^2$ and$(n+1)^2$ there exist 3 distinct natural numbers a, b, c, so that $a^2+b^2$ is divisible by c

Published on 21 Aug 2017 - 11:29

score 1.4k · Answer 15 · 2017-08-22 12:51:32

1.4k

Views

Find all odd positive integers greater than 1 such that for any relatively prime divisors a and b of n, a+b-1 is also a divisor of n

Published on 22 Aug 2017 - 12:51

List Question

Compute gcd$ \ (7^{n} + 4, \ 7^{n})$

Compute gcd$(24, 54 + 24^{7})$

Prove $\text{lcm}(a,b,c) = \frac{a \cdot b \cdot c \cdot \gcd(a,b,c)}{\gcd(a,b)\gcd(b,c)\gcd(a,c)}$

For coprime $p$ and $q$, what is the largest number $m$ that can not be written as $ap+bq$ for $a,b \geq 0$.

Determining number of integer solutions of Diophantine equation

Is this way of factorizing an integer faster than trial division?

Prove that if $\gcd(a,b) = 1$, then $\gcd(ab,a^2+b^2)=1.$

Let $ \ a,b \in \mathbb{N}$. $ \ [(a<b)$ and $ \ (gcd(a,b) \neq a)] \implies [gcd(a,b) < a]$

Solving set of GCD Equations

A relation between gcd and lcm

solving-set-of-gcd-equations (continued discussion)

Computing greatest common divisor and determining whether Diophantine equation has solutions

Diophantine Equation extended

Show that for any natural number n between $n^2$ and$(n+1)^2$ there exist 3 distinct natural numbers a, b, c, so that $a^2+b^2$ is divisible by c

Find all odd positive integers greater than 1 such that for any relatively prime divisors a and b of n, a+b-1 is also a divisor of n

Trending Questions

Popular # Hahtags

Popular Questions