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
limn→∞(can−logn)=logc
(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 bn=ean then we get that b0=e and
bn+1=bne1/(bn)c
We can easily show that an is unbounded (proof by contradiction) and so is bn and thus 1bcn→0.
The recurrence for an gives us
bcn+1=bcnec/(bn)c
Expanding the e… part we get
bcn+1=bcn(1+cbcn+O(1b2cn))=bcn+c+O(1bcn)
This telescopes to give us
bcn−bc0=nc+n∑k=0O(1bck)
And so
bcn−bc0n=c+∑nk=0O(1bck)n
Thus
bcnn→c
Taking logarithms gives the result.