**0**

votes

**0**answers

75 views

### Prime Ideal Theorem for Real Quadratic Number Rings over Hyperbolic sectors?

As a follow-up to my previous question about variants of Prime Ideal Theorems about Imaginary quadratic number rings found here, I am now asking about the existence of such a companion result for Real ...

**7**

votes

**0**answers

199 views

### A variant of the equidistribution of primes in an imaginary quadratic number ring

It is known that the arguments of prime elements of $\mathbb{Z}[i]$ are equidistributed in $(0,2π)$ (by Theorem 5.36 of Iwaniec and Kowalski, or one of Kubilius' papers cited below). This theorem ...

**7**

votes

**1**answer

191 views

### Lexicographic distribution of irreducible polynomials

Let $A = {\mathbb F}_2[X]$, though the following can be adapted to $p \neq 2$ too. Order the elements of $A$ lexicographically. Equivalently, take a polynomial such as $P = X^4 + X + 1$, write its ...

**2**

votes

**1**answer

219 views

### How to count fixed-sized subsets of pairwise co-prime numbers less than a prime, satisfying an additional constraint?

In part of my research, I need to count (or find a polynomial bound for) the number of possible ways to select $n$ distinct integers less than the prime $p$, say $r_1, r_2, …, r_n$, which are ...

**1**

vote

**0**answers

52 views

### A prime number simplex

Let $\ n\in\mathbf N:= \{1\ 2\ \ldots\}\ $ be a natural number.
Let $\ K\ $ be a non-empty finite set of primes. Let $\ \kappa:=|K|.\ $ Consider a $\kappa$-dimensional simplex $\ S_K\subseteq \mathbf ...

**7**

votes

**1**answer

181 views

### Main term in the number of sign changes of $\psi(x) - x$

Define $N_\Delta(T)$ to be the number of sign changes of $\psi(x) - x$ in the interval $[1, T]$.
Landau's Theorem says $N_\Delta(T)$ is $\Omega(\log T)$ [1].
But perhaps that estimate is too crude. ...

**1**

vote

**1**answer

475 views

### What is the best currently proven bounds on prime gaps?

I did some digging around on the internet but I found tons of different equations on both lower and upper bounds for the largest possible prime gap g(n). I was wondering what are currently the best ...

**3**

votes

**0**answers

178 views

### Effective prime number theorem

The prime number theorem implies that for every $ϵ>0$, there is $n_\epsilon$ such that for all $n≥n_\epsilon$ the number of primes in $[n,cn]$ is at least $\frac{(c−1−\epsilon)n}{\log n}$ and at ...

**1**

vote

**0**answers

39 views

### Distribution of primes and near-primes among $\prod p_k \pm 1$

For $n\in \Bbb{Z}^+$ define the statement "$n$ is $k$-social" to mean that
$$
\prod_{i=1}^n p_i +1 \mbox{ has exactly } k \mbox{ prime factors}
$$
where $p_i$ is the $i$-th prime.
So for example $5$ ...

**1**

vote

**0**answers

106 views

### Density of ratios of an arbitrary increasing sequence of prime numbers

It is well known that the set $\left\{ \frac{p}{q} : p,q \textrm{ prime numbers }\right\}$ is dense in the positive real numbers $\mathbb{R}_{>0}$. Not having a background in number theory, I ask ...

**3**

votes

**0**answers

142 views

### Does data suggest $| \pi_2 (n) - 2\Pi \int_2^n \frac{dx}{\ln(x)^2} | < \ln(n+2)^2 \sqrt (n+2) $?

Let $\Pi$ be the twin prime constant and $\pi_2(n)$ the twin prime counting function.
Define
$$ t(n) = \left| \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} \right| $$
Is it consistent with current ...

**8**

votes

**1**answer

269 views

### Primes in arithmetic progression with a moduli equal to a power of 2

I am currently looking for a result stronger than Siegel-Walfisz theorem, which gives an upper bound on the error term $|\pi(x,a,b)-\frac{\pi(x)}{\phi(a)}|$ for particular $a$.
The Siegel Walfisz is ...

**7**

votes

**3**answers

567 views

### Quantitative and elementary proofs of the Prime Number Theorem

I would like to know two things: one, whether the best quantative bounds in the Prime Number Theorem are still basically those given by the Vinogradov-Korobov zero-free region? and two, whether there ...

**4**

votes

**2**answers

322 views

### Asymptotics of the least common multiple of the first natural numbers

What is $$ \limsup_{n \to \infty} \frac{\log(\mathrm{lcm}(1,2, \dots, n))}{n} \ \ ?$$

**5**

votes

**3**answers

428 views

### Logarithmic integral, $π(x)$ and $x/(\ln x)$

The function $\text{Li}$ (logarithmic integral) is defined for $x>0$
by
$$
\text{Li}(x)=\int_2^{x}\frac{dt}{\ln t}.
$$
The prime number theorem, proven by Hadamard and de la Vallée-Poussin in 1896 ...

**0**

votes

**2**answers

124 views

