Finally added some solutions to the problems by updating the problem post itself.
If there are any missing which you would like to see, please comment on the problem post.
bridge hands and math and computer science and programming and puzzles and etc and etc.
Finally added some solutions to the problems by updating the problem post itself.
If there are any missing which you would like to see, please comment on the problem post.
Simplify
√10+√1+√10+√2+⋯+√10+√99√10−√1+√10−√2+⋯+√10−√99
Scroll down for simplified form and solution.
The expression is equal to √2+1. Surprising!
Scroll down for solution.
Let a+b = 100.
Now
√10−√a√10+√a=√100−a=√b
Let u=√10+√a and v=√10−√a
So 20=u2+v2
and √b=uv
Thus
√20+2√b=√u2+v2+2uv=u+v
Similarly
√20−2√b=√u2+v2−2uv=u−v
Let c>0 be a real number and an be a sequence such that a0=1 and an+1=an+e−can
Show that
lim
(\log is \log to base e)
The Putnam problem was with c = 1 and only asked for proof of existence of the limit.
Scroll down for a solution.
Consider b_n = e^{a_n} then we get that b_{0} = e and
b_{n+1} = b_n e^{1/(b_n)^c}
We can easily show that a_n is unbounded (proof by contradiction) and so is b_n and thus \frac{1}{b_{n}^c} \to 0.
The recurrence for a_n gives us
b_{n+1}^c = b_{n}^c e^{c/(b_n)^c}
Expanding the e^{\dots} part we get
b_{n+1}^c = b_{n}^c ( 1 + \frac{c}{b_{n}^c} + O\left(\frac{1}{b_{n}^{2c}}\right)) = b_{n}^c + c + O\left(\frac{1}{b_{n}^c}\right)
This telescopes to give us
b_{n}^c - b_{0}^c = nc + \sum_{k=0}^{n} O\left(\frac{1}{b_{k}^c}\right)
And so
\frac{b_{n}^c - b_{0}^c}{n} = c + \frac{\sum_{k=0}^{n} O\left(\frac{1}{b_{k}^c}\right)}{n}
Thus
\frac{b_{n}^c}{n} \to c
Taking logarithms gives the result.