Combinatorics: Prove that $x, y, z$ exist such that $frac {1}{2} leq frac {x^2}{yz} leq 2$
$begingroup$
Suppose we have a subset of $2n-1$ numbers from the set ${1, 2, 3, ..., 2^n-2}$. Prove that there exits $x, y, z$ such that $frac {1}{2} leq frac {x^2}{yz} leq 2$
I'm fairly new to this topic, and i honestly have no idea how to prove this. Any hint on how can i start the proof?
Thanks in advance.
combinatorics pigeonhole-principle
$endgroup$
add a comment |
$begingroup$
Suppose we have a subset of $2n-1$ numbers from the set ${1, 2, 3, ..., 2^n-2}$. Prove that there exits $x, y, z$ such that $frac {1}{2} leq frac {x^2}{yz} leq 2$
I'm fairly new to this topic, and i honestly have no idea how to prove this. Any hint on how can i start the proof?
Thanks in advance.
combinatorics pigeonhole-principle
$endgroup$
2
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03
add a comment |
$begingroup$
Suppose we have a subset of $2n-1$ numbers from the set ${1, 2, 3, ..., 2^n-2}$. Prove that there exits $x, y, z$ such that $frac {1}{2} leq frac {x^2}{yz} leq 2$
I'm fairly new to this topic, and i honestly have no idea how to prove this. Any hint on how can i start the proof?
Thanks in advance.
combinatorics pigeonhole-principle
$endgroup$
Suppose we have a subset of $2n-1$ numbers from the set ${1, 2, 3, ..., 2^n-2}$. Prove that there exits $x, y, z$ such that $frac {1}{2} leq frac {x^2}{yz} leq 2$
I'm fairly new to this topic, and i honestly have no idea how to prove this. Any hint on how can i start the proof?
Thanks in advance.
combinatorics pigeonhole-principle
combinatorics pigeonhole-principle
asked Dec 19 '18 at 2:44
AnthonyAnthony
324
324
2
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03
add a comment |
2
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03
2
2
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
HINT.- Consider the rational function $f(X)=dfrac{(X-2)^2}{(X-3)(X-4)}$.
It is easy to prove that $$begin{cases}f(X)le2text{ when } Xgt7\f(X)gedfrac12text{ when } Xgt5end{cases}$$
Making now $X=2^x$ the inequalities above prove that for $nge3$ (in which case $Xge8$) a solution is given by
$$x=2^n-2\y=2^n-3\z=2^n-4$$ It remains to solve the values $n=1$ and $n=2$ in which cases $(x,y,z)=(1,1,1),(1,1,2)$ are trivial solutions.
$endgroup$
add a comment |
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
});
}
});
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%2f3045925%2fcombinatorics-prove-that-x-y-z-exist-such-that-frac-12-leq-frac-x%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
HINT.- Consider the rational function $f(X)=dfrac{(X-2)^2}{(X-3)(X-4)}$.
It is easy to prove that $$begin{cases}f(X)le2text{ when } Xgt7\f(X)gedfrac12text{ when } Xgt5end{cases}$$
Making now $X=2^x$ the inequalities above prove that for $nge3$ (in which case $Xge8$) a solution is given by
$$x=2^n-2\y=2^n-3\z=2^n-4$$ It remains to solve the values $n=1$ and $n=2$ in which cases $(x,y,z)=(1,1,1),(1,1,2)$ are trivial solutions.
$endgroup$
add a comment |
$begingroup$
HINT.- Consider the rational function $f(X)=dfrac{(X-2)^2}{(X-3)(X-4)}$.
It is easy to prove that $$begin{cases}f(X)le2text{ when } Xgt7\f(X)gedfrac12text{ when } Xgt5end{cases}$$
Making now $X=2^x$ the inequalities above prove that for $nge3$ (in which case $Xge8$) a solution is given by
$$x=2^n-2\y=2^n-3\z=2^n-4$$ It remains to solve the values $n=1$ and $n=2$ in which cases $(x,y,z)=(1,1,1),(1,1,2)$ are trivial solutions.
$endgroup$
add a comment |
$begingroup$
HINT.- Consider the rational function $f(X)=dfrac{(X-2)^2}{(X-3)(X-4)}$.
It is easy to prove that $$begin{cases}f(X)le2text{ when } Xgt7\f(X)gedfrac12text{ when } Xgt5end{cases}$$
Making now $X=2^x$ the inequalities above prove that for $nge3$ (in which case $Xge8$) a solution is given by
$$x=2^n-2\y=2^n-3\z=2^n-4$$ It remains to solve the values $n=1$ and $n=2$ in which cases $(x,y,z)=(1,1,1),(1,1,2)$ are trivial solutions.
$endgroup$
HINT.- Consider the rational function $f(X)=dfrac{(X-2)^2}{(X-3)(X-4)}$.
It is easy to prove that $$begin{cases}f(X)le2text{ when } Xgt7\f(X)gedfrac12text{ when } Xgt5end{cases}$$
Making now $X=2^x$ the inequalities above prove that for $nge3$ (in which case $Xge8$) a solution is given by
$$x=2^n-2\y=2^n-3\z=2^n-4$$ It remains to solve the values $n=1$ and $n=2$ in which cases $(x,y,z)=(1,1,1),(1,1,2)$ are trivial solutions.
answered Dec 25 '18 at 22:49
PiquitoPiquito
18.1k31539
18.1k31539
add a comment |
add a comment |
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%2f3045925%2fcombinatorics-prove-that-x-y-z-exist-such-that-frac-12-leq-frac-x%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
2
$begingroup$
Divide the numbers into 123, 4567, 8 to 15, 16 to 31, etc and apply pidgeonhole principle.
$endgroup$
– didgogns
Dec 19 '18 at 2:49
$begingroup$
If the numbers don't have to be distinct, this is trivial.
$endgroup$
– Matt Samuel
Dec 19 '18 at 3:03