# let a<b with a, b being real numbers and b-a>1. Show that a<m<b for a random m

Printable View

• October 5th 2011, 07:02 AM
juanma101285
let a<b with a, b being real numbers and b-a>1. Show that a<m<b for a random m
Hi, I have the following three problems, but I only want to know what the first one is like... I am sure I will then be able to figure out the other two.

The problem says:

"In the following, a, b are real numbers.
1) Let b>a+1. Show that there is an integer m such that a<m<b.
2) Let a,b > 0. Show that there is an integer n such that n*a > b.
3) Let a<b. Prove that there is an integer n such that n*b > n*a+1. Conclude that there is a rational number q such that a<q<b."

I would really appreciate it if you could give me a hand with the first one so that I can see how to solve the other 2 problems. Thanks a lot!
• October 5th 2011, 07:39 AM
HallsofIvy
Re: let a<b with a, b being real numbers and b-a>1. Show that a<m<b for a random m
Let S be the set of all integers, x, with x< a. That set clearly is non-empty and has a as upper bound. By the "well ordered" property of the integers, any non-empty set of integers, having an upper bound, has a largest member. Let n be the largest member of this set. What can you say about n+1?
• October 5th 2011, 07:54 AM
Plato
Re: let a<b with a, b being real numbers and b-a>1. Show that a<m<b for a random m
Quote:

Originally Posted by juanma101285
The problem says:
"In the following, a, b are real numbers.
1) Let b>a+1. Show that there is an integer m such that a<m<b.
I would really appreciate it if you could give me a hand with the first one so that I can see how to solve the other 2 problems.

Theorm: If $\alpha\in\mathbb{R}$ then $\left( {\exists j \in \mathbb{Z}} \right)\left[ {j \leqslant \alpha < j + 1} \right]$
The proof goes like this: Let $A=\{n\in\mathbb{Z}:n\le\alpha\}.$
That set exists because the integers are not bounded below.
Moreover the $\sup(A)\in\mathbb{Z}$. There is our $j$.

That proves that the greatest integer $\left\lfloor \alpha \right\rfloor$ exists.

Now for your question. Suppose that $b>a+1$.
The theorem tells us that $\left\lfloor a \right\rfloor\le a<\left\lfloor a \right\rfloor+1$.
So $a<\left\lfloor a \right\rfloor+1\le a+1<b$

EDIT this is a bit more. I did not see reply #2.
All times are GMT -8. The time now is 02:57 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.942363977432251, "perplexity_flag": "middle"}