01204211/activity3 induction 1

This is part of 01204211-58

In-class activities 3

A.1 (LPV) Prove that for any integer $k\geq 1$, we have that

$1+3+\cdots +(2k-1)=k^{2}$.

In problem A.1, you have to state clearly the property $P(k)$ that you want to prove. Note that we use variable $k$ in the statement, to avoid confusion, you should choose other variables when you work on the inductive step.

A.2 (MN) Prove that for any integer $n\geq 0$, the following formula is true:

$\sum _{i=0}^{n}2^{i}=2^{n+1}-1$.

In problem A.2, you have to state clearly the property $P(n)$ that you want to prove.

A.3 (MN-exercise-1b) Prove that for integer $n\geq 1$,

$\sum _{i=1}^{n}i\cdot 2^{i}=(n-1)2^{n+1}+2.$

A.4

A.5

A.6

Homework 3

Due: 16 Sept 2015

H.1 (LPV-2.1.5) Prove the following identity:

$1\cdot 2+2\cdot 3+3\cdot 4+\cdots +(n-1)\cdot n={\frac {(n-1)\cdot n\cdot (n+1)}{3}}.$

H.2 (LPV-2.5.4b) Prove that for any integer $n\geq 1$, $n^{3}-n$ is a multiple of 6.