Kuta Software - Infinite Precalculus Name___________________________________

Mathematical Induction Date________________ Period____

Write the induction proof statements P , Pk , and Pk for each conjecture.

1) Pn: nn(n)

2) Pn:   is divisible by 

n n

3) Pn:  n
n

Use mathematical induction to prove that each statement is true for all positive integers

4) (n) n(n )

 

-1- Worksheet by Kuta Software LLC

©j J2^0N1M6D tKPuFt\aJ lSeokfVt^wdaTrtex ELlLtC].o V BAQlhly crlidgkhXtYsr srweTsMeZrOv^e`dt.Y r ZMBahdkeC HwziPtHhu pIfnZfrixnEietWej tPkrXe`c_aTlVcfuxlYuIsQ.
 5)  is a factor of  
n

6)  n
n

-2- Worksheet by Kuta Software LLC

©o f2N0I1K6q [KbuftaaS iS`oLfqt`wuaArjeG BLCLXCl.J e zAOlml] HrLiggZhWtes] Br^e_sLekrgvkeDdy.H C KMEandbeA awgiUtyhW fIPnYfbi]nZiCtTeN tPorheGcgaelecbuVlDuZsy.
 Kuta Software - Infinite Precalculus Name___________________________________

Mathematical Induction Date________________ Period____

Write the induction proof statements P , Pk , and Pk for each conjecture.

1) Pn: nn(n)

P: 
Pk: kk(k)
P : k(k)k(k)(k)
k

2) Pn:   is divisible by 

n n

 
P:   is divisible by 
Pk:   is divisible by . Therefore,   r for some integer r.
k k k k

(k) (k)
Pk:   is divisible by 

3) Pn:  n
n


P:  
Pk:  k for some positive integer k
k

Pk:  (k)
k

Use mathematical induction to prove that each statement is true for all positive integers

4) (n) n(n )

 

Let Pn be the statement (n) n(n )

 

Anchor Step
 
P is true since () ( )
Inductive Hypothesis
Assume that Pk is true: (k) k(k )
 

Inductive Step
We now show that Pk is true:
(k) ((k)) = k(k )((k))
   

 
k k(k)
 
k kk k
 
k k k
 
(k k k)
 
(k k kk)
 
((k k k)(k))

((k) (k))

(k)((k) )
Conclusion
By induction Pn is true for all n.

-1- Worksheet by Kuta Software LLC

©M G2X0M1d6k lKAuHtoaF NSWoHfLtzwGaqryeJ DLoLgCE.k G OAKl]lJ xr\ibgMhktEsz sroeQsoetrUvIekdu.` S OMJaIdFei LwViTtTht mIDnVfoi^nAihtRes FPBrAe[cXawllcwuSlkucsX.
 5)  is a factor of  
n

Let Pn be the statement  is a factor of  

n

Anchor Step

P is true:  is a factor of  
Inductive Hypothesis
Assume that  is a factor of  . Therefore,  r for some integer r.
k k

Inductive Step
(k)
We now show that Pk is true:  is a factor of  
 
k

() k
  
k k

 r
k

( r)
k

Conclusion
By induction Pn is true for all n.

6)  n
n

Let Pn be the statement  n

n

Anchor Step

Pis true:  
Inductive Hypothesis
Assume that Pk is true:  k for some positive integer k
k

Inductive Step
We now show that Pk is true:
 k
k
k
 k
k
k
 k
k

 kk
k

 k
k

 (k)
k

Conclusion
By induction Pn is true for all n.

Create your own worksheets like this one with Infinite Precalculus. Free trial available at KutaSoftware.com

-2- Worksheet by Kuta Software LLC

©P n2^0k1Z6k QKBuktDai bS]offHtmwoaor\es YLWLSCL.P B HAmlHlS nrSiggbh_ttsJ arPeRsOeQrVvJeId].M D KMUaCdves EwviCtrhZ HIxndfjirnXiStVeN qPmrweEcgaplYcIuLlQuTsl.