Prove a strong inequality $sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2-frac{7ln 2}{8ln...

What is the topology associated with the algebras for the ultrafilter monad?

Selecting user stories during sprint planning

What's the meaning of "fortified infraction restraint"?

Is it possible for SQL statements to execute concurrently within a single session in SQL Server?

How to play a character with a disability or mental disorder without being offensive?

Question about debouncing - delay of state change

How does Python know the values already stored in its memory?

Crossing US/Canada Border for less than 24 hours

Is it fair for a professor to grade us on the possession of past papers?

Is a ledger board required if the side of my house is wood?

A term for a woman complaining about things/begging in a cute/childish way

Why do we bend a book to keep it straight?

Converted a Scalar function to a TVF function for parallel execution-Still running in Serial mode

How fail-safe is nr as stop bytes?

When a candle burns, why does the top of wick glow if bottom of flame is hottest?

Most bit efficient text communication method?

Why should I vote and accept answers?

How to react to hostile behavior from a senior developer?

Trademark violation for app?

What would you call this weird metallic apparatus that allows you to lift people?

Do wooden building fires get hotter than 600°C?

Effects on objects due to a brief relocation of massive amounts of mass

Project Euler #1 in C++

Can anything be seen from the center of the Boötes void? How dark would it be?



Prove a strong inequality $sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2-frac{7ln 2}{8ln n}right)sum_{k=1}^nfrac 1{a_k}$



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Stronger version of AMM problem 11145 (April 2005)?A version of Hardy's inequality involving reciprocals.Prove that $sum_{k=1}^n frac{2k+1}{a_1+a_2+…+a_k}<4sum_{k=1}^nfrac1{a_k}.$$a_n > 0$ and $sum_limits{n=1}^{+infty} frac{1}{a_n}$ converges. Prove $sum_limits{n=1}^{+infty} frac{n}{a_1 + cdots + a_n}$ is convergent.Prove that $sum_{k=1}^n frac{2k+1}{a_1+a_2+…+a_k}<4sum_{k=1}^nfrac1{a_k}.$Prove that $frac{a_1^2}{a_1+a_2}+frac{a_2^2}{a_2+a_3}+ cdots frac{a_n^2}{a_n+a_1} geq frac12$Prove $left | sum_{k=1}^{n} a_k right | leqsum_{k=1}^{n} left | a_k right |$Prove:$forall a_1,b_1,a_2,b_2: left|max(a_1,b_1) - max(a_2,b_2)right| le max(left|a_1-a_2right|, left| b_1-b_2 right|) $Prove $sum_{k=1}^nfrac{(b_1+b_2+cdots+b_k)b_k}{a_1+a_2+cdots+a_k}<2sum_{i=1}^nfrac{b_i^2}{a_i}$Ways to prove $sum_{A_k}^n sum_{A_{k-1}}^{A_k} sum_{A_{k-2}}^{A_{k-1}} cdots sum_{A_1}^{A_2} A_1 = {n+k choose k+1}$Prove that $min{left(frac{a_1}{b_1},frac{a_2}{b_2}right)}leqfrac{a_1+a_2}{b_1+b_2}leqmax{left(frac{a_1}{b_1},frac{a_2}{b_2}right)}$The inequality $leftlceilfrac{a_1+dots+a_k}krightrceilleleftlceilfrac{a_1}krightrceil+dots+leftlceilfrac{a_k}krightrceil$How prove this inequality $H(a_1)+H(a_2)+cdots+H(a_m)leq Csqrt{sum_{i=1}^{m}i a_i}$Showing that $a^2+b^2+c^2+d^2+e^2+65=abcde$ has integer solutions greater than $2018$?












17












$begingroup$



For $a_i>0$ ($i=1,2,dots,n$), $nge 3$, prove that
$$sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2color{red}{-frac{7ln 2}{8ln n}}right)sum_{k=1}^nfrac 1{a_k}.$$




