Question

How large will the smallest counter-example probably be?

score 364 · Answer 1 · 2026-03-25 04:16:14

364

Views

How large will the smallest counter-example probably be?

Published on 25 Mar 2026 - 4:16

score 37 · Answer 2 · 2026-03-22 19:41:02

37

Views

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

Published on 22 Mar 2026 - 19:41

score 295 · Answer 3 · 2026-03-20 16:45:52

295

Views

Conclude there are infinitely primes with given residue class

Published on 20 Mar 2026 - 16:45

score 115 · Answer 4 · 2026-03-24 23:46:21

115

Views

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

Published on 24 Mar 2026 - 23:46

score 68 · Answer 5 · 2026-03-25 09:26:10

68

Views

Order of $\mathbb F_q^n$?

Published on 25 Mar 2026 - 9:26

score 60 · Answer 6 · 2026-03-25 07:45:38

60

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 25 Mar 2026 - 7:45

score 100 · Answer 7 · 2026-03-25 04:14:23

100

Views

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

Published on 25 Mar 2026 - 4:14

score 432 · Answer 8 · 2026-03-22 15:30:38

432

Views

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

Published on 22 Mar 2026 - 15:30

score 66 · Answer 9 · 2026-03-25 01:17:32

66

Views

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

Published on 25 Mar 2026 - 1:17

score 218 · Answer 10 · 2026-03-23 00:21:01

218

Views

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

Published on 23 Mar 2026 - 0:21

score 505 · Answer 11 · 2026-03-22 05:02:07

505

Views

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

Published on 22 Mar 2026 - 5:02

score 646 · Answer 12 · 2018-02-10 15:29:58

646

Views

Pair of prime numbers to have the same product

Published on 10 Feb 2018 - 15:29

score 421 · Answer 13 · 2026-03-17 06:01:52

421

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 17 Mar 2026 - 6:01

score 97 · Answer 14 · 2026-03-23 11:46:42

97

Views

A conjecture concerning primes and perhaps prime gaps

Published on 23 Mar 2026 - 11:46

score 1.9k · Answer 15 · 2026-03-22 23:18:56

1.9k

Views

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

Published on 22 Mar 2026 - 23:18

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