+0

# Pls help

0
55
2

Let $a_1,$ $a_2,$ $\dots$ be a sequence of real numbers such that for all positive integers $n,$ $\sum_{k = 1}^n a_k \left( \frac{k}{n} \right)^2 = 1.$Find the smallest $n$ such that $a_n < \frac{1}{2018}.$

Aug 8, 2021

### 2+0 Answers

#1
0

The smallest n that works is 2019.

Aug 8, 2021
#2
+114476
0

I don't get this question.  It does not make sense to me.

If

$$\displaystyle \sum_{k = 1}^n a_k \left( \frac{k}{n} \right)^2 = 1.\\ then\\ \displaystyle \sum_{k = 1}^1 a_1 \left( \frac{1}{1} \right)^2 = 1.\\ so\\a_1=1$$

Since the sum of any number of terms must equal 1

$$a_k=0\quad \text{Where k is an integer greater than 1}$$

Obviously, I am not understanding something.

Aug 8, 2021