### Min number of primes up to n

According to the prime number theorem there are about $n/\ln(n)$ primes less than $n$. This value is a limit but it could fluctuate. My question is, is there a known bound on this fluctuation? i.e. ...

**3**

votes

**3**answers

335 views

### How many primes have the form $(2^p+1)/3$?

Assuming that $p$ is an odd prime. How many primes have the form $(2^p+1)/3$? Is the number finite? Mathematica calculation shows that there are 23 such primes when $p$ ranges over the first 500 ...

**1**

vote

**1**answer

162 views

### Counting prime powers $p^{\frac{k}{t}} \left( t \in \mathbb{R}{+}, k \in \mathbb{N} \right)$ by changing $\rho$'s in $\psi(x)$?

With $\rho=\beta+ \gamma \,i$ being a non-trivial zero of $\zeta(s)$, the logarithmic prime counting function is:
$$\psi(x) = x - \log(2\pi) - \frac12 \log\left(1- \frac{1}{x^2}\right) - \sum_{\rho}...

**1**

vote

**0**answers

150 views

### Siegel Walfisz Theorem for algebraic number fields

Is there a generalization of the Siegel Walfisz to algebraic number fields? This has been done for the prime number theorem in the prime ideal theorem.

**3**

votes

**1**answer

440 views

### Lower bounds on the error term of the prime number theorem

Are there any lower bounds on the error term for the prime number theorem, or in other words, is there a nontrivial $f$ s.t.
$$f(x)\ll |\psi(x) - x|$$
where $\psi$ is the Chebyshev function.

**6**

votes

**2**answers

298 views

### Divisor sums over values of binary forms of primes