The case without $color{red}{-dfrac{7ln 2}{8ln n}}$ could be shown here. I have no idea how the $color{red}{text{red}}$ term comes from.



Note: This question should not be closed although there was a duplicated question $4$ years ago (see here). Duplicate of unanswered question suggests that if there is no accepted answer in the old question, the new question can stay open in the hope of attracting an answer.



The question comes from the Chinese Mathematical Olympiad training team and there is no answer provided.



Source:




  • See Q.25 here (one of the official accounts that provides Chinese MO questions on January $23^{rm rd}$, $2018$)

  • It has also appeared here (A blog from the person who set this question on December $17^{rm th}$, $2013$).










share|cite|improve this question











$endgroup$












  • $begingroup$
    This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
    $endgroup$
    – tatan
    Oct 22 '18 at 14:10










  • $begingroup$
    See question #25 here. The question first appeared here from the same person.
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:42












  • $begingroup$
    Edit your question and add these to your main question body, please ;-)
    $endgroup$
    – tatan
    Oct 22 '18 at 14:43










  • $begingroup$
    I have edited your question. Do include source in your future questions.
    $endgroup$
    – tatan
    Oct 22 '18 at 14:46












  • $begingroup$
    @tatan Thanks for editing
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:58
















17












$begingroup$



For $a_i>0$ ($i=1,2,dots,n$), $nge 3$, prove that
$$sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2color{red}{-frac{7ln 2}{8ln n}}right)sum_{k=1}^nfrac 1{a_k}.$$




The case without $color{red}{-dfrac{7ln 2}{8ln n}}$ could be shown here. I have no idea how the $color{red}{text{red}}$ term comes from.



Note: This question should not be closed although there was a duplicated question $4$ years ago (see here). Duplicate of unanswered question suggests that if there is no accepted answer in the old question, the new question can stay open in the hope of attracting an answer.



The question comes from the Chinese Mathematical Olympiad training team and there is no answer provided.



Source:




  • See Q.25 here (one of the official accounts that provides Chinese MO questions on January $23^{rm rd}$, $2018$)

  • It has also appeared here (A blog from the person who set this question on December $17^{rm th}$, $2013$).










share|cite|improve this question











$endgroup$












  • $begingroup$
    This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
    $endgroup$
    – tatan
    Oct 22 '18 at 14:10










  • $begingroup$
    See question #25 here. The question first appeared here from the same person.
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:42












  • $begingroup$
    Edit your question and add these to your main question body, please ;-)
    $endgroup$
    – tatan
    Oct 22 '18 at 14:43










  • $begingroup$
    I have edited your question. Do include source in your future questions.
    $endgroup$
    – tatan
    Oct 22 '18 at 14:46












  • $begingroup$
    @tatan Thanks for editing
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:58














17












17








17


12



$begingroup$



For $a_i>0$ ($i=1,2,dots,n$), $nge 3$, prove that
$$sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2color{red}{-frac{7ln 2}{8ln n}}right)sum_{k=1}^nfrac 1{a_k}.$$




The case without $color{red}{-dfrac{7ln 2}{8ln n}}$ could be shown here. I have no idea how the $color{red}{text{red}}$ term comes from.



Note: This question should not be closed although there was a duplicated question $4$ years ago (see here). Duplicate of unanswered question suggests that if there is no accepted answer in the old question, the new question can stay open in the hope of attracting an answer.



The question comes from the Chinese Mathematical Olympiad training team and there is no answer provided.



Source:




  • See Q.25 here (one of the official accounts that provides Chinese MO questions on January $23^{rm rd}$, $2018$)

  • It has also appeared here (A blog from the person who set this question on December $17^{rm th}$, $2013$).










share|cite|improve this question











$endgroup$





For $a_i>0$ ($i=1,2,dots,n$), $nge 3$, prove that
$$sum_{k=1}^nfrac{k}{a_1+a_2+cdots+a_k}leleft(2color{red}{-frac{7ln 2}{8ln n}}right)sum_{k=1}^nfrac 1{a_k}.$$




