Solved: Find the mistakes in the proof fragments in 3335

Chapter 5, Problem 35

(choose chapter or problem)

Theorem: For any integer n ≥ 1,

\(\sum_{i=1}^{n} i(i !)=(n+1) !-1\).

“Proof (by mathematical induction): Let the property \(\sum_{i=1}^{n} i(i !)=(n+1) !-1\).

Show that P(1) is true: When n = 1

\(\sum_{i=1}^{1} i(i !)=(1+1) !-1\)

So 1(1!) = 2! − 1

and 1 = 1

Thus P(1) is true.”

Text Transcription:

sum_i=1}^n i(i !)=(n+1) !-1

sum_{i=1}^1 i(i !)=(1+1) !-1

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back