Waste less time on Facebook — follow Brilliant.
×

Looks Not So Big

\[ \large a = 1 + \dfrac1{2^2} + \dfrac1{3^2} + \cdots + \dfrac1{2016^2} \]

Find the value of \(\lfloor a \rfloor \).

Notation: \( \lfloor \cdot \rfloor \) denotes the floor function.

Note by Ayush Rai
6 months, 3 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

The answer is 1.

Note that if \[s_n=\sum_{r=1}^n \frac{1}{r^2} \quad \forall n \in \mathbb{N}-\{1\} \\ s_1=1\] then \(\{s_n\}_{n=1}^{\infty}\) is a strictly increasing sequence that which is always less than 2, that is, \[n<m \implies s_n<s_m \quad n, m \in \mathbb{N} \\ s_n<2 \quad \forall n \in \mathbb{N}\]

Here are the proofs:

The first statement is true as \(s_m\) contains more number of positive terms than \(s_n\).

To prove the next assertion, note that \[\begin{align}0&<r(r-1)<r^2 \quad \forall r \in \mathbb{N}-\{1\} \\\implies \frac{1}{r^2} &< \frac{1}{r(r-1)} \quad \forall r \in \mathbb{N}-\{1\} \\\implies s_n&<1+\sum_{r=2}^n \frac{1}{r(r-1)}\\&=1+\sum_{r=2}^n \frac{1}{r-1}-\frac{1}{r}\\&=2-\frac{1}{n}\\\implies s_n&<2 \quad \forall n \in \mathbb{N} \end{align}\]

Now, \[1=s_1<s_{2016}<2\\\implies \large \boxed{\lfloor s_{2016} \rfloor=1}\]


Note:

\[s_{2016}<\lim_{n \to \infty} s_n = \frac{\pi^2}{6} < 1.645\]

Refer here for the proof of this. Deeparaj Bhat · 6 months, 3 weeks ago

Log in to reply

@Deeparaj Bhat Try to answer other problems of the set.You are tooooo good in solving problems. Ayush Rai · 6 months, 3 weeks ago

Log in to reply

@Ayush Rai Will try after jee advanced :) Deeparaj Bhat · 6 months, 3 weeks ago

Log in to reply

@Deeparaj Bhat How much did you get in jee-main? Ayush Rai · 6 months, 3 weeks ago

Log in to reply

@Ayush Rai Not so good... 250. Deeparaj Bhat · 6 months, 3 weeks ago

Log in to reply

@Deeparaj Bhat That is pretty good. well i have a long way to go.I'm still in 9th std going to the 10th. Ayush Rai · 6 months, 3 weeks ago

Log in to reply

@Deeparaj Bhat Nice solution..+1.I guessed it anyway Ayush Rai · 6 months, 3 weeks ago

Log in to reply

This is again for NMTC lvl 2 2016 Ankit Kumar Jain · 6 months, 2 weeks ago

Log in to reply

@Ankit Kumar Jain no it is of 2015 Ayush Rai · 6 months, 2 weeks ago

Log in to reply

@Ayush Rai Oh sorry I meant the previous year IE 2015....I know because I appeared... Ankit Kumar Jain · 6 months, 2 weeks ago

Log in to reply

@Ankit Kumar Jain how much problems could you solve?? Ayush Rai · 6 months, 2 weeks ago

Log in to reply

@Ayush Rai 1 and a half....definitely not so good...One of my friends solved about 3 and qualified Ankit Kumar Jain · 6 months, 2 weeks ago

Log in to reply

@Ankit Kumar Jain even I appeared Ayush Rai · 6 months, 2 weeks ago

Log in to reply

@Ayush Rai How many could you solve?? Ankit Kumar Jain · 6 months, 2 weeks ago

Log in to reply

@Ankit Kumar Jain same as you...1 and a half Ayush Rai · 6 months, 2 weeks ago

Log in to reply

I think the answer is 2. Ayush Rai · 6 months, 3 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...