Let $\tau$ be the divisor function, that is
$$
\tau(n)=\sharp\{d \in \mathbb{N}, d|n\}.
$$
I was wondering if anyone has ever proved an asymptotic estimate
for the sum
$$S(x):=\sum_{p,q\leq x}\tau(p^...

**10**

votes

**1**answer

416 views

### Squarefree numbers $n$ such that $432n+1$ is also squarefree

This is a second attempt (see Primes $p$ such that $432 p +1$ is prime)
Is the set of squarefree numbers $n$ such that $n(432 n+1)$ is also squarefree known to be infinite?
Fact: the number of such ...

**0**

votes

**1**answer

374 views

### Primes $p$ such that $432 p +1$ is prime [closed]

Is the set of prime numbers $p$ such that $432 p + 1$ is also prime infinite?
It doesn't follow from Dirichlet's theorem as far as I can tell.

**6**

votes

**2**answers

921 views

### The shortest interval for which the prime number theorem holds [closed]

It is well known that the prime number theorem on the form
\begin{align*}
\pi(x+y) - \pi(x) \sim \frac{y}{\log (x+y)}
\end{align*}
breaks down for short enough intervals, e.g. taking $y=(\log x)^\...

**4**

votes

**1**answer

177 views

### Log weight removal in general (weaker) prime number theorem

Let $a_n$ be a sequence of non-negative numbers.
Assume that $$\limsup _{X\to \infty}\frac{\sum_{p\leq X} a_p\log p}{X}\leq 1.$$
Can we prove that $$\limsup _{X\to \infty}\frac{\sum_{p\leq X} a_p}{X/\...

**1**

vote

**1**answer

188 views

### Question on an arithmetic function with the sieve of Eratosthenes

I want to ask some question related with the sieve of Eratosthenes.
The sieve of Eratosthenes: write it as $E_1(x) (=\pi(x)-\pi(\sqrt x)+1)$.
Then we have an obvious result
$$E_1(x)/x\ln^{-1}x = 1,$$...

**4**

votes

**1**answer

227 views

### Consecutive Primes mod 3

Is anything known asymptotically about the binary "primes mod 3" sequence besides Dirichlet's result that 1 and 2 occur half of the time? For example, can you prove that it does not eventually cycle ...

**0**

votes

**0**answers

113 views

### asymptotics of primes in arithmetic progressions

If $a$ and $q$ are given coprime positive integers, what is the best known error term for
$$
\sum_{p<x,\,p\,\text{is prime},\,p\equiv a \pmod q} \frac{\log p}p-\frac{\log x}{\varphi(q)}?
$$
Is it, ...

**6**

votes

**0**answers

306 views

### implication of divergence of $1/\zeta(s) $ at 1/2

$1/\zeta(s)=\sum_{n>0}\frac{\mu(n)}{n^s}$ where $\mu$ is the Moebius function. This series is known to converge for $s\ge 1$ and diverge for $s\le 1/2$.
Its convergence is unknown if $1/2< s<...

**6**

votes

**3**answers

879 views

### a question for the prime counting function

A famous inequality that has been proved by J.B. Rosser and L. Schoenfeld says that
$\frac{n}{\ln n-1/2}$ < $\pi(n)$<$\frac{n}{\ln n-3/2} , n\ge 67$.
Using this inequality we can prove ...

**1**

vote

**0**answers

174 views

### apparent contradiction from result on prime gaps [closed]

I'm looking at Theorem 3 of this paper, which is
If $\:x\geq \exp(\exp(45))\:$ and $\;\;h\:\geq\:3\cdot x^{\frac23}\;\;$ then $$\pi(x+h)-\pi(x) \; \geq \; h\cdot \left(1-\left(3192.34\cdot \exp\...

**9**

votes

**3**answers

821 views

### Asymptotic bounds on $\pi^{-1}(x)$ (inverse prime counting function)

What are the current best asymptotic bounds on $\pi^{-1}(x)$, where $\pi(x)$ denotes the prime counting function (number of primes at most $x$)?
In other words, I am curious about the state of the ...

**2**

votes

**1**answer

508 views

### Given an even integer N, what is the minimum set of primes such that any even number x <= N can be expressed as the sum of two primes from the set?

Given an even integer N, what is the minimum set of primes such that any even number $x \leq N$ can be expressed as the sum of two primes in the set?
Goldbach's conjecture said Every even integer ...

**4**

votes

**1**answer

302 views

### Estimate on the prime-counting function $\psi(x)$.

There is an elementary statement that I believe I have read somewhere, but I can't remember where. I'd like to know if the statement is correct (in which case it is surely standard) and if so, where I ...

**0**

votes

**4**answers

372 views

### The prime number $2$ [duplicate]

Possible Duplicate:
Why is 2 so odd?
I have read few books and articles, almost all of them refer that any prime $p>2$. Just wondering why it has to be $>2$?

**7**

votes

**0**answers

351 views

### Montgomery's conjecture and lower bound on certain Fourier transform.

Recently I have come across the following question, while meditating about Matt Young's answer to this question of mine, explaining the heuristic (or at least, one possible heuristic) behind ...

**23**

votes

**2**answers

3k views

### Why do primes dislike dividing the sum of all the preceding primes?

I was investigating primes with the property that the sum of the first $n$ primes is divisible by $p_n$. It turns out that these primes are extremely extremely rare. For primes less than $10^9$, I ...

**6**

votes

**2**answers

1k views

### Probability that randomly chosen integers from a restricted set of natural numbers are coprime

We know that the probability $P(k)$ of $k$ randomly chosen integers $(k \ge 2)$ from the set of natural number are coprime is
$$
P(k) = \frac{1}{\zeta(k)}.
$$
I am looking at a special case of ...

**1**

vote

**0**answers

161 views

### Limit of Sequence of unusual Prime Product

Let $p_n$ be the nth prime and $p_L$ be closest to its square root:
\begin{equation}
p_L^2 \approx p_n \approx x
\end{equation}
Let $\sigma \in Z^+$ be a positive integer constant. Define the ...

**0**

votes

**1**answer

472 views

### Name of a conjecture on difference of prime numbers? [closed]

Hello Dear
there is a conjecture for which I do not know how it is called. The conjecture is:
Every even number can be always written as the difference between two prime numbers.
Could you ...

**1**

vote

**2**answers

377 views

### Can $\epsilon$ be a generating function? [closed]

I would like to know if I could do something like:
$\epsilon (0)\text{:=}0$
$\epsilon (n)\text{:=}\frac{4}{2 n-(-1)^n+1}$
and use it instead of a constant.
As $n\rightarrow \infty$, $\epsilon \...

**0**

votes

**1**answer

399 views

### Primes are to Irreducible Polynomials as Prime-related theorems are to ?? [closed]

Irreducible polynomials are often introduced as the analog to prime numbers in polynomial rings. Prime numbers, of course, have a very rich theory, leading to the likes of the Riemann Zeta function ...

**7**

votes

**3**answers

1k views

### Asymptotics for primality of sum of three consecutive primes

We consider the sequence $R_n=p_n+p_{n+1}+p_{n+2}$, where $\{p_i\}$ is the prime number sequence, with $p_0=2$, $p_1=3$, $p_2=5$, etc..
The first few values of $R_n$ are:
10, 15, 23, 31, 41, 49, 59, ...

**5**

votes

**1**answer

2k views

### Error term of the Prime Number Theorem and the Riemann Hypothesis

I have read that the Riemann Hypothesis is equivalent to
$\pi(x)=\text{Li}(x)+O(\sqrt{x}\log x)$
Is there an analogous statement saying the Riemann Hypothesis is equivalent to
$\pi(x)=\frac{x}{\log ...

**13**

votes

**3**answers

3k views

### Why is the Chebyshev function relevant to the Prime Number Theorem

Why is the Chebyshev function
$\theta(x) = \sum_{p<=x}\log p$
useful in the proof of the prime number theorem. Does anyone have a conceptual argument to motivate why looking at $\sum_{p<=x} \...

**12**

votes

**5**answers

4k views

### Upper bounds for the sum of primes up to $n$

Let $s(n)$ denote the sum of primes less than or equal to n. Clearly, $s(n)$ is bounded from above by the sum of the first $n/2$ odd integers $+1$. $s(n)$ is also bounded by the sum of the first $n$ ...