CSC165H1 Lecture Notes - Lecture 6: Hebei, Built-In Self-Test
cherryberry1035 and 38883 others unlocked
3
CSC165H1 Full Course Notes
Verified Note
3 documents
Document Summary
Find n" n . to o n" continue. For eeery binary representation new it has a. si ) o i. diets a: kjsiinsabin. Casey ex by n=w separately . induction ni n= In this casq tinny representationof ntl is suit like binary representation of n but bo= 1 ntl is even ( so n is odd ) ex n= In binary notation we just shift the left by one and binary digits of add a. 0 the binary representation of from binary all representation to and digits left by one. It mil turnout to be easier to prove this using strong induction ; stronger to prone them. Pg) = assumes true and and true. Induction is really but statement he are proving is seemingly stronger c) (2) Plan ) #this ordinary of induction is strong. En numbers has a ntl has a binary rep . binary rep.