List questions from prime-numbers

Published on 28 Mar 2026 - 20:53

24

Views

How one can get an estimate or a range for the integer $n$

Published on 03 Dec 2018 - 15:10

364

Views

A prime $p$ of the form $4k+1$ implies that $k^k \equiv 1 \mod p$?

Published on 30 Mar 2026 - 17:15

74

Views

How to prove the existence of a prime number with elementary method?

Published on 04 Dec 2018 - 3:56

424

Views

What is the best algorithm for finding Goldbug Numbers?

Published on 25 Mar 2026 - 6:09

143

Views

Upper bound for a ratio of two least common multiples

Published on 23 Feb 2026 - 6:56

43

Views

Can I find the next prime with sufficient small residue efficiently?

Published on 01 Apr 2026 - 8:57

38

Views

Given an odd integer, $a$ does $\gcd(a,p-1)=1$ has infinitely many prime $p$ solutions?

Published on 26 Mar 2026 - 8:15

86

Views

Existence of divisor of multiple of primes congruent to 1 mod 4

Published on 27 Mar 2026 - 3:44

299

Views

Where is the mistake: On the sum of two prime numbers.

Published on 26 Mar 2026 - 3:12

179

Views

For all $n>1$ there are positive $a+b=n$ such that $a+ab+b\in\mathbb P$

Published on 25 Mar 2026 - 18:04

90

Views

In a perfect number $2^{p−1} \times (2^p − 1)$, the ratio of $p$ to the digits in its perfect number approaches $\log(10) / \log(4)$?

Published on 25 Mar 2026 - 18:50

326

Views

The general proposition of Fermat

Published on 25 Mar 2026 - 23:10

99

Views

Problem parallel to Goldbach Conjecture

Published on 27 Mar 2026 - 8:46

3.1k

Views

RSA: Show how to factor $n=pq$, the product of two primes, given $(p-1)(q-1)$

Published on 25 Mar 2026 - 22:27

List Question

Polynomial divisor in $\mathbb{Z}_p[x]$?

How one can get an estimate or a range for the integer $n$

A prime $p$ of the form $4k+1$ implies that $k^k \equiv 1 \mod p$?

How to prove the existence of a prime number with elementary method?

What is the best algorithm for finding Goldbug Numbers?

Upper bound for a ratio of two least common multiples

Can I find the next prime with sufficient small residue efficiently?

Given an odd integer, $a$ does $\gcd(a,p-1)=1$ has infinitely many prime $p$ solutions?

Existence of divisor of multiple of primes congruent to 1 mod 4

Where is the mistake: On the sum of two prime numbers.

For all $n>1$ there are positive $a+b=n$ such that $a+ab+b\in\mathbb P$

In a perfect number $2^{p−1} \times (2^p − 1)$, the ratio of $p$ to the digits in its perfect number approaches $\log(10) / \log(4)$?

The general proposition of Fermat

Problem parallel to Goldbach Conjecture

RSA: Show how to factor $n=pq$, the product of two primes, given $(p-1)(q-1)$

Trending Questions

Popular # Hahtags

Popular Questions