Sorry if its already been answered.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Sorry if its already been answered.
| Название |
|---|



We can approximate the sum of this infinite harmonic sequence with the natural log function (Think of it like integration instead of addition), and the error is less than $$$1$$$ (It's called the Euler-Mascheroni constant)
lets say it is smaller than
1 + 1/2 + 1/2 + 1/4 + 1/4 + 1/4 + 1/4 + 1/8 + ...(we have1/2^i2^itimes) and(1/2^i) * 2^i = 1so we have n * log(n)Good job bruh
Bibek..rocks
We can apply integral test for it 1+/2+1/3+...+1/n < integral of (1/x)dx with lower limit 1 and upper limit n. So the sum is < log(n)
Natural log function