So I am currently working in the Apostol Book "Introduction to Analytic Number Theory", and am attempting to prove one of the major results regarding the prime number theorem. Specifically I am trying to show that given: $$\lim_{x \to \infty} \frac{\pi(x)\log x}{x} = 1$$ show that: $$\lim_{x\to \infty} \frac{\vartheta (x)}{x} = 1$$ What I have done so far is this: We know for $x > 2$ that: $$\vartheta (x) = \pi (x) \log x + \int_{2}^{x}\frac{\pi(t)}{ t}dt$$ This a result derived previously in the book. So we must show: $$\lim_{x \to \infty} \frac{\pi(x)\log x +\int_{2}^{x}\frac{\pi(t)}{t}dt}{x} = 1$$ Clearly, it suffices to show that: $$ \lim_{x \to \infty} \frac{1}{x}\int_{2}^{x}\frac{\pi(t)}{ t}dt = 0 $$ Apostol then discusses a bound on the integrand. Specifically, states that: $$\lim_{x \to \infty} \frac{\pi(x)\log x}{x} = 1 \implies \frac{\pi(t)}{t} = \mathcal{O} \left(\frac{1}{\log t} \right) $$ for $t>2$. At first, I was unsure as to where this result comes from, but then I realized one could get it by dividing the $\log x$ from both sides of the limit definition. However, it still does not make sense as to what the result means/wether it is rigorous or not. I guess the question I am asking is, what is the connection between big $\mathcal{O}$ notation and asymptotic notation (limit of a quotient)?
2026-03-25 13:49:38.1774446578
Bumbble Comm
On
Big O and Asymptotic Notation
334 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
Bumbble Comm
On
This is quite rigorous:
All you need is that the stated limit implies that $\pi(x)\log x/x<M$ for $x$ large enough. ($M$ can be any number greater than $1$.) From this you get $\pi(x)/x<M/\log x$ for $x$ large enough, and that is precisely the meaning of the big $\mathcal{O}$ notation.
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in LIMITS
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- limit points at infinity
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Maximal interval of existence of the IVP
- Divergence of power series at the edge
- Compute $\lim_{x\to 1^+} \lim_{n\to\infty}\frac{\ln(n!)}{n^x} $
- why can we expand an expandable function for infinite?
- Infinite surds on a number
- Show that f(x) = 2a + 3b is continuous where a and b are constants
- If $a_{1}>2$and $a_{n+1}=a_{n}^{2}-2$ then Find $\sum_{n=1}^{\infty}$ $\frac{1}{a_{1}a_{2}......a_{n}}$
Related Questions in ASYMPTOTICS
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- How to find the asymptotic behaviour of $(y'')^2=y'+y$ as $x$ tends to $\infty$?
- Correct way to prove Big O statement
- Proving big theta notation?
- Asymptotics for partial sum of product of binomial coefficients
- Little oh notation
- Recurrence Relation for Towers of Hanoi
- proving sigma = BigTheta (BigΘ)
- What's wrong with the boundary condition of this $1$st order ODE?
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
Related Questions in ANALYTIC-NUMBER-THEORY
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Is there a trigonometric identity that implies the Riemann Hypothesis?
- question regarding nth prime related to Bertrands postulate.
- Alternating sequence of ascending power of 2
- Reference for proof of Landau's prime ideal theorem (English)
- Does converge $\sum_{n=2}^\infty\frac{1}{\varphi(p_n-2)-1+p_n}$, where $\varphi(n)$ is the Euler's totient function and $p_n$ the $n$th prime number?
- On the behaviour of $\frac{1}{N}\sum_{k=1}^N\frac{\pi(\varphi(k)+N)}{\varphi(\pi(k)+N)}$ as $N\to\infty$
- Analytic function to find k-almost primes from prime factorization
- Easy way to prove that the number of primes up to $n$ is $\Omega(n^{\epsilon})$
- Eisenstein Series, discriminant and cusp forms
Related Questions in CHEBYSHEV-FUNCTION
- Using the 2nd Chebyschev function for describing sums of primes
- What are the Dirichlet transforms of $\Lambda(n+1)$ and $\frac{\Lambda(n+1)}{\log(n+1)}$?
- What's the sum of the inverses of the Primorial numbers?
- Question about the hint and answer.(inequality,and the relation between hint and question itself)
- Finding new expectation using Chebyshev.
- Linear vs Orthogonal polynomial for fitting
- Is the sequence: $S_n=\Im(n\cdot\exp(\frac{2\pi\cdot i}{\log_{n}(p_n\#)})):n\in\Bbb N$ monotonic for $P_n>41893$?
- How can I write $\sum\limits_{p \leq q \text{ prime}}\log (p-1)$ using Chebyshev's function(s)?
- How do I write $\sum\limits_{p \leq q \text{ prime}}\log (p-x)$ using Chebyshev's function(s)?
- Is this a valid conclusion from Chebyshev's first and second function
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You have that $$ \lim_{x\to\infty}\frac{\pi(x)\log x}{x} = 1,\tag{1} $$ and the claim is that $$ \frac{\pi(t)}{t} = \mathcal O\left(\frac{1}{\log t}\right)\qquad\text{as $t\to\infty$,} $$ which is to say that there exists $B>0$ and $M>0$ such that $\pi(t)/t \le B/\log t$ for all $t>M$. Clearly the claim is true if and only if $$ \frac{\pi(t)\log t}{t} \le B \tag{2} $$ for all $t$ sufficiently large. Since you are given $(1)$, you have $(2)$ since eventually the quotient $\frac{\pi(t)\log t}{t}$ is $\le 2$, say.