Tuesday, April 17, 2018

algebra precalculus - Method to solve |x|+|2x|leqx+1


Even if it seems really easy, I'm struggling to solve |x|+|2x|x+1.


The book says that x[1,3].



I first rewrote as x+(2x)x+1 with x0 and x(2x)x+1 with x<0. Then I solved.


For the first, I got 1x and for the 2nd, 3x


x]3;0[[1;+[


It is maybe a very stupid question, but I can't see what I did wrong? Thanks for your help.


Answer



There are 3 cases:


a) x0 (quite useless, because it generates a bright lower bound):


|x|+|2x|x+1x+2xx+1 3x1 3x1 x13


b) $0

|x|+|2x|x+1x+2xx+1 x1



c) x>2:


|x|+|2x|x+1x+x2x+1 2xx+3x3


Now, you know the lower bound of x, from case b, xmin=1, and you know the upper bound of x from case c, xmax=3. Therefore, 1x3x[1;3]


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...