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

prove the set of odd numbers is not bounded above...

OpenStudy (anonymous):

Well, what does it mean to be bounded above?

OpenStudy (anonymous):

what is the set of odd numbers?

OpenStudy (anonymous):

that there is a maximum, but I dont know how to show this in a proof...

OpenStudy (anonymous):

odd integers

OpenStudy (anonymous):

I think proof by contradiction would be a good start. Assume that there is a maximum -- you can call it M. If indeed the set of odd integers is bounded above, then \[ M > 2n+1 \] for all n. Right?

OpenStudy (anonymous):

yes, but then can I explicitly say that M < n?

OpenStudy (anonymous):

You can say let n = floor(M). This is an integer, so it's perfectly valid.

OpenStudy (anonymous):

Then what do you get for your inequality?

OpenStudy (anonymous):

M > 2M +1 awesome thank you...

OpenStudy (anonymous):

well, strictly speaking its M> 2 floor(M) +1 but in any case, that's impossible, so you have a contradiction. You should also explicitly state that you assume M>0 in the beginning, even though it's obvious.

OpenStudy (anonymous):

ok thank you

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!