Question

Choose a k-subset such that its elements 's gcd is maximal

score 1.8k · Answer 1 · 2026-03-25 06:48:09

1.8k

Views

Choose a k-subset such that its elements 's gcd is maximal

Published on 25 Mar 2026 - 6:48

score 123 · Answer 2 · 2014-08-09 23:13:31

123

Views

If $n=3^{2^k}-2^{2^k}$, then $n\mid 3^{n-1}-2^{n-1}$

Published on 09 Aug 2014 - 23:13

score 255 · Answer 3 · 2014-08-10 11:14:51

255

Views

Is there a simple algorithm I can use for this?

Published on 10 Aug 2014 - 11:14

score 155 · Answer 4 · 2014-08-11 15:40:47

155

Views

Cofactor reflection maps greatest proper divisor to least (prime) proper divisor

Published on 11 Aug 2014 - 15:40

score 1.1k · Answer 5 · 2014-08-12 05:12:54

1.1k

Views

If $n$ is any positive integer whose last digit is $5$, then $5$ divides $n$

Published on 12 Aug 2014 - 5:12

score 58 · Answer 6 · 2014-08-13 06:04:16

58

Views

How prove $n|2^{\frac{n(n-1)}{2}}\cdot (2-1)(2^2-1)(2^3-1)\cdots (2^{n-1}-1)$

Published on 13 Aug 2014 - 6:04

score 481 · Answer 7 · 2026-03-30 08:59:35

481

Views

Prove that the Diophantine equation $ax+by=c$ has no integer solutions if $\gcd(a,b)$ does not divide $c$

Published on 30 Mar 2026 - 8:59

score 960 · Answer 8 · 2014-08-13 21:01:07

960

Views

prove by contradiction that $ax+by=c$ has no integer solutions if $c$ does not divide into $\gcd (a, b)$

Published on 13 Aug 2014 - 21:01

score 3.4k · Answer 9 · 2026-03-26 09:19:39

3.4k

Views

Fastest way to find if a given number is prime

Published on 26 Mar 2026 - 9:19

score 98 · Answer 10 · 2014-08-14 20:34:13

98

Views

Show that each integer of the form $a^2+b^2$ has all the factors of this form, where $(a, b)$ are distinct integers and relatively prime

Published on 14 Aug 2014 - 20:34

score 154 · Answer 11 · 2014-08-15 21:50:25

154

Views

For what integers $n$ is this divisibility statement true?

Published on 15 Aug 2014 - 21:50

score 943 · Answer 12 · 2014-08-17 15:21:48

943

Views

$\operatorname{gcd}(ab,a+b)=1$ if $a$ and $b$ are relatively prime

Published on 17 Aug 2014 - 15:21

score 8.5k · Answer 13 · 2026-03-30 02:05:46

8.5k

Views

How to find a modular multiplicative inverse when GCD is not 1

Published on 30 Mar 2026 - 2:05

score 130 · Answer 14 · 2014-08-18 13:21:11

130

Views

When does $2^n+n \mid 8^n+n$?

Published on 18 Aug 2014 - 13:21

score 1.2k · Answer 15 · 2014-08-19 03:43:52

1.2k

Views

Prove that $133$ divides $11^{n+1} + 12^{2n−1}$ for all $n > 1$?

Published on 19 Aug 2014 - 3:43

List Question

Choose a k-subset such that its elements 's gcd is maximal

If $n=3^{2^k}-2^{2^k}$, then $n\mid 3^{n-1}-2^{n-1}$

Is there a simple algorithm I can use for this?

Cofactor reflection maps greatest proper divisor to least (prime) proper divisor

If $n$ is any positive integer whose last digit is $5$, then $5$ divides $n$

How prove $n|2^{\frac{n(n-1)}{2}}\cdot (2-1)(2^2-1)(2^3-1)\cdots (2^{n-1}-1)$

Prove that the Diophantine equation $ax+by=c$ has no integer solutions if $\gcd(a,b)$ does not divide $c$

prove by contradiction that $ax+by=c$ has no integer solutions if $c$ does not divide into $\gcd (a, b)$

Fastest way to find if a given number is prime

Show that each integer of the form $a^2+b^2$ has all the factors of this form, where $(a, b)$ are distinct integers and relatively prime

For what integers $n$ is this divisibility statement true?

$\operatorname{gcd}(ab,a+b)=1$ if $a$ and $b$ are relatively prime

How to find a modular multiplicative inverse when GCD is not 1

When does $2^n+n \mid 8^n+n$?

Prove that $133$ divides $11^{n+1} + 12^{2n−1}$ for all $n > 1$?

Trending Questions

Popular # Hahtags

Popular Questions