<< Chapter < Page Chapter >> Page >
An updated version of the Homework: Proof by Induction module.

Use mathematical induction to prove that 2 + 4 + 6 + 8 ... 2 n = n ( n + 1 ) .

  • A

    First, show that this formula works when n = 1 .
  • B

    Now, show that this formula works for ( n + 1 ) , assuming that it works for any given n .
Got questions? Get instant answers now!

Use mathematical induction to prove that x = 1 n x 2 = n ( n + 1 ) ( 2n + 1 ) 6 size 12{ Sum cSub { size 8{x=1} } cSup { size 8{n} } {x rSup { size 8{2} } = { {n \( n+1 \) \( 2n+1 \) } over {6} } } } {} .

Got questions? Get instant answers now!

In a room with n people ( n 2 ) , every person shakes hands once with every other person. Prove that there are n 2 n 2 size 12{ { {n rSup { size 8{2} } - n} over {2} } } {} handshakes.

Got questions? Get instant answers now!

Find and prove a formula for x = 1 n x 3 size 12{ Sum cSub { size 8{x=1} } cSup { size 8{n} } {x rSup { size 8{3} } } } {} .

You will have to play with it for a while to find the formula. Just write out the first four or five terms, and see if you notice a pattern. Of course, that won’t prove anything: that’s what the induction is for!
Got questions? Get instant answers now!

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Advanced algebra ii: activities and homework. OpenStax CNX. Sep 15, 2009 Download for free at http://cnx.org/content/col10686/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Advanced algebra ii: activities and homework' conversation and receive update notifications?

Ask