9:33 PM
To prove that Eunice = simple and nice and clever
let Pn be the statement Eunice = nice + simple + clever
let n=1
LHS= 1 Eunice
RHS= nice + simple + clever
Thus, P1 is true.
Assume Pk is true for all positive integers k
k Eunice = k (nice + simple + clever)
To prove Pk+1 is true, i.e (k+1) Eunice = (k+1) simple + (k+1) nice + (k+1)clever
RHS:
(k+1) (simple+nice+clever)
= (k+1)simple + (k+1)nice + (k+1)clever
= LHS
Since Pk is true --> P k+1 is true. P1 is also true. Thus, by Mathematical Inductions, Pn is true for all positive integers k.
* will you catch me?