Consider the set S : = { m − n : m , n ∈ N } . Is S dense in R ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This is equivalent to construct, for every a ≥ 0 , a sequence ( m k , n k ) such that m k − n k → a . To make it easier, let's look for sequences with m k = k . We guess that for every k , we can choose n k to be the largest integer n for which a ≤ k − n , that is, n k = integer part of ( k − a ) 2 . But this is not difficult to prove.
Problem Loading...
Note Loading...
Set Loading...
Consider an interval ( a , b ) and assume, without loss of generality, that a > 0 . There exists a positive integer p such that d = p + 1 − p = p + 1 + p 1 < b − a . Now there exists a positive integer q such that q d = q 2 ( p + 1 ) − q 2 p is on ( a , b ) , as required.