Mathematical induction question

Click For Summary

Discussion Overview

The discussion revolves around a mathematical induction problem, specifically proving the statement that relates the sum of products of integers and their factorials to a factorial expression. Participants are working through the steps of the induction process, including base case verification and the inductive step.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Technical explanation

Main Points Raised

  • One participant expresses difficulty in equating the left side and right side of the induction statement.
  • Another participant requests clarification on the equations involved to identify potential errors.
  • A participant outlines the full question and the steps taken so far in the induction process, including the base case and the assumption for n = k.
  • There is a suggestion to factor out (k + 1)! from the left-hand side of the equation.
  • A later reply confirms the progress made and reiterates the factoring suggestion, indicating that the "-1" terms cancel out, leading to a simplified expression.
  • Further encouragement is given to explore the relationship between factorials to aid in the proof.

Areas of Agreement / Disagreement

Participants are generally working collaboratively to solve the problem, but there is no consensus on the resolution of the final step of the proof, as one participant is still struggling to prove the last statement.

Contextual Notes

There are unresolved steps in the mathematical reasoning, particularly in the transition from the left-hand side to the right-hand side of the equation. The discussion reflects various assumptions and conditions that may affect the proof.

Mono182
Messages
11
Reaction score
0
i'm on the last part of this question involving mathematical induction and i can't get the left side to equal the right saide. can anyone help me out?

right side: [(k+1)+1]! - 1

left side: (k+1)! - 1 + (k+1) + (k+1)!
 
Physics news on Phys.org
What you mean you "can't get the left side to equal the right side"? Show what equations you do have so we can, if necessary, point out an error.
 
ok, here's the full question:

Using mathematical induction, prove that the following statements are true for n > 1, n = 1.

Q: 1 X 1! + 2 X 2! + ... + n X n! = (n + 1)! - 1

A: step 1: solve for n = 1

1 X 1! = (1 + 1)! - 1
1 = 1

step 2: assume true for n = k

therefore 1 X 1! + 2 X 2! + ... + k X k! = (k + 1)! - 1

step 3: sove for n = k + 1

1 X 1! + 2 X 2! + ... + k X k! + (k+1) X (k + 1)! = [(k+1) + 1)] - 1

since 1 X 1! + 2 X 2! + ... + k X k! = (k + 1)! - 1 , then

(k + 1)! - 1 + (k+1) X (k + 1)! = [(k+1) + 1)] - 1

now what I'm having trouble with is proving that the last statement is true
 
Factor out (k+1)! (ignoring the -1)
 
Mono182 said:
(k + 1)! - 1 + (k+1) X (k + 1)! = [(k+1) + 1)] - 1

now what I'm having trouble with is proving that the last statement is true

Yup, so far so good. :smile:
As Ziox's pointed out, you should factor out (k + 1)!
The LHS, and the RHS, both have "-1", so they cancel each other out, leaving you with:
(k + 1)! + (k + 1) (k + 1)! = (k + 2)!

You should also notice that:
n! = n (n - 1) (n - 2) ... 2 . 1 = n (n - 1)!

Can you go from here? :)
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
23
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K