I botched up a proof, but I salvaged useful bits and bobs from it.
We prove ζ2(s)<ζ(s+1)ζ(s−1) by recalling the Dirichlet series of ϕ, the Euler totient function, that is,
n=1∑∞nsϕ(n)=ζ(s)ζ(s−1)
Now we know that, for all n≥2,
ns+1ϕ(n)<nsϕ(n)⟶n=2∑∞ns+1ϕ(n)<n=2∑∞nsϕ(n)∴ζ(s−1)ζ(s)<ζ(s)ζ(s+1)
∴ζ2(s)<ζ(s+1)ζ(s−1)
Personally, I think it is interesting, as it invokes a Dirichlet series in a somewhat unexpected way. Also, this implies that {ζ(n)ζ(n+1)}n=2 is monotonically increasing.
Challenge: Prove 2ζ(s)<ζ(s+1)+ζ(s−1), using the above result or by the trivial inequality.
#Calculus
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Since if a,b>0, a2+b2>2ab
2ζ(s+1)ζ(s−1)<ζ(s+1)2+ζ(s−1)2
Following the note's inequality, 2ζ(s)2<2ζ(s+1)ζ(s−1)<ζ(s+1)2+ζ(s−1)2 4ζ(s)2<ζ(s+1)2+ζ(s−1)2+2ζ(s+1)ζ(s−1) 2ζ(s)<ζ(s+1)+ζ(s−1)
Log in to reply
Or that. I think that spotting that there's a way to slip in AM-GM is easier, but again, that just depends on what prior experience one has.
There is also a proof without the result of the challenge by the trivial inequality, which is kind of obvious.
I think you meant {ζ(n)ζ(n+1)}n≥2
Log in to reply
Same thing, hehe.
Log in to reply
Maybe I misunderstood the notation...
Log in to reply
Just prove that ζ(s) concave downwards, the inequality follows.
Log in to reply
I just realised, Cauchy-Schwarz on ℓ2 works.