What is the minimum value of N that will satisfy the statement below?
k = 1 ∑ N k 1 ≥ 7
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 transcendental equation/inequality, so there is (most likely) no closed form for n . The only way to find n is via numerical analysis.
On the other hand, consider a simpler case: x 2 = 2 x . The trivial solutions are x = 2 , 4 , but the other real solution cannot be found using conventional methods, you just have to use numerical approximations like Newton Raphson method to get the other answer of x ≈ − 0 . 7 6 6 6 6 4 6 9 5 9 6 2 1 2 .
calling sir @Jon Haussmann
@Alan Enrique Ontiveros Salazar , @Chew-Seong Cheong
. Help sir.
1 2 3 4 5 6 7 |
|
Problem Loading...
Note Loading...
Set Loading...
There are several ways to solve this.
You may use: H n ≈ ln ( n ) + γ + 2 n 1 − 1 2 n 2 1 .
This is already a quite accurate estimate for H n .
Hence, we have: H n ≈ ln ( n ) + γ + 2 n 1 − 1 2 n 2 1 ≥ 7
By the fact that as n increases, the value of H n also increases but in a very slow rate, then, the terms 2 n 1 − 1 2 n 2 1 will tend to be zero and hence,
ln ( n ) + γ ≥ 7 ⟹ n = ⌈ e 7 − γ ⌉ = 6 1 6
But i just want to ask, how to solve this kind of equations? (i.e. H n ≈ ln ( n ) + γ + 2 n 1 − 1 2 n 2 1 ≥ 7 ? See below how I solve this kind of equation. )
H n ≈ ln ( n ) + γ + 2 n 1 − 1 2 n 2 1 ≥ 7 ⟹ ( 1 2 n 2 ln ( n ) ) + ( 1 2 n 2 γ ) + 6 n − 1 ≥ 8 4 n 2 ( 1 2 n 2 ln ( n ) ) ≥ ( ( 8 4 − 1 2 γ ) n 2 ) − 6 n + 1
But I was stocked on the last step. What should I do next?