Find the number of positive integers n such that n + n + 1 < 1 1 .
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.
We know it.Dont ask such silly questions.Its of PRMO 2017.Try something better for PRMO 2018.All the best.
Relevant wiki: Mean Value Theorem
This is not intended to be a straight-forward or simple solution. It's just intended to show a different way to solve it.
Since f ( x ) = x + x + 1 is an increasing function of x ≥ 0 , the solution to x + x + 1 < 1 1 will have the form x < M = f − 1 ( 1 1 ) . To estimate M , first note that 2 5 + 2 5 + 1 < 2 5 + 3 6 = 1 1 < 3 5 + 3 5 + 1 shows that 2 5 < M < 3 5 . To further refine this estimate, we can use the mean value theorem to find some c such that 2 5 < M < c < M + 1 < 3 6 and 1 1 − 2 M = M + M + 1 − 2 M = M + 1 − M = 2 c 1 ∈ ( 2 3 6 1 , 2 2 5 1 ) = ( 1 2 1 , 1 0 1 ) Then solving 1 2 1 < 1 1 − 2 M < 1 0 1 ⟺ 2 0 1 0 9 < M < 2 4 1 3 1 ⟺ ( 2 0 1 0 9 ) 2 < M < ( 2 4 1 3 1 ) 2
From this, all we need to note is that 2 9 < ( 2 0 1 0 9 ) 2 < M < ( 2 4 1 3 1 ) 2 < 3 0 , as this shows if n is a positive integer, then n + n + 1 < 1 1 ⟺ n < M ⟺ n ≤ 2 9 so there are 2 9 such positive integer solutions.
Problem Loading...
Note Loading...
Set Loading...
n + n + 1 < 1 1 ⟹ 2 n + 1 + 2 n ( n + 1 ) < 1 2 1 (squaring both sides) ⟹ n + n ( n + 1 ) < 6 0 ⟹ n ( n + 1 ) < 6 0 − n ⟹ n 2 + n < 3 6 0 0 + n 2 − 1 2 0 n (squaring both sides) ⟹ 1 2 1 n < 3 6 0 0 ⟹ n < 2 9 . 7 5 2 ⋯ ⟹ n ≤ 2 9 Since, n ∈ N
Thus, 2 9 positive integers are possible.