Question

$m-1 \equiv n \pmod m$ - fast computation $m$ for given $n$

score 35 · Answer 1 · 2026-03-25 17:45:21

35

Views

$m-1 \equiv n \pmod m$ - fast computation $m$ for given $n$

Published on 25 Mar 2026 - 17:45

score 154 · Answer 2 · 2026-04-09 03:41:09

154

Views

Does the existence of infinite number of Leinster groups indicate the existence of infinite number of perfect numbers?

Published on 09 Apr 2026 - 3:41

score 74 · Answer 3 · 2026-04-12 15:25:25

74

Views

Greatest common divisor for expression given.

Published on 12 Apr 2026 - 15:25

score 96 · Answer 4 · 2026-04-10 13:43:51

96

Views

Solve the equation in $\mathbb{Z}$

Published on 10 Apr 2026 - 13:43

score 29 · Answer 5 · 2026-04-12 16:40:16

29

Views

Please help in finding if it is a Conditional or bi-conditional statement

Published on 12 Apr 2026 - 16:40

score 267 · Answer 6 · 2026-03-25 01:21:53

267

Views

Bertrand's Theorem: prime-power decomposition proof

Published on 25 Mar 2026 - 1:21

score 1.7k · Answer 7 · 2026-04-11 23:53:10

1.7k

Views

Possible remainders of a perfect square when divided by $3,5,6$.

Published on 11 Apr 2026 - 23:53

score 280 · Answer 8 · 2026-04-12 14:12:35

280

Views

Absolute values of sums of subsets of nth roots of 1, equalities without obvious symmetry.

Published on 12 Apr 2026 - 14:12

score 51 · Answer 9 · 2018-02-24 19:19:24

51

Views

Inductive relation for the Harmonic series

Published on 24 Feb 2018 - 19:19

score 121 · Answer 10 · 2026-03-25 04:38:51

121

Views

This formula gives $8^{-1}$ (mod $n$). Is there a deeper pattern lurking here?

Published on 25 Mar 2026 - 4:38

score 109 · Answer 11 · 2018-02-24 21:26:51

109

Views

b ⊙ x = c and gcd(b,n) = d. Show that d divides c.

Published on 24 Feb 2018 - 21:26

score 65 · Answer 12 · 2026-04-12 14:05:48

65

Views

Divisors of $10^{2^{k}}+1$ proof

Published on 12 Apr 2026 - 14:05

score 58 · Answer 13 · 2026-04-12 14:01:05

58

Views

Determine if it is multiple I'm solving an exercise that says, of 2 numbers

Published on 12 Apr 2026 - 14:01

score 36 · Answer 14 · 2026-03-25 17:34:59

36

Views

On odd integers mod $2q$

Published on 25 Mar 2026 - 17:34

score 162 · Answer 15 · 2018-02-25 01:48:26

162

Views

Claim: if $a, m, n$ are positive integers with $a>1$, then $a^m-1 \mid a^n-1$ if and only if $m \mid n$.

Published on 25 Feb 2018 - 1:48

List Question

$m-1 \equiv n \pmod m$ - fast computation $m$ for given $n$

Does the existence of infinite number of Leinster groups indicate the existence of infinite number of perfect numbers?

Greatest common divisor for expression given.

Solve the equation in $\mathbb{Z}$

Please help in finding if it is a Conditional or bi-conditional statement

Bertrand's Theorem: prime-power decomposition proof

Possible remainders of a perfect square when divided by $3,5,6$.

Absolute values of sums of subsets of nth roots of 1, equalities without obvious symmetry.

Inductive relation for the Harmonic series

This formula gives $8^{-1}$ (mod $n$). Is there a deeper pattern lurking here?

b ⊙ x = c and gcd(b,n) = d. Show that d divides c.

Divisors of $10^{2^{k}}+1$ proof

Determine if it is multiple I'm solving an exercise that says, of 2 numbers

On odd integers mod $2q$

Claim: if $a, m, n$ are positive integers with $a>1$, then $a^m-1 \mid a^n-1$ if and only if $m \mid n$.

Trending Questions

Popular # Hahtags

Popular Questions