Question: Prove that $\sum_{n=1}^N \ln(n)- \int_{0}^N \ln x +o(1) \geq 0.5*\ln(N)$, where 0(1) is infinity small and N is the last number of sum. My thoughts: In the graphical representation of the difference of integral and sum there should be triangles, whose squares must be equal to this value. Also there is no use of first element of the sum, because when n=0 -> lnn=0
2026-04-08 07:33:36.1775633616
Prove that $\sum_{n=1}^N \ln(n)- \int_{0}^N \ln x +o(1) \geq 0.5*\ln(N)$
85 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INTEGRATION
- How can I prove that $\int_0^{\frac{\pi}{2}}\frac{\ln(1+\cos(\alpha)\cos(x))}{\cos(x)}dx=\frac{1}{2}\left(\frac{\pi^2}{4}-\alpha^2\right)$?
- How to integrate $\int_{0}^{t}{\frac{\cos u}{\cosh^2 u}du}$?
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- How to find the unit tangent vector of a curve in R^3
- multiplying the integrands in an inequality of integrals with same limits
- Closed form of integration
- Proving smoothness for a sequence of functions.
- Random variables in integrals, how to analyze?
- derive the expectation of exponential function $e^{-\left\Vert \mathbf{x} - V\mathbf{x}+\mathbf{a}\right\Vert^2}$ or its upper bound
- Which type of Riemann Sum is the most accurate?
Related Questions in SUMMATION
- Computing:$\sum_{n=0}^\infty\frac{3^n}{n!(n+3)}$
- Prove that $1+{1\over 1+{1\over 1+{1\over 1+{1\over 1+...}}}}=\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+...}}}}$
- Fourier series. Find the sum $\sum_{n=1}^\infty \frac{(-1)^{n+1}}{2n+1}$
- Sigma (sum) Problem
- How to prove the inequality $\frac{1}{n}+\frac{1}{n+1}+\cdots+\frac{1}{2n-1}\geq \log (2)$?
- Double-exponential sum (maybe it telescopes?)
- Simplify $\prod_{k=1}^{l} \sum_{r=d}^m {{m}\choose{r}} \left(N-k \right)^{r} k^{m-r+1}$
- Sum of two martingales
- How can we prove that $e^{-jωn}$ converges at $0$ while n -> infinity?
- Interesting inequalities
Related Questions in LOGARITHMS
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Extracting the S from formula
- How to prove the following inequality (log)
- Rewriting $(\log_{11}5)/(\log_{11} 15)$
- How to solve this equation with $x$ to a logarithmic power?
- Show that $\frac{1}{k}-\ln\left(\frac{k+1}{k}\right)$ is bounded by $\frac{1}{k^2}$
- Why do we add 1 to logarithms to get number of digits?
- Is my method correct for to prove $a^{\log_b c} = c^{\log_b a}$?
- How to prove the inequality $\frac{1}{n}+\frac{1}{n+1}+\cdots+\frac{1}{2n-1}\geq \log (2)$?
- Unusual Logarithm Problem
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?
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?
Note: I added an upper bound to go with the lower bound.
I also added a proof that the series for $\ln(1+x)$ is enveloping.
I will show by elementary means that $\frac12\ln(N)+\frac32 \gt \sum_{n=1}^N\ln(n)-\int_{0}^N \ln(x) dx \gt \frac12\ln(N)+\frac13 $.
This shows that $\ln(N!) =N\ln(N)-N+\frac12\ln(N) +c(N) $ where $\frac13 \lt c(N) \lt \frac32 $. This agrees with Stirling's $\ln(\sqrt{2\pi}) \approx 0.9189$.
$\begin{array}\\ \ln(n)-\int_{n-1}^n \ln(x) dx &=\ln(n)-(x\ln(x)-x)_{n-1}^n\\ &=\ln(n)-(n\ln(n)-n-((n-1)\ln(n-1)-(n-1)))\\ &=\ln(n)-(n\ln(n)-1-((n-1)\ln(n-1)))\\ &=1-((n-1)\ln(n)-((n-1)\ln(n-1)))\\ &=1-(n-1)(\ln(n)-\ln(n-1))\\ &=1-(n-1)\ln(\frac{n}{n-1})\\ &=1-(n-1)\ln(1+\frac{1}{n-1})\\ \end{array} $
$\frac1{x}\ln(1+x) =\frac1{x}(x-\frac{x^2}{2}+\frac{x^3}{3}-...) =1-\frac{x}{2}+\frac{x^2}{3}-... $.
Since this series is enveloping (see the discussion at the bottom), $1-\frac{x}{2} \lt \frac1{x}\ln(1+x) \lt 1-\frac{x}{2}+\frac{x^2}{3} $ or $\frac{x}{2} \gt 1-\frac1{x}\ln(1+x) \gt \frac{x}{2}-\frac{x^2}{3} $.
Putting $x = \frac1{n-1}$, $\frac{1}{2(n-1)} \gt 1-(n-1)\ln(1+\frac1{n-1}) \gt \frac{1}{2(n-1)}-\frac{1}{3(n-1)^2} $.
Therefore
$\begin{array}\\ \sum_{n=2}^N\ln(n)-\int_{1}^N \ln(x) dx &=\sum_{n=2}^N(\ln(n)-\int_{n-1}^n \ln(x) dx)\\ &=\sum_{n=2}^N(1-(n-1)\ln(1+\frac{1}{n-1}))\\ &>\sum_{n=2}^N(\frac{1}{2(n-1)}-\frac{1}{3(n-1)^2})\\ &=\sum_{n=2}^N\frac{1}{2(n-1)}-\sum_{n=2}^N\frac{1}{3(n-1)^2}\\ &=\frac12\sum_{n=1}^{N-1}\frac{1}{n}-\frac13\sum_{n=1}^{N-1}\frac{1}{n^2}\\ \text{and}\\ \sum_{n=2}^N\ln(n)-\int_{1}^N \ln(x) dx &=\sum_{n=2}^N(1-(n-1)\ln(1+\frac{1}{n-1}))\\ &<\sum_{n=2}^N\frac{1}{2(n-1)}\\ &=\frac12\sum_{n=1}^{N-1}\frac{1}{n}\\ \end{array} $
Since $\frac1{x}$ is decreasing for $x > 0$, $\frac1{n} \gt \int_n^{n+1} \frac{dx}{x} $ so
$\begin{array}\\ \sum_{n=1}^{N-1}\frac{1}{n} &\gt \sum_{n=1}^{N-1} \int_n^{n+1} \frac{dx}{x}\\ &=\int_1^N \frac{dx}{x}\\ &=\ln(N)\\ \end{array} $
Similarly, $\frac1{n} \lt \int_{n-1}^{n} \frac{dx}{x} $ so
$\begin{array}\\ \sum_{n=1}^{N-1}\frac{1}{n} &=1+\sum_{n=2}^{N-1}\frac{1}{n}\\ &\lt 1+\sum_{n=2}^{N-1} \int_{n-1}^{n} \frac{dx}{x}\\ &=1+\int_1^{N-1} \frac{dx}{x}\\ &=1+\ln(N-1)\\ &<1+\ln(N)\\ \end{array} $
Also
$\begin{array}\\ \sum_{n=1}^{N-1}\frac{1}{n^2} &=1+\sum_{n=2}^{N-1}\frac{1}{n^2}\\ &=1+\sum_{n=2}^{N-1}\frac{1}{n^2}\\ &<1+\sum_{n=2}^{N-1}\frac{1}{n(n-1)}\\ &=1+\sum_{n=2}^{N-1}(\frac1{n-1}-\frac1{n})\\ &=1+1-\frac1{N-1}\\ &< 2\\ \end{array} $
so that $\sum_{n=2}^N\ln(n)-\int_{1}^N \ln(x) dx \gt \frac12\ln(N)-\frac23 $.
Since $\ln(1) = 0$ and $\int_0^1 \ln(x) dx =(x\ln(x)-x)_0^1 =-1 $, $\sum_{n=1}^N\ln(n)-\int_{0}^N \ln(x) dx \gt \frac12\ln(N)+\frac13 $.
Similarly, $\sum_{n=2}^N\ln(n)-\int_{1}^N \ln(x) dx \lt \frac12(1+\ln(N)) =\frac12+\frac12\ln(N) $ so that $\sum_{n=1}^N\ln(n)-\int_{0}^N \ln(x) dx \lt \frac12\ln(N)+\frac32 $.
On $\ln(1+x)$.
If $0 < x < 1$ and $m \in \mathbb{N}$,
$\begin{array}\\ \dfrac1{1+x} &=\sum_{n=0}^{\infty} (-1)^n x^n\\ &=\sum_{n=0}^{m-1} (-1)^n x^n+\sum_{n=m}^{\infty} (-1)^n x^n\\ &=\sum_{n=0}^{m-1} (-1)^n x^n+(-1)^mx^m\sum_{n=m}^{\infty} (-1)^{n-m} x^{n-m}\\ &=\sum_{n=0}^{m-1} (-1)^n x^n+(-1)^mx^m\sum_{n=0}^{\infty} (-1)^{n} x^{n}\\ &=\sum_{n=0}^{m-1} (-1)^n x^n+(-1)^mx^m\dfrac1{1+x}\\ \int_0^t \dfrac{dx}{1+x} &=\int_0^t\sum_{n=0}^{m-1} (-1)^n x^n+\int_0^t(-1)^mx^m\dfrac1{1+x}\\ &=\sum_{n=0}^{m-1} (-1)^n \int_0^t x^ndx+(-1)^m\int_0^t\dfrac{x^mdx}{1+x}\\ \ln(1+t) &=\sum_{n=0}^{m-1} \dfrac{(-1)^nt^{n+1}}{n+1}+(-1)^m\int_0^t\dfrac{x^mdx}{1+x}\\ &=\sum_{n=0}^{m-1} \dfrac{(-1)^nt^{n+1}}{n+1}+(-1)^mE_m(t)\\ \end{array} $
$\begin{array}\\ E_m(t) &=\int_0^t\dfrac{x^mdx}{1+x}\\ &\lt\int_0^tx^mdx\\ &=\dfrac{t^{m+1}}{m+1}\\ \text{and}\\ E_m(t) &=\int_0^t\dfrac{x^mdx}{1+x}\\ &\gt\int_0^t\dfrac{x^mdx}{1+t}\\ &=\dfrac{t^{m+1}}{(1+t)(m+1)}\\ \text{so}\\ 0 &\lt \dfrac{t^{m+1}}{m+1}-E_m(t)\\ &\lt \dfrac{t^{m+1}}{m+1}-\dfrac{t^{m+1}}{(1+t)(m+1)}\\ &= \dfrac{t^{m+1}}{m+1}(1-\dfrac{1}{1+t})\\ &= \dfrac{t^{m+1}}{m+1}(\dfrac{t}{1+t})\\ &= \dfrac{t^{m+2}}{(m+1)(1+t)}\\ &< \dfrac{t^{m+2}}{m+1}\\ \end{array} $