User Name Remember Me? Password

 Applied Math Applied Math Forum

 May 1st, 2010, 09:19 AM #1 Newbie   Joined: May 2010 Posts: 1 Thanks: 0 Inducition problem with Factorial terms Hello, I'm studying Discrete mathematics and am stuck at a particular point in an assisgnment where i have to use mathematical induction to prove that every n > 0 is true the assignment is: 1 . 1! + 2 . 2! + ... + n . n! = (n+1)! - 1 so we enter P(o) which comes out 0. This implies that P(o) --> P(n+1) so we have an induction hypothesis and we want to prove: 1 . 1! + 2 . 2! + ... + n . n! + (n+1) . (n+1)! = (n+1+1)! - 1 simplify and replace the summation with the original data: (n+1)! - 1 + (n+1) . (n+1)! = (n+2)! - 1 so this is where I'm stuck because I don't know how to simplify the LHS to be equal to the right handside because the math includes factorial terms which I have never used before. (The anwser is not at the back of the book) Thanks in advance, Rijsthoofd May 1st, 2010, 01:03 PM #2 Global Moderator   Joined: May 2007 Posts: 6,820 Thanks: 722 Re: Inducition problem with Factorial terms (n+1)! - 1 + (n+1) . (n+1)! = 1.(n+1)! + (n+1) . (n+1)! -1 = (n+2).(n+1)! - 1 = (n+2)! - 1 Tags factorial, inducition, problem, terms Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post ducnhuandoan Number Theory 13 June 14th, 2016 12:20 AM tonyfoster Number Theory 1 March 24th, 2014 06:06 AM colerelm Applied Math 1 November 7th, 2012 04:19 PM coolaid317 Calculus 8 April 28th, 2010 06:21 PM Barbarel Number Theory 2 August 23rd, 2009 10:08 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top      