For each natural number , define as above. Find the number of for which .
Notation:
denotes the
floor function
.
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.
Consider n between two perfect squares k 2 and ( k + 1 ) 2 that is k 2 ≤ n ≤ ( k + 1 ) 2 or k 2 ≤ n ≤ k 2 + 2 k + 1 . Then we have a k 2 = ⌊ ⌊ k 2 ⌋ k 2 ⌋ = ⌊ k k 2 ⌋ = k . Similarly, a ( k + 1 ) 2 = k + 1 . We note that:
a k 2 a k 2 + 1 a k 2 + 2 ⋯ a k 2 + k − 1 a k 2 + k − 1 a k 2 + k + 1 ⋯ a k 2 + 2 k − 1 a k 2 + 2 k a ( k + 1 ) 2 = k = ⌊ ⌊ k 2 + 1 ⌋ k 2 + 1 ⌋ = ⌊ k k 2 + 1 ⌋ = k = ⌊ k k 2 + 2 ⌋ = k = ⋯ = ⌊ k k 2 + k − 1 ⌋ = k = ⌊ k k 2 + k ⌋ = k + 1 = ⌊ k k 2 + k + 1 ⌋ = k + 1 = ⋯ = ⌊ k k 2 + 2 k − 1 ⌋ = k + 1 = ⌊ k k 2 + 2 k ⌋ = k + 2 = k + 1
This implies that a n > a n + 1 , whenever, n = k 2 − 1 , where k ≥ 2 . Since ⌊ 2 0 1 0 ⌋ = 4 4 , there are 4 3 acceptable k 's.