Find this inequality by finding the generalizating one too Announcing the arrival of Valued...
The following signatures were invalid: EXPKEYSIG 1397BC53640DB551
How is simplicity better than precision and clarity in prose?
Limit for e and 1/e
How to rotate it perfectly?
Area of a 2D convex hull
Problem when applying foreach loop
Need a suitable toxic chemical for a murder plot in my novel
How do I automatically answer y in bash script?
Slither Like a Snake
Can I add database to AWS RDS MySQL without creating new instance?
How can I make names more distinctive without making them longer?
Determine whether f is a function, an injection, a surjection
Why don't the Weasley twins use magic outside of school if the Trace can only find the location of spells cast?
What do you call the holes in a flute?
Why is there no army of Iron-Mans in the MCU?
Fishing simulator
What did Darwin mean by 'squib' here?
What do you call a plan that's an alternative plan in case your initial plan fails?
How do you clear the ApexPages.getMessages() collection in a test?
Why does tar appear to skip file contents when output file is /dev/null?
When communicating altitude with a '9' in it, should it be pronounced "nine hundred" or "niner hundred"?
Autumning in love
Working around an AWS network ACL rule limit
Is above average number of years spent on PhD considered a red flag in future academia or industry positions?
Find this inequality by finding the generalizating one too
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)find the min of this inequalityProve this inequality $a^4+b^4+c^4+9ge 4(a^2b+b^2c+c^2a)$How does this inequality imply this one?Proving inequality too simple?Strange inequality over the positive realsProve this inequality $3(abc+4)ge 5(ab+bc+ca)$prove this inequality by $abc=1$How to prove this inequality ???How to prove the given inequality using CS or AM GM HM inequalityto prove this inequality $sum a^3b+3ge 2(ab+bc+ca)$
$begingroup$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,8,]$$.$ Prove$:$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
By computer$,$ I have found the generalization of the above inequality $($If you are interested in$)$$:$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,text{k},]$$.$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
is true for $text{k}> 8$ and its largest value is the largest root of irreducible equation$:$
$$4,text{k}^{,17}- 52,text{k}^{,16}+ 192,text{k}^{,15}- 187,,text{k}^{,14}- 506,text{k}^{,13}- 567,,text{k}^{,12}- 3460,,text{k}^{,11}- 1552,text{k}^{,10}+ 4468,text{k}^{,9}+ 1430,text{k}^{,8}- 2812,text{k}^{,7}- 562,text{k}^{,6}+ 728,text{k}^{,5}- 28,text{k}^{,4}- 156,text{k}^{,3}- 19,text{k}^{,2}+ 6,text{k}+ 1= 0$$
My hard work is substituting $a= frac{x}{y},,b= frac{x}{z}$ $($Suppose $x= max{,x,,y,,z,}$$)$$.$ We will have$:$
$$f(,a,,b,)= a+ frac{b}{a}+ frac{1}{b}- frac{2,ab}{a+ b}- frac{2,b}{ab+ a}- frac{2,a}{ab+ b}geqq 0$$
then$:$
$$f(,a,,8,)= a+ frac{8}{a}+ frac{1}{b}- frac{16,a}{a+ 8}- frac{16}{9,a}- frac{2,a}{8,a+ 8}$$
We have$:$
$$f(,a,,8,)geqq f(,1,,8,)$$
So I tried$:$ $f(,a,,b,)- f(,a,,8,)= (,8- a,),g(,a,,b,)$$,$ then I continued $g(,a,,b,)- g(,a,,8,)$$,$$...$$,$ but $n(,1,,8,)leqq 0$$.$ So I can$'$t continue doing it$!$ Can you try to solve my own$?$ Thanks for your interest$!$
inequality substitution constants uvw buffalo-way
$endgroup$
add a comment |
$begingroup$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,8,]$$.$ Prove$:$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
By computer$,$ I have found the generalization of the above inequality $($If you are interested in$)$$:$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,text{k},]$$.$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
is true for $text{k}> 8$ and its largest value is the largest root of irreducible equation$:$
$$4,text{k}^{,17}- 52,text{k}^{,16}+ 192,text{k}^{,15}- 187,,text{k}^{,14}- 506,text{k}^{,13}- 567,,text{k}^{,12}- 3460,,text{k}^{,11}- 1552,text{k}^{,10}+ 4468,text{k}^{,9}+ 1430,text{k}^{,8}- 2812,text{k}^{,7}- 562,text{k}^{,6}+ 728,text{k}^{,5}- 28,text{k}^{,4}- 156,text{k}^{,3}- 19,text{k}^{,2}+ 6,text{k}+ 1= 0$$
My hard work is substituting $a= frac{x}{y},,b= frac{x}{z}$ $($Suppose $x= max{,x,,y,,z,}$$)$$.$ We will have$:$
$$f(,a,,b,)= a+ frac{b}{a}+ frac{1}{b}- frac{2,ab}{a+ b}- frac{2,b}{ab+ a}- frac{2,a}{ab+ b}geqq 0$$
then$:$
$$f(,a,,8,)= a+ frac{8}{a}+ frac{1}{b}- frac{16,a}{a+ 8}- frac{16}{9,a}- frac{2,a}{8,a+ 8}$$
We have$:$
$$f(,a,,8,)geqq f(,1,,8,)$$
So I tried$:$ $f(,a,,b,)- f(,a,,8,)= (,8- a,),g(,a,,b,)$$,$ then I continued $g(,a,,b,)- g(,a,,8,)$$,$$...$$,$ but $n(,1,,8,)leqq 0$$.$ So I can$'$t continue doing it$!$ Can you try to solve my own$?$ Thanks for your interest$!$
inequality substitution constants uvw buffalo-way
$endgroup$
1
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44
add a comment |
$begingroup$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,8,]$$.$ Prove$:$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
By computer$,$ I have found the generalization of the above inequality $($If you are interested in$)$$:$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,text{k},]$$.$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
is true for $text{k}> 8$ and its largest value is the largest root of irreducible equation$:$
$$4,text{k}^{,17}- 52,text{k}^{,16}+ 192,text{k}^{,15}- 187,,text{k}^{,14}- 506,text{k}^{,13}- 567,,text{k}^{,12}- 3460,,text{k}^{,11}- 1552,text{k}^{,10}+ 4468,text{k}^{,9}+ 1430,text{k}^{,8}- 2812,text{k}^{,7}- 562,text{k}^{,6}+ 728,text{k}^{,5}- 28,text{k}^{,4}- 156,text{k}^{,3}- 19,text{k}^{,2}+ 6,text{k}+ 1= 0$$
My hard work is substituting $a= frac{x}{y},,b= frac{x}{z}$ $($Suppose $x= max{,x,,y,,z,}$$)$$.$ We will have$:$
$$f(,a,,b,)= a+ frac{b}{a}+ frac{1}{b}- frac{2,ab}{a+ b}- frac{2,b}{ab+ a}- frac{2,a}{ab+ b}geqq 0$$
then$:$
$$f(,a,,8,)= a+ frac{8}{a}+ frac{1}{b}- frac{16,a}{a+ 8}- frac{16}{9,a}- frac{2,a}{8,a+ 8}$$
We have$:$
$$f(,a,,8,)geqq f(,1,,8,)$$
So I tried$:$ $f(,a,,b,)- f(,a,,8,)= (,8- a,),g(,a,,b,)$$,$ then I continued $g(,a,,b,)- g(,a,,8,)$$,$$...$$,$ but $n(,1,,8,)leqq 0$$.$ So I can$'$t continue doing it$!$ Can you try to solve my own$?$ Thanks for your interest$!$
inequality substitution constants uvw buffalo-way
$endgroup$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,8,]$$.$ Prove$:$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
By computer$,$ I have found the generalization of the above inequality $($If you are interested in$)$$:$
Given $x,,y,,z$ such that $x,,y,,zin [,1,,text{k},]$$.$
$$frac{x}{y}+ frac{y}{z}+ frac{z}{x}geqq frac{2,x}{y+ z}+ frac{2,y}{z+ x}+ frac{2,z}{x+ y}$$
is true for $text{k}> 8$ and its largest value is the largest root of irreducible equation$:$
$$4,text{k}^{,17}- 52,text{k}^{,16}+ 192,text{k}^{,15}- 187,,text{k}^{,14}- 506,text{k}^{,13}- 567,,text{k}^{,12}- 3460,,text{k}^{,11}- 1552,text{k}^{,10}+ 4468,text{k}^{,9}+ 1430,text{k}^{,8}- 2812,text{k}^{,7}- 562,text{k}^{,6}+ 728,text{k}^{,5}- 28,text{k}^{,4}- 156,text{k}^{,3}- 19,text{k}^{,2}+ 6,text{k}+ 1= 0$$
My hard work is substituting $a= frac{x}{y},,b= frac{x}{z}$ $($Suppose $x= max{,x,,y,,z,}$$)$$.$ We will have$:$
$$f(,a,,b,)= a+ frac{b}{a}+ frac{1}{b}- frac{2,ab}{a+ b}- frac{2,b}{ab+ a}- frac{2,a}{ab+ b}geqq 0$$
then$:$
$$f(,a,,8,)= a+ frac{8}{a}+ frac{1}{b}- frac{16,a}{a+ 8}- frac{16}{9,a}- frac{2,a}{8,a+ 8}$$
We have$:$
$$f(,a,,8,)geqq f(,1,,8,)$$
So I tried$:$ $f(,a,,b,)- f(,a,,8,)= (,8- a,),g(,a,,b,)$$,$ then I continued $g(,a,,b,)- g(,a,,8,)$$,$$...$$,$ but $n(,1,,8,)leqq 0$$.$ So I can$'$t continue doing it$!$ Can you try to solve my own$?$ Thanks for your interest$!$
inequality substitution constants uvw buffalo-way
inequality substitution constants uvw buffalo-way
edited Mar 25 at 23:17
HaiDangel
asked Mar 23 at 12:09
HaiDangelHaiDangel
967
967
1
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44
add a comment |
1
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44
1
1
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3159240%2ffind-this-inequality-by-finding-the-generalizating-one-too%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
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3159240%2ffind-this-inequality-by-finding-the-generalizating-one-too%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
1
$begingroup$
These inequalities have no suprema, which would reduce your equation. You are proving the tangent lie group SU(2), which are reducing will heirarch these rationals under an infinum integer resolved by k.
$endgroup$
– Cppg
Mar 23 at 20:44