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












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,28521238




3,28521238












  • $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.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

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

Willebadessen

Ida-Boy-Ed-Garten

Residenzschloss Arolsen