Group Abstract Group Abstract

Message Boards Message Boards

0
|
7K Views
|
5 Replies
|
0 Total Likes
View groups...
Share
Share this post:

Input in W|A this proof by induction problem correctly?

Milan Tubic
Posted 9 years ago

What I want:

https://i.imgur.com/AIQSGKZ.png

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
POSTED BY: Milan Tubic
5 Replies
Sort By:
Milan Tubic
Milan Tubic
Posted 9 years ago

Yeah, it's not that hard, but I wanted to check if my solution is correct.
POSTED BY: Milan Tubic
David Keith
David Keith
Posted 9 years ago

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:

  1. Show it is true for n = 2.
  2. Show that if it is true for n-1, it is true for n.
  3. QED

This can be done quite simply, without Mathematica or Alpha.

Best, David
POSTED BY: David Keith
Milan Tubic
Milan Tubic
Posted 9 years ago

I don't know hot to use Mathematica... And I was hoping to utilase the step by step solution :)
POSTED BY: Milan Tubic
POSTED BY: Sander Huisman
Milan Tubic
Milan Tubic
Posted 9 years ago

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
POSTED BY: Milan Tubic
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Tag limit exceeded
Note: Only the first five people you tag will receive an email notification; the other tagged names will appear as links to their profiles.
Reply Preview
Attachments
Remove
or Discard