0304-slides - CPSC 121: Models of Computation Instructor:...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CPSC 121: Models of Computation Instructor: Bob Woodham [email protected] Department of Computer Science University of British Columbia Lecture Notes 2008/2009, Section 203 CPSC 121: Models of Computation
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Menu March 4, 2009 Topics: Mathematical Induction (cont’d) Examples Reading: Today: Epp 4.1 (as background) Epp 4.2–4.4 Reminders: Assignment 3 due Friday, March 13 (by 17:00) Midterm, Marked Assignment 2 available in tutorials — solutions posted to Sample Solutions area of the course WebCT site Lab 5 week of March 2–6 READ the WebCT Vista course announcements board CPSC 121: Models of Computation
Background image of page 2
Example 1: Theorem: n N , a R - { 0 , 1 } n X i = 0 a i = a n + 1 - 1 a - 1 Proof (by mathematical induction): Let a be an arbitrary real number different from 0 and 1 Let P ( n ) : n X i = 0 a i = a n + 1 - 1 a - 1 Base step: Now, P ( 0 ) : 0 X i = 0 a 0 = 1 = a 0 + 1 - 1 a - 1 = a - 1 a - 1 = 1 ( a 6 = 0 , a 6 = 1 ) Therefore, P ( 0 ) is true CPSC 121: Models of Computation
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at The University of British Columbia.

Page1 / 8

0304-slides - CPSC 121: Models of Computation Instructor:...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online