Solving $ 2< x^2 -[x]<5$ The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Integer solutions of nonhomogeneous linear inequalitiesHow to solve these inequalities?Extracting a function from set of inequalitiesSolve the following quadratic inequalities by graphing the corresponding functionHow to solve inequalities with one variable by number lineQuadratic formula in double inequalitiesHow can I prove these inequalities involving PGF?Equality involving greatest integerSolution of a system of quadratic inequalitiesAn inequality involving irrational numbers
Separating matrix elements by lines
My body leaves; my core can stay
Identify 80s or 90s comics with ripped creatures (not dwarves)
Is every episode of "Where are my Pants?" identical?
Why can't devices on different VLANs, but on the same subnet, communicate?
Do warforged have souls?
How to type a long/em dash `—`
Can the Right Ascension and Argument of Perigee of a spacecraft's orbit keep varying by themselves with time?
How to read αἱμύλιος or when to aspirate
What's the point in a preamp?
Are spiders unable to hurt humans, especially very small spiders?
Match Roman Numerals
Why are there uneven bright areas in this photo of black hole?
Can I visit the Trinity College (Cambridge) library and see some of their rare books
Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?
Sort list of array linked objects by keys and values
Is it ethical to upload a automatically generated paper to a non peer-reviewed site as part of a larger research?
What is the role of 'For' here?
Homework question about an engine pulling a train
How do I design a circuit to convert a 100 mV and 50 Hz sine wave to a square wave?
Does Parliament hold absolute power in the UK?
Do I have Disadvantage attacking with an off-hand weapon?
What is the padding with red substance inside of steak packaging?
Working through the single responsibility principle (SRP) in Python when calls are expensive
Solving $ 2
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Integer solutions of nonhomogeneous linear inequalitiesHow to solve these inequalities?Extracting a function from set of inequalitiesSolve the following quadratic inequalities by graphing the corresponding functionHow to solve inequalities with one variable by number lineQuadratic formula in double inequalitiesHow can I prove these inequalities involving PGF?Equality involving greatest integerSolution of a system of quadratic inequalitiesAn inequality involving irrational numbers
$begingroup$
How to solve inequalities in which we have quadratic terms and greatest integer function.
$$ 2< x^2 -[x]<5$$.
[.] is greatest integer function.
Do we need to break into the cases as [0,1), [1,2) and so on?
functions inequality ceiling-function
$endgroup$
add a comment |
$begingroup$
How to solve inequalities in which we have quadratic terms and greatest integer function.
$$ 2< x^2 -[x]<5$$.
[.] is greatest integer function.
Do we need to break into the cases as [0,1), [1,2) and so on?
functions inequality ceiling-function
$endgroup$
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago
add a comment |
$begingroup$
How to solve inequalities in which we have quadratic terms and greatest integer function.
$$ 2< x^2 -[x]<5$$.
[.] is greatest integer function.
Do we need to break into the cases as [0,1), [1,2) and so on?
functions inequality ceiling-function
$endgroup$
How to solve inequalities in which we have quadratic terms and greatest integer function.
$$ 2< x^2 -[x]<5$$.
[.] is greatest integer function.
Do we need to break into the cases as [0,1), [1,2) and so on?
functions inequality ceiling-function
functions inequality ceiling-function
edited 3 mins ago
YuiTo Cheng
2,4064937
2,4064937
asked 1 hour ago
mavericmaveric
91912
91912
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago
add a comment |
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Hint: use $$x-1<[x]leq x$$ and then solve some quadratic inequalites like
$$ x^2-5<[x] implies x^2-5<ximplies x^2-x-6<0$$
so $xin (-2,3)$ and so on...
- If $xin (-2,-1)$ then $[x]=-2 $ so $0<x^2<3$ so $-sqrt3<x<sqrt3$ so $xin(-sqrt3,-1)$
- If $xin [-1,0)$ ...
$endgroup$
add a comment |
$begingroup$
While breaking up into integer intervals always works, sometimes it is too much work.
Let's say you instead had $$
213 < x^2 - lfloor x rfloor < 505 $$
You really don't want to consider $24$ cases individually.
So you get clever and change this to a pair of simultaneous inequalities: Let $x = n + y$ with $n in Bbb Z$ and $0 leq y < 1$. Then the inequalities are
$$
left{ beginarrayl 213 < (n+y)^2 - n < 505 \ 0 leq y < 1 endarray right.
$$
Then $$213 < n^2 + (2y-1)n +y^2 , 0 leq y < 1 implies 213 < n^2 + (1)n + 1
$$
and this shows that $n geq 15$ (you can get that with one application of the quadratic formula), cutting out a lot of the work. Similarly,
$$ n^2 + (2y-1)n +y^2 < 505 , 0 leq y < 1 implies n^2 + (-1)n + 0 < 505
$$
and this shows that $n < 23$.
Finally, you can also justify only examining the allowed values of $y$ in the boundary cases ($n = 15$ and $n = 22$); in between, any value of $y$ works. (This might not be the case for cubic expressions, for example.)
So for example, on the low end, you would need to solve for $y$ in
$$
213 < (15+y)^2 - 15 = 210 - 30 y + y^2 \
y^2 -30 y -3 > 0\
y > frac12( sqrt912 -30 ) \
x > (sqrt228 - 15) + 15 implies x > sqrt228
$$
and similarly you need to consider the case of $n=22$ to get the upper limit for $x$.
$endgroup$
add a comment |
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%2f3185867%2fsolving-2-x2-x5%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hint: use $$x-1<[x]leq x$$ and then solve some quadratic inequalites like
$$ x^2-5<[x] implies x^2-5<ximplies x^2-x-6<0$$
so $xin (-2,3)$ and so on...
- If $xin (-2,-1)$ then $[x]=-2 $ so $0<x^2<3$ so $-sqrt3<x<sqrt3$ so $xin(-sqrt3,-1)$
- If $xin [-1,0)$ ...
$endgroup$
add a comment |
$begingroup$
Hint: use $$x-1<[x]leq x$$ and then solve some quadratic inequalites like
$$ x^2-5<[x] implies x^2-5<ximplies x^2-x-6<0$$
so $xin (-2,3)$ and so on...
- If $xin (-2,-1)$ then $[x]=-2 $ so $0<x^2<3$ so $-sqrt3<x<sqrt3$ so $xin(-sqrt3,-1)$
- If $xin [-1,0)$ ...
$endgroup$
add a comment |
$begingroup$
Hint: use $$x-1<[x]leq x$$ and then solve some quadratic inequalites like
$$ x^2-5<[x] implies x^2-5<ximplies x^2-x-6<0$$
so $xin (-2,3)$ and so on...
- If $xin (-2,-1)$ then $[x]=-2 $ so $0<x^2<3$ so $-sqrt3<x<sqrt3$ so $xin(-sqrt3,-1)$
- If $xin [-1,0)$ ...
$endgroup$
Hint: use $$x-1<[x]leq x$$ and then solve some quadratic inequalites like
$$ x^2-5<[x] implies x^2-5<ximplies x^2-x-6<0$$
so $xin (-2,3)$ and so on...
- If $xin (-2,-1)$ then $[x]=-2 $ so $0<x^2<3$ so $-sqrt3<x<sqrt3$ so $xin(-sqrt3,-1)$
- If $xin [-1,0)$ ...
edited 27 mins ago
answered 35 mins ago
Maria MazurMaria Mazur
49.9k1361125
49.9k1361125
add a comment |
add a comment |
$begingroup$
While breaking up into integer intervals always works, sometimes it is too much work.
Let's say you instead had $$
213 < x^2 - lfloor x rfloor < 505 $$
You really don't want to consider $24$ cases individually.
So you get clever and change this to a pair of simultaneous inequalities: Let $x = n + y$ with $n in Bbb Z$ and $0 leq y < 1$. Then the inequalities are
$$
left{ beginarrayl 213 < (n+y)^2 - n < 505 \ 0 leq y < 1 endarray right.
$$
Then $$213 < n^2 + (2y-1)n +y^2 , 0 leq y < 1 implies 213 < n^2 + (1)n + 1
$$
and this shows that $n geq 15$ (you can get that with one application of the quadratic formula), cutting out a lot of the work. Similarly,
$$ n^2 + (2y-1)n +y^2 < 505 , 0 leq y < 1 implies n^2 + (-1)n + 0 < 505
$$
and this shows that $n < 23$.
Finally, you can also justify only examining the allowed values of $y$ in the boundary cases ($n = 15$ and $n = 22$); in between, any value of $y$ works. (This might not be the case for cubic expressions, for example.)
So for example, on the low end, you would need to solve for $y$ in
$$
213 < (15+y)^2 - 15 = 210 - 30 y + y^2 \
y^2 -30 y -3 > 0\
y > frac12( sqrt912 -30 ) \
x > (sqrt228 - 15) + 15 implies x > sqrt228
$$
and similarly you need to consider the case of $n=22$ to get the upper limit for $x$.
$endgroup$
add a comment |
$begingroup$
While breaking up into integer intervals always works, sometimes it is too much work.
Let's say you instead had $$
213 < x^2 - lfloor x rfloor < 505 $$
You really don't want to consider $24$ cases individually.
So you get clever and change this to a pair of simultaneous inequalities: Let $x = n + y$ with $n in Bbb Z$ and $0 leq y < 1$. Then the inequalities are
$$
left{ beginarrayl 213 < (n+y)^2 - n < 505 \ 0 leq y < 1 endarray right.
$$
Then $$213 < n^2 + (2y-1)n +y^2 , 0 leq y < 1 implies 213 < n^2 + (1)n + 1
$$
and this shows that $n geq 15$ (you can get that with one application of the quadratic formula), cutting out a lot of the work. Similarly,
$$ n^2 + (2y-1)n +y^2 < 505 , 0 leq y < 1 implies n^2 + (-1)n + 0 < 505
$$
and this shows that $n < 23$.
Finally, you can also justify only examining the allowed values of $y$ in the boundary cases ($n = 15$ and $n = 22$); in between, any value of $y$ works. (This might not be the case for cubic expressions, for example.)
So for example, on the low end, you would need to solve for $y$ in
$$
213 < (15+y)^2 - 15 = 210 - 30 y + y^2 \
y^2 -30 y -3 > 0\
y > frac12( sqrt912 -30 ) \
x > (sqrt228 - 15) + 15 implies x > sqrt228
$$
and similarly you need to consider the case of $n=22$ to get the upper limit for $x$.
$endgroup$
add a comment |
$begingroup$
While breaking up into integer intervals always works, sometimes it is too much work.
Let's say you instead had $$
213 < x^2 - lfloor x rfloor < 505 $$
You really don't want to consider $24$ cases individually.
So you get clever and change this to a pair of simultaneous inequalities: Let $x = n + y$ with $n in Bbb Z$ and $0 leq y < 1$. Then the inequalities are
$$
left{ beginarrayl 213 < (n+y)^2 - n < 505 \ 0 leq y < 1 endarray right.
$$
Then $$213 < n^2 + (2y-1)n +y^2 , 0 leq y < 1 implies 213 < n^2 + (1)n + 1
$$
and this shows that $n geq 15$ (you can get that with one application of the quadratic formula), cutting out a lot of the work. Similarly,
$$ n^2 + (2y-1)n +y^2 < 505 , 0 leq y < 1 implies n^2 + (-1)n + 0 < 505
$$
and this shows that $n < 23$.
Finally, you can also justify only examining the allowed values of $y$ in the boundary cases ($n = 15$ and $n = 22$); in between, any value of $y$ works. (This might not be the case for cubic expressions, for example.)
So for example, on the low end, you would need to solve for $y$ in
$$
213 < (15+y)^2 - 15 = 210 - 30 y + y^2 \
y^2 -30 y -3 > 0\
y > frac12( sqrt912 -30 ) \
x > (sqrt228 - 15) + 15 implies x > sqrt228
$$
and similarly you need to consider the case of $n=22$ to get the upper limit for $x$.
$endgroup$
While breaking up into integer intervals always works, sometimes it is too much work.
Let's say you instead had $$
213 < x^2 - lfloor x rfloor < 505 $$
You really don't want to consider $24$ cases individually.
So you get clever and change this to a pair of simultaneous inequalities: Let $x = n + y$ with $n in Bbb Z$ and $0 leq y < 1$. Then the inequalities are
$$
left{ beginarrayl 213 < (n+y)^2 - n < 505 \ 0 leq y < 1 endarray right.
$$
Then $$213 < n^2 + (2y-1)n +y^2 , 0 leq y < 1 implies 213 < n^2 + (1)n + 1
$$
and this shows that $n geq 15$ (you can get that with one application of the quadratic formula), cutting out a lot of the work. Similarly,
$$ n^2 + (2y-1)n +y^2 < 505 , 0 leq y < 1 implies n^2 + (-1)n + 0 < 505
$$
and this shows that $n < 23$.
Finally, you can also justify only examining the allowed values of $y$ in the boundary cases ($n = 15$ and $n = 22$); in between, any value of $y$ works. (This might not be the case for cubic expressions, for example.)
So for example, on the low end, you would need to solve for $y$ in
$$
213 < (15+y)^2 - 15 = 210 - 30 y + y^2 \
y^2 -30 y -3 > 0\
y > frac12( sqrt912 -30 ) \
x > (sqrt228 - 15) + 15 implies x > sqrt228
$$
and similarly you need to consider the case of $n=22$ to get the upper limit for $x$.
answered 34 mins ago
Mark FischlerMark Fischler
34.1k12552
34.1k12552
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%2f3185867%2fsolving-2-x2-x5%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
$begingroup$
Yes, that is exactly what you have to do.
$endgroup$
– Kavi Rama Murthy
1 hour ago