Let a and b be real numbers with a
anyone?
:cry:
it's analysis, got an exam tomorrow :/
we can do this
start with this: if x and y are positive numbers then there is a natural number n with nx > y
this is more or less obvious (and is called "archemidian propery" i think then consider a < b so \[b-a>0\] and using the above you know there is an integer n with \[n(b-a)>1\]
which is another way of saying that \[na\] and nb\] differ by more than one. therefore there must be an integer m between them
i.e. there is an m in Z with \[na<m<nb\]
didn't get where the 1 comes from in the n(b-a)>1
then divide by m and you are done \[a<\frac{n}{m}<b\]
oh the 1 comes in to make the proof work.
the idea is that you want to assure that \[na\] and \[nb\] differ by more than one, insuring an integer between them
you could have used 2, or 3 or anything really
i see. you are a legend, thanks!
i might be clearer if you tried this with actual numbers and see how it worked
we can do it if you want
no time, i'm gonna memorise it for the exam. this only came up once in the past papers. there's a whole lot of other stuff i have to work through. analysis is a feather :/
of course that wouldn't be a proof, but it might explain the mechanics of the proof
ok good luck!
thanks!
i have to add that i know this because i remember it. it would not have come to me off the top of my head. i have seen it before.
yw
haha you've got a hell of a memory :D
Join our real-time social learning platform and learn together with your friends!