What I want:
Current attempt:
https://www.wolframalpha.com/input/?i=prove+by+induction+1%2F(n%2B1)+%2B+1%2F(n%2B2)+%2B+...+%2B+1%2F(2n)+%3E+13%2F24
Maybe I am missing something. But, if the problem is to show by induction that the inequality is true for n an integer and n >1, then:
This can be done quite simply, without Mathematica or Alpha.
Best, David
Yeah, it's not that hard, but I wanted to check if my solution is correct.
You can use Mathematica:
Sum[1/k, {k, n + 1, 2 n}]
which gives:
-PolyGamma[0, 1 + n] + PolyGamma[0, 1 + 2 n]
which can be evaluated very quickly, leading to n>=2 (n integer).
I don't know hot to use Mathematica... And I was hoping to utilase the step by step solution :)
Best so far, but the solution is incorrect...
https://www.wolframalpha.com/input/?i=prove+by+induction+sum_%7Bi%3D1%7D%5En+1%2F(n%2Bi)+%3E+13%2F24,+n%3E1
