#How and why you want to "choose r" in the answer key? Then why use naturals, it looks redundant.
36 messages · Page 1 of 1 (latest)
my question doesnt get any love 😦
well, they choose r between a and b. If it happens that r=(k0-1)/n = b then they take new r=b-1/n, so that it is placed inside (a,b). There is a kind of vague misprint in the line with 'Note...' as they have chosen new r, which is equal to b-1/n.
ah, i understand now... only this part is left
this is a second question in the problem
they construct infinitely many such rational numbers
yes
the proof looks missing though... how do you choose r2 such that a < r2 < r1?
you have just proven it is possible. Just take b=r1
that contradicts the fact that r1 < b
how?
r1<b
just call r1 as b. And apply what you proved right now.
there is a rational number r2 between a and r1. You have proved it just above
At each step you insert another rational number between the two according to the fact that there is a rational number between any a and b.
.... oh, i thought you want to change the value of r1 to b, now i understand
in fact we do exactly this. We kind of rename r1 into b
so its like a value of r2 that satisfies a < r2 < r1 can be found by applying the same argument
yes
and we need to go back to the first step so the argument can be applied all over again
we have proven it for any a and b. So yes you can take ANY two numbers and the statement that there is a rational between them is true
well, i will definitelt need to write "following the same argument" to my proof for now, since the answer key seems to assume im intuitive enough to skip explanation like that
hooray, thanks a lot for guiding me through this wonderful process
i cannot close the thread though
try to type .close
why "let n be a natural number" instead of real number? is it just to bound the set into positive values only, since positive real numbers seems to work with the argument as well
i am still curious of one more thing 😅
nope
you cannot
You have to get rational r
and it is (k0-1)/n
so n should be integer
oh.. this is a really impressive proof than, very well thought proof
.close