# Project #47088 - Induction - Discrete Math

Instructions: Except for questions that ask for a simple True or False, complete solutions with details are required with reasons for each of the operations you perform to obtain a solution. For example, if the problem asks for a Proofthen we need to see all the steps of the argument as is given in your eResource textbook.

1. Use mathematical induction to prove that
 4 + 10 + 16 +…+ (6n−2) = n(3n +1)
2. Use mathematical induction to prove that n3 −n is divisible by 3.
3. Prove that any amount of postage greater than or equal to 2 cents can be built using only 2-cent and 3-cent stamps.
4. In a group of k people with k ≥ 1, each person is to shake hands with every other person. Find a formula for the number of handshakes, and prove your formula using induction.

 Subject Mathematics Due By (Pacific Time) 11/15/2014 12:00 am
TutorRating
pallavi

Chat Now!

out of 1971 reviews
amosmm

Chat Now!

out of 766 reviews
PhyzKyd

Chat Now!

out of 1164 reviews
rajdeep77

Chat Now!

out of 721 reviews
sctys

Chat Now!

out of 1600 reviews

Chat Now!

out of 770 reviews
topnotcher

Chat Now!

out of 766 reviews
XXXIAO

Chat Now!

out of 680 reviews