⌊ n + n + n + 2 1 ⌋ − ⌊ n ⌋
Evaluate the value of the expression above for positive integer n .
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.
2 0 1 8 ! + 2 0 1 8 ! + 2 1 is too close to 0 that can be ignored,so ⌊ 2 0 1 8 ! + 2 0 1 8 ! + 2 0 1 8 ! + 2 1 ⌋ − ⌊ 2 0 1 8 ! ⌋ = ⌊ 2 0 1 8 ! ⌋ − ⌊ 2 0 1 8 ! ⌋ = 0 .
The term ⌊ n + n + n + 2 1 ⌋ can be written as
⌊ n + n + n + 2 1 ⌋ = ⌊ n + ( n + 2 ) 2 − ( n ) 2 − n + n + 2 ⌋ = ⌊ n + 2 − n + n + 2 ⌋ = ⌊ 2 n + n + 2 ⌋
Then write the main expression as ⌊ 2 n + 2 + n ⌋ − ⌊ 2 n + n ⌋ = ⌊ a ⌋ − ⌊ b ⌋ = ⌊ m + ϵ 1 ⌋ − ⌊ n + ϵ 2 ⌋ , where m , n are positive integers and 0 ≤ ϵ 1 , ϵ 2 < 1 .
As the first fact, one can show, is that a − b = ⌊ 2 n + 2 − n ⌋ = 2 3 − 1 < 0 . 5 .
Also, 0 ≤ ϵ 1 , ϵ 2 < 0 . 5 , because both a and b are results of a real number divided by two, which makes the fractional part less than 0 . 5 . Consequently, − 0 . 5 < ϵ 1 − ϵ 1 < 0 . 5 ⟹ 0 . 5 < 1 − ϵ 1 − ϵ 1 < 1 . 5 .
Finally, in case m = n + 1 then a − b = 1 + ϵ 1 − ϵ 2 > 0 . 5 , which contradicts the first fact. Therefore, m = n .
Problem Loading...
Note Loading...
Set Loading...
Consider the following expression.
X = n + n + n + 2 1 = n + 2 n + 2 − n = 2 n + 2 + n = 2 ( n + 2 + n ) 2 = 2 2 n + 2 + 2 n 2 + 2 n < 2 2 n + 2 + 2 n 2 + 2 n + 1 = n + 1
So we note that ⌊ X ⌋ − ⌊ n ⌋ < ⌊ n + 1 ⌋ − ⌊ n ⌋ < n + 1 − n . Now let us check the maximum value of n + 1 − n . Let us consider n is continuous instead being a discreet integer. Then d n d ( n + 1 − n ) = 2 n + 1 1 − 2 n 1 < 0 for all n > 0 , which is a decreasing function. Therefore the maximum value of n + 1 − n = 1 , when n = 0 . Hence we have ⌊ n + n + n + 2 1 ⌋ − ⌊ n ⌋ < 1 = 0 .