The case without $color{red}{-dfrac{7ln 2}{8ln n}}$ could be shown here. I have no idea how the $color{red}{text{red}}$ term comes from.



Note: This question should not be closed although there was a duplicated question $4$ years ago (see here). Duplicate of unanswered question suggests that if there is no accepted answer in the old question, the new question can stay open in the hope of attracting an answer.



The question comes from the Chinese Mathematical Olympiad training team and there is no answer provided.



Source:




  • See Q.25 here (one of the official accounts that provides Chinese MO questions on January $23^{rm rd}$, $2018$)

  • It has also appeared here (A blog from the person who set this question on December $17^{rm th}$, $2013$).







real-analysis inequality summation logarithms contest-math






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Oct 23 '18 at 0:47







Tianlalu

















asked Oct 12 '18 at 6:53









TianlaluTianlalu

3,29521238




3,29521238












  • $begingroup$
    This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
    $endgroup$
    – tatan
    Oct 22 '18 at 14:10










  • $begingroup$
    See question #25 here. The question first appeared here from the same person.
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:42












  • $begingroup$
    Edit your question and add these to your main question body, please ;-)
    $endgroup$
    – tatan
    Oct 22 '18 at 14:43










  • $begingroup$
    I have edited your question. Do include source in your future questions.
    $endgroup$
    – tatan
    Oct 22 '18 at 14:46












  • $begingroup$
    @tatan Thanks for editing
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:58


















  • $begingroup$
    This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
    $endgroup$
    – tatan
    Oct 22 '18 at 14:10










  • $begingroup$
    See question #25 here. The question first appeared here from the same person.
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:42












  • $begingroup$
    Edit your question and add these to your main question body, please ;-)
    $endgroup$
    – tatan
    Oct 22 '18 at 14:43










  • $begingroup$
    I have edited your question. Do include source in your future questions.
    $endgroup$
    – tatan
    Oct 22 '18 at 14:46












  • $begingroup$
    @tatan Thanks for editing
    $endgroup$
    – Tianlalu
    Oct 22 '18 at 14:58
















$begingroup$
This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
$endgroup$
– tatan
Oct 22 '18 at 14:10




$begingroup$
This looks like a problem you have collected from / inspired by some source. According to recent discussions in Meta, we are looking forward to including sources for all applicable questions. Can you provide the source by editing the question?Refer-math.meta.stackexchange.com/questions/29290/…
$endgroup$
– tatan
Oct 22 '18 at 14:10












$begingroup$
See question #25 here. The question first appeared here from the same person.
$endgroup$
– Tianlalu
Oct 22 '18 at 14:42






$begingroup$
See question #25 here. The question first appeared here from the same person.
$endgroup$
– Tianlalu
Oct 22 '18 at 14:42














$begingroup$
Edit your question and add these to your main question body, please ;-)
$endgroup$
– tatan
Oct 22 '18 at 14:43




$begingroup$
Edit your question and add these to your main question body, please ;-)
$endgroup$
– tatan
Oct 22 '18 at 14:43












$begingroup$
I have edited your question. Do include source in your future questions.
$endgroup$
– tatan
Oct 22 '18 at 14:46






$begingroup$
I have edited your question. Do include source in your future questions.
$endgroup$
– tatan
Oct 22 '18 at 14:46














$begingroup$
@tatan Thanks for editing
$endgroup$
– Tianlalu
Oct 22 '18 at 14:58




$begingroup$
@tatan Thanks for editing
$endgroup$
– Tianlalu
Oct 22 '18 at 14:58










0






active

oldest

votes












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2952345%2fprove-a-strong-inequality-sum-k-1n-fracka-1a-2-cdotsa-k-le-left2-f%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2952345%2fprove-a-strong-inequality-sum-k-1n-fracka-1a-2-cdotsa-k-le-left2-f%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Nidaros erkebispedøme

Birsay

Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...