Let N be the smallest positive integer for which 1 1 + 2 1 + 3 1 + ⋯ + N 1 > 1 0 0 . How many digits does N have?
Note:
lo
g
1
0
e
≈
0
.
4
3
4
.
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.
You spelt the constant wrongly.
To move from step 2 to step 3, you need to prove that H n > ln n is true for all positive integers n . Do you know how to do it?
Log in to reply
Considering ∫ k k + 1 ⌊ x ⌋ 1 d x > ∫ k k + 1 x 1 d x .
Log in to reply
So you have shown that H(n) > ln(n), but how do you know that H(n) > gamma + ln(n) is true as well?
Log in to reply
@Pi Han Goh – @Chew-Seong Cheong Pi Han Goh is correct. This estimate may have coincidentally yielded the correct number of digits, but it does not provide a valid proof as to why.
No vigorous proof but the above diagram, the blue area converges to γ as n → ∞ . This means that H n − ln n < γ ≈ 0 . 5 7 7 2 < 1 , therefore, the approximation is accurate.
Log in to reply
@Chew-Seong Cheong – Your logic is not sound. If what you said is true, then H n < γ + ln n is true, thus you cannot move from your 2nd inequality to your 3rd inequality.
Log in to reply
@Pi Han Goh – γ + ln n > H n > 1 0 0 .
Log in to reply
@Chew-Seong Cheong – This is obviously wrong. If you set n = 1 , you get γ > H 1 > 1 0 0 .
Log in to reply
@Pi Han Goh – But we are talking about the smallest H N larger than 100.
Log in to reply
@Chew-Seong Cheong – This is a circular argument.
This goes back to the question of "How do you know that γ + ln n > H n if you only know that H n > 1 0 0 is true?"
Log in to reply
@Pi Han Goh – The difference H n − ln n reduces asymptotically from 1 when n = 1 to γ when n → ∞ . ⟹ H n > ln n + γ .
Log in to reply
@Chew-Seong Cheong – That's another circular argument. How do you know that H n − ln n > γ for sufficiently large n ?
For any decreasing function f :
k = a ∑ N f ( k ) ≥ ∫ x = a N + 1 f ( x ) d x
For f ( x ) = x 1 , we have
k = 1 ∑ N k 1 ≥ ∫ 1 N + 1 x 1 d x k = 1 ∑ N k 1 ≥ ln ( N + 1 )
Because the growth of the harmonic series is so slow, we can say that k = 1 ∑ N + 1 k 1 ≥ 1 0 1 . Thus,
⌊ k = 1 ∑ N k 1 ⌋ = 1 0 0 ⟹ 1 0 0 ≤ k = 1 ∑ N k 1 < 1 0 1
For k = 1 ∑ N k 1 = 1 0 0 , we have
ln ( N + 1 ) ⟹ N > 1 0 0 > e 1 0 0 − 1 ≈ 2 . 7 × 1 0 4 3
In the extreme case that k = 1 ∑ N k 1 = 1 0 1 , we have
ln ( N + 1 ) ⟹ N < 1 0 1 < e 1 0 1 − 1 ≈ 7 . 3 × 1 0 4 3
Thus, 2 . 7 × 1 0 4 3 < N < 7 . 3 × 1 0 4 3 , the numbers of which all have 4 3 + 1 = 4 4 digits.
wow! that's a big #!!!!!!!!
the beauty of maths lies in finding the number of digits without having to find the actual number.....anyway you listed the number by using a computer or calculator...didnt you...?🤣
The sum is about 100.0000000000000000000000000000000000000000000090043212089...
We can rexpress the sum as:
∑ x = 0 n x 1 ≈ ∫ 1 N x 1 d x
Evalutating the integral:
∫ 1 N x 1 d x = ln ∣ x ∣ ∣ ∣ 1 N
ln ∣ x ∣ ∣ ∣ 1 N = ln N − ln 1
ln N − ln 1 = ln N − 0 = ln N
We know that this value must be greater than 100, so
ln N > 1 0 0
Consequently:
N = e 1 0 0
The next step requires a bit of intuition:
We're told that lo g 1 0 e ≈ . 4 3 4
Furthermore, we know that 1 digit requires 1 0 1 power. The number of power of 10's in a number is the lo g 1 0 of that number.
We can think of this like e having .434 digits. Hence e 1 0 0 would have lo g 1 0 e 1 0 0 digits.
lo g 1 0 e 1 0 0 = 1 0 0 lo g 1 0 e = 1 0 0 ∗ . 4 3 4 = 4 3 . 4
Because numbers can only have a whole number of digits, and N has at least 43.4 digits, it must have 44 digits.
You make the argument that it must have ≥ 4 3 . 4 digits, so it must have 4 4 . How do we know it doesn't have ≥ 4 5 digits?
Quite elegantly done!
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Harmonic Number
k = 1 ∑ N k 1 ⟹ H N γ + ln N ln N lo g 1 0 N > 1 0 0 > 1 0 0 > 1 0 0 > 1 0 0 − γ > ( 1 0 0 − γ ) lo g 1 0 e > ( 1 0 0 − 0 . 5 7 7 2 ) lo g 1 0 e > 4 3 . 1 7 9 where H n is the n th harmonic number. Approximate from γ = n → ∞ lim ( H n − ln n ) where γ is Euler-Mascheroni constant.
The number of digits of N , n = ⌊ lo g 1 0 N ⌋ + 1 = 4 3 + 1 = 4 4 .