0
votes
0answers
23 views

Prove natural log between two finite harmonic sums [duplicate]

Prove for n in the naturals we have: $$\sum_{k=2}^n 1/k \le \ln(n) \le \sum_{k=1}^{n-1} 1/k$$ Intuitively this makes sense to me but I can't for the life of me figure out how to start this proof.
-2
votes
2answers
110 views

How to show $\log_2 x \cdot \log_{0.25} x \cdot \log_{0.125} x \cdot \log_{16} x > \frac {2}3$?

I was trying to solve $\log_2 x \cdot \log_{0.25} x \cdot \log_{0.125} x \cdot \log_{16} x > \frac {2}3$ and I keep getting a partial answer of $x>4$ though answer key suggests a more expanded ...
7
votes
3answers
181 views

Is $ln(x)$ ever greater than $x$

Is $\forall x \in \mathbb{R}, \ln(x) \lt x$ a true statement? Just wondering for some convergence related thing
3
votes
2answers
75 views

$\ln(n)/n<1/2$ proof without calculus or any kind of advanced mathematics

Is it possible to show that $\ln(n)/n<1/2$, for all natural numbers $n$ without using calculus, but just some elementary math? Induction is allowed. I was trying to show equivalently that ...
2
votes
1answer
75 views

Tighter logarithmic inequality

There is a well-known lower bound for $$ x\log{1+x\over x}\geq {x\over1+x} $$ for $x\geq0$. I know a tighter lower bound on the same domain $$ x\log{1+x\over x}\geq{2x\over1+2x}\geq {x\over1+x}. $$ It ...
6
votes
3answers
139 views

Something about $\frac{\log x}{x}$

Denote $\log x = \log_ex$. Let's consider the below function $$\frac{\log x}{x}$$. Apparently, It's maximum is $\frac{1}{e}$. and strictly increasing in $(0,e]$, strictly decreasing in $[e,+\infty)$. ...
1
vote
1answer
75 views

Upperbound for $ \sum _{i=1}^N a_i\ln a_i $

It's easy to prove that following upperbound is true: $\sum_{i=1}^N a_i\ln a_i \le A \ln A$, where $\sum_{i=1}^N a_i=A$ and $ a_i\ge 1$ I'm wondering, is there stronger upperbound?
1
vote
1answer
54 views

Why does this equation work?

let $ P(x) := \sum_{p \leq x} Log [p]$, then we have $P(2^{k+1}) = \sum_{i=0}^k ( P(2^{i+1}) - P(2^i)) < 2 \cdot Log[2] \cdot (1 + 2 + 4 +... + 2^k) \leq 4 \cdot Log[2] \cdot 2^k$. Why does ...
0
votes
2answers
48 views

Logarithmic equation

I'm studying logarithms and I encountered this equation: $$[\log_9(k+1)]^2+\log_9(k+1)+(k+1)>3$$ I tried a lot but I still couldn't solve it! I know this may be easy for most of you but please ...
2
votes
2answers
26 views

Parametric inequation…

Supppose we have $a$ a real positive number that's not equal to $1$. Solve the following inequation: $$\log_a(x^2-3x)>\log_a(4x-x^2)$$ If it's known that $x=3.75$ is one solution of it.
1
vote
1answer
20 views

Help with integral/logarithm inequality

I have to prove the following inequality: $1/(n+1) < \int_n^{n+1} 1/t$ $dt$ $<1/n$ I thought it would be easier to attack this via integration, so I get: $1/(n+1) <$ log $(n+1)-$ ...
2
votes
0answers
38 views

When this inequality true?

