Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with prime-numbers
Search options questions only
not deleted
user 28104
Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.
9
votes
2
answers
527
views
Sign of permutation induced by modular exponentiation
Given a prime number $p$ and a primitive root $a$ modulo $p$, let
$\sigma_{a,p}$ denote the permutation of the set $\{1, \dots, p-1\}$ which
maps $b$ to $a^b$ modulo $p$.
Question: Let $p$ be fixed. …
- 19.6k
18
votes
1
answer
649
views
How hard is it to find a prime number with given primitive roots?
Assume that we randomly choose a 100-digit prime number $p$,
record which of the first 1000 prime numbers are primitive roots
modulo $p$, and then forget about $p$. —
How easy or how difficult is it t …
- 19.6k
1
vote
0
answers
71
views
Is there an upper bound on the number of partitions of a finite set of primes into 3 sets th...
Is there an upper bound on the number of partitions of a finite set $S$
of prime numbers into 3 sets $A$, $B$ and $C$ for which the following holds?:
$$
\prod_{p \in A} p \ + \ \prod_{p \in B} p \ = …
- 19.6k
18
votes
2
answers
2k
views
Existence of polynomials of degree $\geq 2$ which represent infinitely many prime numbers
To my knowledge it is open so far whether the polynomial $x^2+1 \in \mathbb{Z}[x]$ takes
infinitely many prime numbers as values. Is it known so far whether there is at all any
polynomial $P \in \math …
- 19.6k
43
votes
1
answer
1k
views
Can't one walk to infinity on the prime numbers with finitely many distinct affine steps?
Let $(a_1,b_1), \dots, (a_k,b_k)$ be finitely many pairs of positive
integers, and let $\Gamma$ be the graph whose vertices are the prime
numbers and in which two vertices $p$ and $q$ are connected by …
- 19.6k
3
votes
0
answers
145
views
The bias of consecutive prime numbers towards being incongruent modulo 3
Given a positive integer $n$, let $f_1(n)$ denote the number of pairs of
consecutive prime numbers $\leq n$ which are incongruent modulo 3, and let
$f_2(n)$ denote the number of pairs of consecutive p …
- 19.6k
6
votes
1
answer
378
views
Uniformity of the distribution of the prime numbers on the prime residue classes (mod $m$)
Given positive integers $m$, $r$ and $n$, let $\pi(m,r,n)$ denote the number
of prime numbers $p \leq n$ in the residue class $r$ (mod $m$).
Further let $1 = r_1 < r_2 < \dots < r_{\varphi(m)} = m-1$ …
- 19.6k
19
votes
1
answer
2k
views
How many primes can there be in a short interval?
Given $n \in \mathbb{N}$, let $\pi(n)$ denote the number of prime numbers $\leq n$.
What is
$$
\limsup_{m \rightarrow \infty} \left( \limsup_{n \rightarrow \infty} \frac{\pi(n+m) - \pi(n)}{\pi(m)} \ …
- 19.6k
5
votes
0
answers
176
views
Can the integers in an easily computable sequence free of prime numbers always be factored e...
Call a sequence $(a_n)$ of positive integers easily computable
if there is a constant $C$ and an algorithm which computes $a_n$ from
$n$, $a_1, \dots, a_{n-1}$ and a finite number of integer constant …
- 19.6k
39
votes
1
answer
2k
views
Prime number races in 2 dimensions
Is the mapping $$f: \ \mathbb{N} \rightarrow \mathbb{Z}[i], \ \ \ n \ \mapsto
\sum_{2 < p \leq n \ {\rm prime}} e^{\frac{p-1}{4} \pi i}$$ surjective?
In 1999, when I was an undergraduate student, I t …
- 19.6k
2
votes
1
answer
202
views
Endomorphism of the symmetric group of the set of positive integers via action on the prime ...
For a positive integer $n$, let $p_n$ denote the $n$-th prime number.
Further let $f: {\rm Sym}(\mathbb{N}) \rightarrow {\rm Sym}(\mathbb{N})$
be the monomorphism which maps a permutation $\sigma$ to …
- 19.6k