Can someone help me with this excercise?
I recognize that the numerator is simply increasing by factors of 2, and every time a new number is written it begins from 1 again. I know that the denominator is similar in the sense that you write a natural number to the second power n times (where n=that natural number). I also know how to get the denominator of a50 (it is 100) and how to get the numerator (it is 9). I need help with (2) and (3). The problem is done without calculator.
Let $a_n$ be the $n$th term of the following sequence: $$\frac11,\frac14,\frac34,\frac19,\frac39,\frac59,\frac1{16},\frac3{16},\frac5{16},\frac7{16}\dots$$
Find $a_{50}$.
Find $\sum_{n=1}^{50}a_n$.
Find the maximal $n$ satisfying $a_n\ge\frac1{10}$.
Answers:
0.09
9.25
190
I think that the easiest and most straightforward way to solve this problem is to use a double sum. It's obvious that the denominators are squares, and the numerators are odd numbers. So we simply write the inner sum as $$\sum_{k=1}^m (2k-1),$$ and the outer sum is $$\sum_{m=1}^n \frac{1}{m^2}.$$ So the total sum is $$\sum_{m=1}^n \sum_{k=1}^m \frac{2k-1}{m^2}.$$ Then the $50^{\rm th}$ term corresponds to some choice of $m$ and $k$. How do we find it? Well, we know that the inner sum always has $m$ terms, so we want to choose the smallest $m$ such that $1 + 2 + \cdots + m > 50$, or equivalently, $m(m+1) > 100$. Clearly $m = 9$ is too small, but $m = 10$ works. So when $m = 9$ we have summed $9(10)/2 = 45$ terms, and for the next group with $m = 10$, we need $k = 5$ more to get to the $50^{\rm th}$ term. This means $$a_{50} = \frac{2(5)-1}{10^2} = \frac{9}{100}.$$
With the above in mind we can also compute $$\sum_{n=1}^{50} a_n = \sum_{m=1}^9 \sum_{k=1}^m \frac{2k-1}{m^2} + \sum_{k=1}^5 \frac{2k-1}{10^2}.$$ The first sum is simply $$\sum_{m=1}^9 \frac{1}{m^2} \sum_{k=1}^m (2k-1) = \sum_{m=1}^9 \frac{1}{m^2} \left( 2 \cdot \frac{m(m+1)}{2} - m \right) = \sum_{m=1}^9 1 = 9.$$ The second sum is $$\frac{1}{100} \sum_{k=1}^5 (2k-1) = \frac{1}{100} \left( 2 \frac{5(5+1)}{2} - 5 \right) = \frac{25}{100} = \frac{1}{4}.$$ Therefore, $$\sum_{n=1}^{50} a_n = \frac{37}{4}.$$
Finally, the largest $n$ such that $a_n \ge \frac{1}{10}$ is easily attained by noting that $2k-1$ is maximized when $k = m$, so all terms in the inner sum are smaller than $\frac{2m - 1}{m^2}$. So all terms will be less than $1/10$ when $$\frac{2m-1}{m^2} < \frac{1}{10}$$ or $$m > 10 + 3 \sqrt{10}$$ which implies $m \ge 20$. Consequently, when $m = 19$, the largest value of the inner sum is $$\frac{2(19)-1}{19^2} = \frac{37}{361} > \frac{1}{10}$$ and this is the final term exceeding $1/10$. This corresponds to $n = 19(19+1)/2 = 190$ (we did not add any additional $k$).