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.
In the image above, ABCD is a square, and BX = DY, X lying on BC, and Y on CD extended.
P is the intersection point of the diagonal BD and XY.
Show that PY = PX.
(Diagram not to scale!)
Try using pure geometric methods only.
Solution diagram below:
Define Sn as follows
Sn=n∑k=1n1k
For eg
S10=10+101/2+101/3+⋯+101/10≈25.4211
Find
limn→∞Snn
Scroll down for a solution.
We will solve this using the arithmetic mean geometric mean inequality!
For k≥2 let x1=x2=⋯=xk−2=1,xk−1=xk=√n
Applying AM GM to these we get
k−2+2√nk≥n1/k≥1
Thus
1−2k+2√nk≥n1/k≥1
Now ∑nk=21k=logn+O(1)
Thus
n−1−2(logn+O(1))+2√n(logn+O(1))≥n∑k=2n1/k≥n−1
And so
2n−1−2(logn+O(1))+2√n(logn+O(1))≥n∑k=1n1/k≥2n−1
Thus
2+O(logn√n)≥Snn≥2+O(1n)
Thus Snn→2
P(x) is a 4th degree polynomial with real coefficients that satisfies
P(x)≥x∀x∈R
P(1)=1,P(2)=4,P(3)=3
Find the value of P(4).
Scroll down for a solution.
Let H(x)=P(x)−x and so H(x)≥0∀x∈R. Since H(1)=H(3)=0, H(x) has at least two distinct roots.
Now if there was a root of H different from 1 or 3, then we can show that H(c)<0 for some c∈R. If the multiplicity of 1 of 3 was odd, then we can again show that H(c)<0 for some c.
Thus we must have that
H(x)=A(x−1)2(x−3)2,A>0
Since H(2)=P(2)−2=2, we get A=2.
This gives P(4)=H(4)+4=2.32.12+4=22.
Let dn be the least common multiple of 1,2,…,n.
Show that
∞∑n=11dn
is an irrational number.
Scroll down for a solution.
Observation 1: If n+1 is a power of a prime q, then dn+1=qdn, otherwise dn+1=dn.
Observation 2:
n∑k=1ak−1a1a2…ak=1−1a1a2…an
(Proof left to reader).
Let the primes in order be p1,p2,….
Pick an arbitrary prime p=pm and consider for n≥p
fn=dndp−1
The observation 1 above also holds for fn.
Note that fpj≥pmpm+1…pj and that the inequality is strict for infinitely many pj.
Now consider ∑pi≤k<pi+11fk
By Bertrands' theorem of a prime between n and 2n we have that pi+1<2pi
and thus
∑pi≤k<pi+11fk≤pi+1−pifpi≤pi−1fpi
Since fpj≥pmpm+1…pj we get
∑pi≤k<pi+11fk≤pi−1pmpm+1…pi
And so (note inequality is strict, because fpj>pmpm+1…pj infinitely often.)
∑n≥p1fn<∑j≥mpj−1pm…pj
By Observation 2 above we get
∑n≥p1fn<1
Now if ab=∞∑n=11dn
Pick a prime p>b and consider adp−1b and use the above result about f.
a,b,c are real numbers such that
a+b+c=2022
and
1a+1b+1c=12022
What are the possible values of
1a2023+1b2023+1c2023
Try to keep the algebraic manipulations to a minimum.
[Solution]