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 not deleted
user 37555
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.
10
votes
Can anything deep be said uniformly about conjectures like Goldbach's?
There exist surprising counterexamples. Elsholtz and Dietmann found the following: If $p\equiv 7\pmod{8}$ is prime, then the equation $x^2+y^2+z^4=p^2$ has no non-trivial solution. You might argue tha …
2
votes
Accepted
Density of integers with a large rough divisor
If $a/b$ is not too large, you can compute the probability using arguments as in the computation leading to the asymptotics for smooth numbers. In theory, you can compute for all $\beta, \gamma$ a rea …
3
votes
Goldbach's conjecture for the Liouville function
In "The equation $\omega(n)=\omega(n+1)$" (Mathematika 50, 99-101, 2003) it was shown that the equation $\omega(n)=\omega(n+1)$ has infinitely many solutions. Pintz has a series of results on consecut …
1
vote
Spacing of fractions with prime denominator
Wolke (On the large sieve with primes, Acta Math. Acad. Sci. Hungar. 22 (1971/72), 239–247, MathSciNet MR0291121 (45 #215)) has worked on this question. His motivation was Gallagher's approach to the …
1
vote
Writing integers as determinants of matrices with prime entries.
Goldston, Graham Pintz and Yildirim ( https://arxiv.org/abs/0803.2636 ) showed that among three linear forms $\ell_1, \ell_2, \ell_3$, which satisfy the obvious local conditions, there are two, say $\ …
5
votes
Accepted
Specializing non-trivial primality tests
Checking whether an integer $n$ has a divisor in a given interval is essentially equivalent to factorization. Factoring is essentially equivalent to finding the smallest prime factor. So suppose that …
3
votes
Best provable and unconditional lower and upper bounds for Brun's constant
The best known bounds seem to be due to Nicely [``A new error analysis for Brun's constant,'' Virginia J. Sci. 52 (2001), no. 1, 45–55), who showed that Brun's constant is
$$
1.9021605823 \pm 0.000000 …
14
votes
Understanding Vaughan's Identity
The analytic version of Vaughan's identity is
$$
\frac{\zeta'}{\zeta} = F+\zeta'G-FG\zeta + \left(\frac{\zeta'}{\zeta}-F\right)(1-\zeta G).
$$
Here the last factor to the right is the most complicated …
4
votes
Shifted primes avoiding a set of divisors
No, $\delta_y$ need not tend to 0. Take a rapidly increasing sequence of integers $y_n$. Then define the set $B$ as $\{p-1|\exists n: y_n\leq p\leq 2y_n\}$. Then we have
\begin{eqnarray*}
\delta_{y_n} …
8
votes
Primality test for $2p+1$
The if-part is a special case of Pocklingtons theorem (see https://en.wikipedia.org/wiki/Pocklington_primality_test ). The only if part requires some computation, as you need a quadratic non-reside mo …
4
votes
Accepted
Numbers related to the Riemann hypothesis
Proving such results falls into three parts. First you take an effective version of the prime number theorem, which implies all your desired bound for sufficient. Second you write a computer program ( …
10
votes
Does the Prime Number Theorem have anything to do with Erdos-Kac law or vice versa?
The right context of your question is probably the area of Beurling primes. An arithmetic semigroup is a semigroup $(G,\cdot)$ together with a norm $\|\cdot\|:G\rightarrow[1,\infty)$, such that $\|gh\ …
2
votes
A sieve with two parameters
Such a sieve could only exist under rather special conditions. The easiest case would be $\Omega_p=\{0\}$, $z=\sqrt{x}$. In this case the sifted set consists of all integers of the form $pn\leq x$, wh …
1
vote
Estimating $\sum_{p_1\cdots p_k\leq n} \frac{1}{p_1\cdots p_k}$ for various $k$
Define the function $F^*(n)=\underset{p_1\dots p_k\leq n}{\sum_{p_, \ldots, p_k}}\frac{1}{p_1\dots p_k}$. Then we have for each fixed $k$ the asymptotics $F_k^*(n)\sim(\log\log n)^k$. To see this note …
7
votes
Accepted
Two equivalent statements about primes
Statement a) is true for all $N$. This follows from the fact that the number of even integers which cannot be expressed as the sum of 2 primes is small. The best result in this direction is due to Pin …