For real numbers , how many of the first 1000 positive integers can be displayed in the form above?
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 a step function that makes 11 jumps on every interval [ n , n + 1 ) , where n is an integer, namely, at n + 8 k for k = 1 , 2 , . . , 7 and at n + 6 k , for k = 1 , . . . , 5 .... but we need to subtract one since 8 4 = 6 3 . Thus f ( x ) attains 12 distinct values on [ n , n + 1 ) .
Now f ( 0 ) = 0 and f ( 5 0 ) = 1 0 0 + 2 0 0 + 3 0 0 + 4 0 0 = 1 0 0 0 . On the 50 intervals [ n , n + 1 ) for n = 0 , . . , 4 9 , the function f ( x ) attains 5 0 × 1 2 = 6 0 0 non-negative values < 1 0 0 0 . If we reject 0 and include 1000, we end up with 6 0 0 positive values ≤ 1 0 0 0 .