Show that if n is a positive integer then 1352n 1n2

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: P(___): P(___): Inductive Hypothesis: P(j): We can form ___≤___≤___ cent postage with ___≥___ cents Inductive Step: P(j) → P(k+1): We can form ________, so adding a ________ makes _________. Conclusion: _____________________________________________, ____________________________________________, ____________________________________. Prove that every dollar value greater than 4 can be made up of only $2 and $5 Basis Step: Inductive Hypothesis: P(j): Inductive Step: P(j) → P(k+1): Conclusion: Show that you can form all postage greater than 32 cents using 5 cent stamps and 9 cent stamps....
View Full Document

This note was uploaded on 09/14/2013 for the course CS 2050 taught by Professor Hail during the Fall '11 term at Georgia Institute of Technology.

Ask a homework question - tutors are online