Ask your own question, for FREE!
Mathematics 17 Online
OpenStudy (anonymous):

how to prove if x>=0 and x<= c for all c>0, then x=0

OpenStudy (perl):

you can prove it by contradiction, suppose that x>=0 and x<= c for all c>0, *and* x is not equal to zero. so there are two cases, x > 0 (you get contradiction) and x < 0 , you get contradiction

OpenStudy (anonymous):

couldn't be the case that x is just equal to c ?

OpenStudy (perl):

one sec

OpenStudy (perl):

no it couldnt because it says for all c > 0

OpenStudy (anonymous):

so basically what contradicts in the case of x>0 is that c is not a certain number whereas x is a certain number?

OpenStudy (perl):

prove if x>=0 and x<= c for all c>0, then x=0 proof (by contradiction): suppose that x>=0, x<= c for all c>0, *and* x is not equal to zero now if x is not equal to zero then you have two cases. either x > 0 or x < 0 . suppose that x > 0, then we have 0 < = x <= c , for all c > 0 . Now let choose a c, c = x - e that is still greater than zero. now x-e < x , but now c < x and x <= c from above. contradiction

OpenStudy (perl):

each x is chosen and fixed, once you pick x. but c is variable, since it says for all c > 0

OpenStudy (perl):

it might be easier if i show it on a number line , the case x > 0

OpenStudy (anonymous):

i understand that. i just dont know how to put it in words. lol

OpenStudy (perl):

|dw:1381409604346:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!