Question

How large will the smallest counter-example probably be?

score 370 · Answer 1 · 2026-05-10 12:36:09

370

Views

How large will the smallest counter-example probably be?

Published on 10 May 2026 - 12:36

score 42 · Answer 2 · 2026-05-10 17:52:51

42

Views

Number of solutions for quadratic polynomials in $\mathbb{F}_p$

Published on 10 May 2026 - 17:52

score 302 · Answer 3 · 2026-05-04 22:50:21

302

Views

Conclude there are infinitely primes with given residue class

Published on 04 May 2026 - 22:50

score 117 · Answer 4 · 2026-05-10 15:02:32

117

Views

If 13 does not divide m, then prove that $m^4+8$ is not a cube of an integer

Published on 10 May 2026 - 15:02

score 73 · Answer 5 · 2026-05-10 16:05:59

73

Views

Order of $\mathbb F_q^n$?

Published on 10 May 2026 - 16:05

score 63 · Answer 6 · 2026-05-10 19:40:36

63

Views

On primes of the form $2\pi(n)p_n+1$, for some $n\geq 1$ being $\pi(x)$ the prime-counting function and $p_k$ the $k$th prime number

Published on 10 May 2026 - 19:40

score 106 · Answer 7 · 2026-05-10 11:42:26

106

Views

For prime numbers $p_n$ it holds $m\equiv p_n^2\pmod {p_{n+1}}\implies$ $m$ is a square

Published on 10 May 2026 - 11:42

score 441 · Answer 8 · 2026-05-10 12:02:37

441

Views

Solving $n/\ln (n) = 990,000$

Published on 10 May 2026 - 12:02

score 73 · Answer 9 · 2026-05-10 11:43:38

73

Views

All even squares are congruent with a prime square $p_n^2\pmod {p_{n+1}}$

Published on 10 May 2026 - 11:43

score 226 · Answer 10 · 2026-04-20 23:21:25

226

Views

I have a proof concerning prime numbers. Should I publish my result?

Published on 20 Apr 2026 - 23:21

score 515 · Answer 11 · 2026-05-02 18:32:35

515

Views

What is $\underbrace{2018^{2018^{2018^{\mathstrut^{.^{.^{.^{2018}}}}}}}}_{p\,\text{times}}\pmod p$ where $p$ is an odd prime?

Published on 02 May 2026 - 18:32

score 648 · Answer 12 · 2026-04-16 10:34:35

648

Views

Pair of prime numbers to have the same product

Published on 16 Apr 2026 - 10:34

score 428 · Answer 13 · 2026-04-29 12:44:28

428

Views

On the conjecture that, for every $n$, $\lfloor e^{\frac{p_{n^2}\#}{p_{n^2 + 1}}}\rfloor $ is a square number.

Published on 29 Apr 2026 - 12:44

score 102 · Answer 14 · 2026-04-29 12:52:25

102

Views

A conjecture concerning primes and perhaps prime gaps

Published on 29 Apr 2026 - 12:52

score 1.9k · Answer 15 · 2026-05-10 21:06:23

1.9k

Views

Efficient algorithms for Primitive roots where time-complexity is $\leq O(\sqrt{n})$

Published on 10 May 2026 - 21:06

List Question

How large will the smallest counter-example probably be?

Number of solutions for quadratic polynomials in $\mathbb{F}_p$

Conclude there are infinitely primes with given residue class

If 13 does not divide m, then prove that $m^4+8$ is not a cube of an integer

Order of $\mathbb F_q^n$?

On primes of the form $2\pi(n)p_n+1$, for some $n\geq 1$ being $\pi(x)$ the prime-counting function and $p_k$ the $k$th prime number

For prime numbers $p_n$ it holds $m\equiv p_n^2\pmod {p_{n+1}}\implies$ $m$ is a square

Solving $n/\ln (n) = 990,000$

All even squares are congruent with a prime square $p_n^2\pmod {p_{n+1}}$

I have a proof concerning prime numbers. Should I publish my result?

What is $\underbrace{2018^{2018^{2018^{\mathstrut^{.^{.^{.^{2018}}}}}}}}_{p\,\text{times}}\pmod p$ where $p$ is an odd prime?

Pair of prime numbers to have the same product

On the conjecture that, for every $n$, $\lfloor e^{\frac{p_{n^2}\#}{p_{n^2 + 1}}}\rfloor $ is a square number.

A conjecture concerning primes and perhaps prime gaps

Efficient algorithms for Primitive roots where time-complexity is $\leq O(\sqrt{n})$

Trending Questions

Popular # Hahtags

Popular Questions