Discrete Math Problem : Mathematical Induction

Click For Summary

Homework Help Overview

The discussion revolves around proving a formula involving the sum of harmonic numbers, specifically H1 + H2 + ... + Hn = (n + 1)(Hn - n). The subject area is discrete mathematics, focusing on mathematical induction and properties of harmonic numbers.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the validity of the formula for n = 1 and explore the definition of harmonic numbers. There is uncertainty regarding the correct expression for Hn, with conflicting statements about its value.

Discussion Status

The discussion is ongoing, with participants questioning the correctness of the initial formula and its implications. Some participants suggest that if the formula does not hold for n = 1, it may not be valid at all.

Contextual Notes

There is confusion regarding the definition of harmonic numbers, with participants noting that there may not be a simple formula for Hn. This uncertainty affects the ability to prove the original statement.

GoGoDancer12
Messages
14
Reaction score
0

Homework Statement



Prove that H1 +H2 +...+Hn = (n +1)(Hn-n)?

Homework Equations



Hn denotes the nth harmonic number.

The nth harmonic number is the sum of 1+1/2+...1/n,
which is n / n +1.

I'm not really sure if Hn = (1/ n) .

Prove by Mathematical Induction

Hn denotes the nth harmonic number.

The Attempt at a Solution



Basis Step : P(1) = Hn = (n +1)(Hn-n)
(1 / n) = (n +1) ( (1 / n) -n)
(1) = ( 1 + 1) (1-1)
1 = (2) (0)
1 = 0, which is false

or
Basis Step:
P(1) = Hn = Hn = (n +1)(Hn-n)
( n / n + 1) = (n + 1) ( (n / n + 1) -1)

P(1) is false, because 1/ 2 does not equal to - 1
 
Physics news on Phys.org
GoGoDancer12 said:

Homework Statement



Prove that H1 +H2 +...+Hn = (n +1)(Hn-n)?

Homework Equations



Hn denotes the nth harmonic number.

The nth harmonic number is the sum of 1+1/2+...1/n,
which is n / n +1.

I'm not really sure if Hn = (1/ n) .

Well, it can't be both [itex]n/(n+1)[/itex] and [itex]1/n[/itex]. In fact, I don't think it is either one. As far as I know, there is no simple formula for [itex]H_n[/itex].

Let's start with the induction hypothesis. Namely, we need to check that the formula is correct for [itex]n = 1[/itex]. Plugging in [itex]n = 1[/itex], the formula reduces to

[tex]H_1 = (1 + 1)(H_1 - 1)[/tex]

Is this correct?
 
How would I know if its correct or not if there is no simple formula for H_n ??
 
GoGoDancer12 said:
How would I know if its correct or not if there is no simple formula for H_n ??

There may not be a simple formula for [itex]H_n[/itex] in general, but what's [itex]H_1[/itex]? Isn't it simply 1? (Look at the defining sum.)
 
I think H1= (1 / n) = 1
 
GoGoDancer12 said:
I think H1= (1 / n) = 1

Right, so is the formula correct for [itex]n = 1[/itex]? i.e. is it true that

[tex]H_1 = (1+1)(H_1 - 1)[/tex]

If not, then there is something wrong with the problem statement.
 
No, its not true because Hn = 1
and (1+1)(1-1) = 0

So, there's no way to prove H1 +H2+...+Hn = (n +1) (Hn - n)
is true, right??
 
GoGoDancer12 said:
No, its not true because Hn = 1
and (1+1)(1-1) = 0

So, there's no way to prove H1 +H2+...+Hn = (n +1) (Hn - n)
is true, right??

Correct. If it isn't even true for [itex]n = 1[/itex] then it's certainly not a valid formula.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K