If $a$ and $b$ are non-negative integers and $c$ and $d$ are non-negative real numbers, for what values is the following inequality true? $\log((a+b)!) - \log(a!b!) \ge(a+b) \log(c+d) - (a \log(c) ...
1
vote
0answers
84 views

Showing that a logarithmic inequality holds

Given $0 < x_1 < x_2 < x_3 < x_4 < 1$, how can I show that the following inequality holds: $$ \frac{1}{R(x_1, x_3)}+\frac{1}{R(x_2, x_4)}<\frac{1}{R(x_1, x_2)}+\frac{1}{R(x_3, x_4)} ...
10
votes
2answers
264 views

$\lfloor n^{1/2}\rfloor+\cdots+\lfloor n^{1/n}\rfloor=\lfloor \log_2n\rfloor +\cdots+\lfloor \log_nn \rfloor$

Prove that: $\lfloor n^{1/2}\rfloor+\cdots+\lfloor n^{1/n}\rfloor=\lfloor \log_2n\rfloor +\cdots+\lfloor \log_nn \rfloor$, for $n > 1,\, n\in \mathbb{N}$ For example. For $n=2$, we have $\lfloor ...
2
votes
2answers
27 views

Let $x_0 > x_1 > x_2>x_3$ be any positive real numbers . What is the largest value of the real number k such that..

Question : Let $x_0 > x_1 > x_2>x_3$ be any positive real numbers . What is the largest value of the real number k such that $$\log \frac{x_0}{x_1}1993 + \log \frac{x_1}{x_2}1993 +\log ...
2
votes
1answer
170 views

Logarithms melting my brain

So I've got an inequality: $\ln(2x-5) > \ln(7-2x)$ and I attempt to solve by doing the following: $$\frac{\ln(2x)}{\ln(5)} > \frac{\ln(7)}{\ln(2x)}$$ $$\Rightarrow \ln(2x) \cdot \ln(2x) > ...
0
votes
2answers
46 views

Having trouble solving an inequality

I'm a trying to prove a recurrence relation (by substitution) for an algorithm class and I'm shamefully stuck in a rather simple looking inequality. I need to solve this inequality for constant $c$: ...
0
votes
1answer
42 views

How do I simplify and calculate this inequality?

$\log(x^3) > |x-1|$ I can't figure out how to go about solving this inequality, besides this one step: $3\log(x) > |x-1|$
11
votes
5answers
2k views

Why is it trivial that $\left(1+\frac{2\ln3}{3}\right)^{-3/2}\leq\frac{2}{3}$?

Can someone tell me why $$\left(1+\dfrac{2\ln3}{3}\right)^{-3/2}\leq\dfrac{2}{3}$$ is trivial because for me its not and I will need to do the calculation to see it.
2
votes
4answers
118 views

Showing $\frac{x}{1+x}<\log(1+x)<x$ for all $x>0$ using the mean value theorem

I want to show that $$\frac{x}{1+x}<\log(1+x)<x$$ for all $x>0$ using the mean value theorem. I tried to prove the two inequalities separately. $$\frac{x}{1+x}<\log(1+x) \Leftrightarrow ...
2
votes
1answer
129 views

Show root test is stronger than ratio test

Let $a_n$ be a sequence of real positive numbers. Show $$\liminf_{n\to  \infty} \frac{a_{n+1}}{a_n} \leq \liminf_{n\to \infty}\,(a_n)^{1/n}  \leq \limsup_{n\to \infty} \, (a_n)^{1/n} \leq ...
5
votes
6answers
238 views

Prove that for all $x>0$, $1+2\ln x\leq x^2$

Prove that for all $x>0$, $$1+2\ln x\leq x^2$$ How can one prove that?
2
votes
2answers
66 views

Why is $x\log(x)$ convex?

Why is $x\log(x)$ convex? According to the definition it must hold: $(tx+(1-t)y)\log(tx+(1-t)y)\le tx\log(x)+(1-t)y\log(y)$ for all positive $x,y$ and $t\in[0,1]$ edit: It is allowed to ...
2
votes
1answer
82 views

Is anyway to prove this: $\prod_{k=1}^{n}(a_{k})< (1/n^n)*(\sum_{k=1}^{n}(\sqrt{1+a_{k}*a_{k+1}}))^n$

$$ \prod\limits_{k=1}^{n}a_{k} < {1 \over n^{n}}\left(\,\sum_{k = 1}^{n}\,\sqrt{1+a_{k}\,a_{k+1}\,}\,\right)^n $$ ak and n are positive real number greater than 0. EDIT: a_{k+1} becomes a_{1} ...
0
votes
1answer
67 views

Solve the inequality $2^{\left( x^{3}-x\right) } < 1$

$2^{\left( x^{3}-x\right) } < 1$ Let $2^{\left( x^{3}-x\right) }-1=f\left( x\right)$ To find the values for which $f(x)<0$ I let $f(x)=0$: $2^{\left( x^{3}-x\right) }-1=0$ $2^{\left( ...
1
vote
1answer
84 views

How to prove the following inequality of logarithm?

Let $x,y,z\in\mathbb{C}.$ Suppose $$z=\frac{1}{2}(xy\pm\sqrt{x^2y^2-4(x^2+y^2)} ).$$ Show that $$log^+|z|\leq log^+|x|+log^+|y|+log 2.$$ Where $log^+\phi=max\{0,log\phi\}.$ Here we are also ...
2
votes
3answers
60 views

How to solve the inequality $n! \le n^{n-2}$?

The inequality is $n! \le n^{n-2}$. I used Stirling's approximation for factorials and my answer was $n \le (e(2\pi)^{-1/2})^{2/5}$ but this doesn't seem right. Any help would be much appreciated.
0
votes
1answer
63 views

From $ \sum^\infty_{\lfloor \log n \rfloor + 1}n/{2^r} $ to $ \sum^\infty_{r=0}1/2^r $?

$$ E[h] = E[\sum^\infty_{r=1}I_r] = \sum^\infty_{r=1}E[I_r] $$ $$ = \sum^{ \lfloor \log n \rfloor}_{r=1}E[I_r] + \sum^\infty_{\lfloor \log n \rfloor + 1}E[I_r] $$ $$ \leq \sum^{ \lfloor \log n ...
3
votes
2answers
172 views

Prove that $\log^25 + \log^27 > \log12$.

Prove that $\log^25 + \log^27 > \log12$. What I tried so far: $\log^25 + \log^27 > \log3 + \log4$ $(\log5 + \log7)^2 - 2 \cdot \log5 \cdot\log7 > \log3 + \log4$ But it seems that I'm not ...
6
votes
6answers
211 views

Inequality, what is wrong with $\log(-1) = - \log(-1)$?

Can anyone tell me what is wrong with the following line of argument: $$ \log(-1) = \log(-1) - \log(1) = - \bigg( \log(1) - \log(-1) \bigg) = - \log \Big( \frac{1}{-1} \Big) = - \log(-1) $$ ...
1
vote
2answers
47 views

Logarithm problem : Prove that $log_{3^2} \frac{1}{2} > 0$

Logarithm problem : Prove that $log_{3^2} \frac{1}{2} > 0$ My approach : $log_{3^2} \frac{1}{2} > 0$ $\Rightarrow \frac{1}{2} log_3 \frac{1}{2} >0$ $\Rightarrow \frac{1}{2} [ log_3 1 ...
0
votes
3answers
58 views

Solving inequality having log

I am struggling to solve this inequality involving logarithm. How to find out values of $n$ for which below inequality holds good: $${\log_2n \over n} >{ 1 \over 8}$$
2
votes
2answers
79 views

Inequality $C\lceil\log{n}\rceil! \geq n^k$

I've been struggling to prove there exist $C$ for $n, n_{0}, \forall k >0 \in \mathbb{R}$ such that $\forall n > n_{0}$: \begin{equation}C\lceil\log{n}\rceil! \geq n^k\end{equation} As you ...
3
votes
3answers
111 views

Inequality with logarithms

How do I show that $$ \frac{1}{n-1}\geq \ln \left ( \frac{n}{n-1} \right ) $$ for $ n>1 $? As far as I can tell, exponentiating both sides with base $e$ won't help, because then I get a nasty ...
1
vote
2answers
61 views

determine x in $x\log_\frac{1}{10}(x^2+x+1)>0$

I wanted to know, how can i determine the values of x for which $x\log_\frac{1}{10}(x^2+x+1)>0$ going to the question, we must have $x>0$ and $\log_\frac{1}{10}(x^2+x+1)>0$ or both must ...
4
votes
1answer
545 views

If $ax^2-bx+c=0$ has two distinct real roots lying in the interval $(0,1)$ $a,b,c$ belongs to natural prove that $\log_5 {abc}\geq2$

If $ax^2-bx+c=0$ has two distinct real roots lying in the interval $(0,1)$ with $a, b, c\in \mathbb N$, prove that $\log_5 {abc}\geq2$. The equations I could form are: 1) $f(0)>0$ and ...
3
votes
2answers
55 views

Logarithm inequality for vectors

I am trying to prove the following result. Let $d$ be a vector in $\mathbf{R}^{n}$ with $\|d\|_{\infty} < 1$. Then, $$ \sum_{i=1}^{n} \log(1 + d_{i}) \geq \mathbf{1}^{T} d - \frac{\|d\|_{2}^{2}}{2 ...
9
votes
4answers
719 views

Prove that $\log _5 7 < \sqrt 2.$

Prove that $\log _5 7 < \sqrt 2.$ Trial : Here $\log _5 7 < \sqrt 2 \implies 5^\sqrt 2 <7.$ But I don't know how to prove this. Please help.
0
votes
2answers
59 views

Why does this inequality hold: $4n+2\le4n\log{n}+2n\log{n}$

Why is the following true? (I came across this in an algorithm analysis book but this inequality is not related to algorithm analysis) $$ 4n+2\le4n\log{n}+2n\log{n} $$
6
votes
6answers
254 views

Elegant way to solve $n\log_2(n) \le 10^6$

I'm studying Tomas Cormen Algorithms book and solve tasks listed after each chapter. I'm curious about task 1-1. that is right after Chapter #1. The question is: what is the best way to solve: ...
0
votes
1answer
48 views

Looking for suggestions on how to proceed with showing that:

for $x \ge 2863:$ $$\ln\left(\left\lfloor\frac{x}{6}\right\rfloor!\right) < \sum_{k=5}^{\infty}-\mu(k)\ln\left(\left\lfloor\frac{x}{k}\right\rfloor!\right)$$ I've written a java application which ...
17
votes
1answer
308 views

$x^3-3x-3=0$, prove that $10^x<127$

$x$ is the real root of the equation $$3x^3-5x+8=0,\tag 1$$ prove that $$e^x>\frac{40}{237}.$$ I find this inequality in a very accidental way,I think it's very difficult,because the actual value ...
0
votes
0answers
80 views

Using Stirling's Formula to approximate a difference of logarithms of factorials in the same way as Jitsuro Nagura.

In Jitsuro Nagura's classic proof of a prime existing between $x$ and $\frac{6x}{5}$, he uses Stirling's formula to show that: $$T\left(x\right) - T\left(\frac{x}{2}\right) - ...
0
votes
0answers
53 views

Do these inequalities regarding the gamma function and factorials work?

I am seeing if it is possible to generalize lemma 1 in Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$. In a previous question, I asked whether the following inequality is ...
2
votes
0answers
60 views

Trying to generalize an inequality from Jitsuro Nagura: Does this work?

I am investigating the generality of Lemma 1 in Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$. In Lemma 1, Nagura establishes when $n > 1$, $x \ge 1$: ...
0
votes
1answer
64 views

How do you evaluate an inequality that involves logarithms of factorials?

For $x > 1$, $n > 2$ with $2 \mid x+1$ and $n \mid x+1$, does it then follow that: $$\log(\lfloor\frac{x}{2}\rfloor!) - \log(\lfloor\frac{x}{n}\rfloor!) \le \log(\lfloor\frac{x+1}{2}\rfloor!) - ...
52
votes
4answers
2k views

Prove $\left(\dfrac{2}{5}\right)^{\frac{2}{5}}<\ln{2}$

Inadvertently, I find this interesting inequality,But this problem have nice solution? prove that $$\ln{2}>(\dfrac{2}{5})^{\frac{2}{5}}$$ This problem have nice solution? Thank you. ago,I find ...
5
votes
1answer
120 views

Understanding a famous proof by Jitsuro Nagura: Need help understanding one step in the main theorem

I am going through the proof by Jitsuro Nagura which shows that there is always a prime between $x$ and $\frac{6x}{5}$ where $x \ge 25$. Nagura uses the following definitions: $$\vartheta(x) = ...
8
votes
1answer
225 views

Is it possible to generalize Ramanujan's lower bound for factorials that he used in his proof of Bertrand's Postulate?

I am starting to feel more confident in my understanding of Ramanujan's proof of Bertrand's postulate. I hope that I am not getting overconfident. In particular, Ramanujan's does the following ...
1
vote
1answer
35 views

Sufficient conditions for an inequality with a log

I need to find sufficient conditions so that $x \geq \frac{1}{a-\ln{x}}$ for $a>1$ and $x > 0$. Is there a way to get a tight solution to the problem?