Skip to main content
edited tags
Link
YCor
  • 63.9k
  • 5
  • 187
  • 285
format
Source Link

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let:
$\ E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}\ $$\ \ E_n := \left\{ k \in \left\{1,\dots,n\right\} : \pi(k) \equiv 0 \mod 2 \right\}\ \ $ and $\ O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$$\ \ O_n :=\left\{ k \in \left\{1,\ldots,n\right\} : \pi(k) \equiv 1 \mod 2 \right\}$.

My question: is it true that

$$\lim_{n \to \infty} \frac{|E_n|}{n} = \lim_{n \to \infty} \frac{|O_n|}{n} = \frac{1}{2}$$
Are any methods known for calculating or estimating these limits?

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let:
$\ E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}\ $ and $\ O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$.

My question: is it true that

$$\lim_{n \to \infty} \frac{|E_n|}{n} = \lim_{n \to \infty} \frac{|O_n|}{n} = \frac{1}{2}$$
Are any methods known for calculating or estimating these limits?

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let:
$\ \ E_n := \left\{ k \in \left\{1,\dots,n\right\} : \pi(k) \equiv 0 \mod 2 \right\}\ \ $ and $\ \ O_n :=\left\{ k \in \left\{1,\ldots,n\right\} : \pi(k) \equiv 1 \mod 2 \right\}$.

My question: is it true that

$$\lim_{n \to \infty} \frac{|E_n|}{n} = \lim_{n \to \infty} \frac{|O_n|}{n} = \frac{1}{2}$$
Are any methods known for calculating or estimating these limits?

improved readability(?); superflous redundancy removed.
Source Link

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let $E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}$:
$\ E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}\ $ and $O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$$\ O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$.

My question: is it true that $\lim_{n \to \infty} \frac{|E_n \cap \{1,2,...,n \}|}{n} = \lim_{n \to \infty} \frac{|O_n \cap \{1,2,...,n \}|}{n} = \frac{1}{2}$ ? Are

$$\lim_{n \to \infty} \frac{|E_n|}{n} = \lim_{n \to \infty} \frac{|O_n|}{n} = \frac{1}{2}$$
Are any methods known for calculating or estimating these limits?

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let $E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}$ and $O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$.

My question is it true that $\lim_{n \to \infty} \frac{|E_n \cap \{1,2,...,n \}|}{n} = \lim_{n \to \infty} \frac{|O_n \cap \{1,2,...,n \}|}{n} = \frac{1}{2}$ ? Are any methods known for calculating or estimating these limits?

I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.

Let:
$\ E_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 0 \mod 2 \}\ $ and $\ O_n = \{ k \in \{1,2, .., n\} : \pi(k) \equiv 1 \mod 2 \}$.

My question: is it true that

$$\lim_{n \to \infty} \frac{|E_n|}{n} = \lim_{n \to \infty} \frac{|O_n|}{n} = \frac{1}{2}$$
Are any methods known for calculating or estimating these limits?

edited tags
Link
Mustafa Said
  • 3.7k
  • 2
  • 29
  • 35
Loading
Source Link
Mustafa Said
  • 3.7k
  • 2
  • 29
  • 35
Loading