Course Hero

Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

2 Pages

week4a

Course: CSC 310, Fall 2009
School: University of Toronto
Rating:
 
 
 
 
 

Word Count: 1864

Document Preview

s s s f5 j d j d f3s h P @ H G 6 1G @ 16 7RsUWpS` 4 P 1 e 16 42 16 1 H G C B 4 e 8 ca 1 V6 4 a 1 V6 4 IQgQp5ipUI7rBYBi7Sgt7pWp7SpF7a B @ C C6 4 6 1 q H G ` P B X6 4 1 X 4 V X 1G V 1 q y 1 1 H 7RYP` 7%UgxUIR1 7xs7WbFiFg7itI3 j d j h 5 7RRWpSI'k d P @ H G 6 1 G @ 16 ` 4 P h m f53s sUU1 pi7WrWsWg7itIWIrBYBka Sgt7a H G ` P B X6 4 1 X 4 V X 1 G V 1 q y 1 1 z @ H C B 4 e 8 c s 2 a h V B e 6 42 1 X...

Register Now
Search

Unformatted Document Excerpt

Coursehero >> Canada >> University of Toronto >> CSC 310

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
s s s f5 j d j d f3s h P @ H G 6 1G @ 16 7RsUWpS` 4 P 1 e 16 42 16 1 H G C B 4 e 8 ca 1 V6 4 a 1 V6 4 IQgQp5ipUI7rBYBi7Sgt7pWp7SpF7a B @ C C6 4 6 1 q H G ` P B X6 4 1 X 4 V X 1G V 1 q y 1 1 H 7RYP` 7%UgxUIR1 7xs7WbFiFg7itI3 j d j h 5 7RRWpSI'k d P @ H G 6 1 G @ 16 ` 4 P h m f53s sUU1 pi7WrWsWg7itIWIrBYBka Sgt7a H G ` P B X6 4 1 X 4 V X 1 G V 1 q y 1 1 z @ H C B 4 e 8 c s 2 a h V B e 6 42 1 X 4 V 4 P @ u P 4 P P @ H 1 H xU4 iR4 77537Wx7S)FS77RtI3 1 4 P @ u P 4 P P @ H c6 @ C e P @ ` C a f g g g m 7X4WVbI7iSI77ITRRrPgb7xIYPs f e a C C e @ e 46 q 1 z @ H B 4 e 8 ca 1 a 4 1 V6 4 F1 G DCYBg7RSpIrWR3a gf7dtgIH 3F7a @ 2 4 P Ca P 1G y1 HGu s 1 HG ` C X 4 V 6 1 Ca P RTS4 sRWifs9vtIrYPWUgX sS4 & S)toi ! & USD3 kv)v H C 1 m ia ip a @ j d c q 46 G P 1 1 H G 4G 1a B V a @ C H G 1 h @ ifFSWUpIsQ3g4 Ukva g3)738 P @ V 1 H ` 4 P 1 1 `6 B 1 e 4G s ` C a 4 4 H V c WtSISUt7pR@ Qg|bIYPsUIUT' d Up b Tip d}}%%d9i jj f j df df e d dI sW9i)9f %Wi5gi5W s C 1VP @Ga C 6 4 2 '7WYP j m FU7IRgU7IYPTIva SUf7fUH G P 1 X P 1 q 1 X C 16 @ B 4 e 8 ca P 1 1G C6 q 46 q q @ C C H h V B e 1 H G C B 4 e 8 c W@ 5RI77va 3a U39 m U4 7QIstYPa Sgt7a 1 H G B @ 6 4 1 H G ` C B C B 8 c e X P 42 16 I7rB752 R IsIYPgc gYqG 7tbsIgS53pR@ t C B 4 e 8 c a 6 4 2 a C C e @ e 4 6 q 1 H G R f g g g hu frPAa Sgt7%5F1 )G DCYBg7RIQIsS f e 16 @ u t C B 4 e 8 ca 6 42 a C C e @ e 46 q 1 H G 2 IvtYPa Sgt7%5iF1 )G DCYBg7ISpRQson u t 8 462 B 4 e 8 ca s 2 4 a h V B e B C aa 4 m v~}a Sgfg|xUkiU4 7Q1 7Yesggq rBB7@ va Sgt7a h 3IWRrBYBi hu SS4 UWi1 { B 4 e 8 c w 1z@H C t P CaP1Gy H Gu a C 6 42 G 1 e @ H B @ 1 V6 4 a 1 H G B 4 e 8 c s9vs G x75sg7R7rq7fWp7SpIsWa Sgt7a w I vSFsg7R7rq7fWp7S7IYP` 5%7Son a @ H u t G 1 e @ H B @ 1 V6 4 a B @ C C6 4 6 4 2 m d 6 4 j h dfgggf e d a @ P 1G C B 4 e 8 c kh lki5FA5pUdG 56 Wa Sgt7a 2 a 1 V P 1 1a G @ h 4 B 1 H C C 1 V6 4 R4 FWIRISWWtS4 QtUV UH tYP7F7a @U4TDiW9x9vtIrIYPU'i7TpiR4 7bYPC 2 w yw HGu s 1 HG ` C P q1 X ce ah V B e a S4gf87dabIYPWIUUTS4 RIQI3FE DC7A97530 B e c ` C X 4 V P 1 2 4 P CG 4 P 1 HG 1 B @ 86 42 1 (& $ ! )'%#" DR e 9D e ` j d s t3 g B4 h ioF I RpU5DR R DR e 9D e ` g B4 r h DR W ioW e e 7 B4 R R ` h e e 9 e ` f7 B4 h DR e e se T7 B4 R I ` h l e se ` pg B4 j h 5 d ijf3lj h 5kWIs3IUpI~Q0 d s d G @ H G 1 z 46 q 4 P 1 & S) )% Notes for CSC 310, Radford M. Neal, 2004 4a.1 s P @HG aa B HG`P B X1GV1 q y m 3T7RsiF1 bsUU1 WiFg7i1 a@H G@HG aG Cy RAWIsa Ui1 h l7537WTRRrPgQ1 77FW7X d 6 42 1 X 4 V c6 @ C e B e @ X 4 V 1 c RIS U7xRV gH 5xUpIr7Rtva pUsG B 1 C P @ H C 6 42 s 2 4 1 B @ z @ C 16 1 H j d c q 46 G P 1 c6 @ C e 1 H G P @ H G 6 1 G @ 16 C G @ H if5isWUTRRYPUrspIsUW` a WIsG SgfglUgbsRIU1 7IRIWxWpY6sF7TF B 4 e 8 ca 6 1 q H G ` P B 1 ` @6 1 z @ X 1 C a 1 X c P @ 6 4 B @ 86 4 c rB73 w w w a a 16 q 8 4 sR9tg9sIDW r97AFpRtSWV P @ V 1 1 V6 4 a 1 H G 2 a P C a P 1G y 1 ` C a c 7tS7Wp7SpsU4 S4 UWixYPsb' & )foiIRoSD3 k'! 1 `6 B B G P C m gI@ bc sWU1 RrSika 2 9pgrBYBkia UsG 7V R aj d C s C 1 6 G s 1 C e a C C e C H j d Q 2 if54on m s 9 $ fAs A 3x2 AG g3s YP3FFIUIW3FI37WIUb31 77fgrBYBi30 C a1VP1 1a 1a1HG 1 X 4VP1 4G B e @ 1 C e 1 F h u Gh P @ H G 6 1G @ 16 ` 1 e P @ V a 1 V P 1 1a B @ C q cG 7RUWWSpgAG 7WviWIUSWb% 7WV g7# 2 4 6 1 e 8 P 1 H G 4 a 1 P 4 P @ H G 6 1G @ 16 ` 1 e P @ RRgf7gQIr7ST7RsUWpStgAG 7V a 1 V P 1 1 a H V a B @ 6 42 c C e @ e 46 q B @ G 4 G 1 H FWIRISWfUIirB775t9 CG YBg7RSpI7R3I3 IH PE E C A h u Gh F DB R I ca W)DBYBk 2 CG@a C 1 V P 1 1a B @ C q cG H V a c P @ 2 4 c C e @ e 46 q 1 H WUISF7V g7tUIifW7xUTG DCYBg7ISIQI3 B @ z 1 `6 B B C @2 @ 4G G 1a 7 C c B @ 1 C C H m 1r7RAgI@ rc Y6gpb#ii Ca 2 FG DC7RWIYPa UsG c2 C G a C a 1 V P 1 1a Ga 4 8 G @ H G a B 1G P 1 H a )W@)rBYBkiFFIUIWgWRsi3a DBUtUsG c B@ 1 C z1HVce1 9G DC7ISWIrP3DaiUIUIH m F1 7p7IUIW7x&U4 a B @ Va 1 ` @6 1 z @ P @ 2 PS4 W@ Ui7XrR7I7@dtsWI3Da3WIs3WIYPa s 9 C G C z 1 X6 @ X P Ga 1 H G 4 H G @ H G 1 V C a@ f5t1Ug7@xW4 rB7TYPpR3Is31 7p0 j d z 4 e X 1 B @ C `6 @ 8 1 H G B @ V a 1 9&7 j d & ` Bj & s @8$ f5 56j ggg4 ps j 16 1 H a 1 P 4 a @ 1 V P 1 1 pUIkiFSkvaiWIUIWar% B7@V g74'i7kDa3i C q cG# 1 P q1 X G1 DYp13) 0 IH C 2 ! o(% Notes for CSC 310, Radford M. Neal, 2004 4a.2 b w ` Y w e 2 4 8 B e 46 q 1 H G C C H m crDgati9gfsxR|U1 7IQIia 3a Up a C Ce@e 6 PF1 G DCrBg7RSp4Rq GWP7daSWP WIRbG kSFWUgIUgUgIYPrc rB76 @ G P 4 V 4 P h H C G P 1 X P 1 q 1 X C B @ 1 a Bgef87dtpRxIP dS}ASWV Fe 4 ca 16 @ X 8 462 1 8 4 fgggf a C C e @ e 46 q B 4 e 8 ca 1 H G 4 X 16 1 F1 G DCYBU7RSpRSgt7pIQ7tRIH 0 V b ` w Y m crgaFprRpY9 a@ 4Ph 1 CPHV1 P RrS ggUWG 4 WrpIP X P CG B 4a 1 s 1 C a 2 a h V B e ` C X 4 V P 1 c e c q 46 G P 1 1 H m tFE sU4 iU4 gIYPWIUTbsSpsFUtIsG 4G 1a B V G 1 ` 4G 1 `6 B 1 e Ga 8 a 1 C G 1 8 4 3U4 Ukigx3gR@ rgvfAiAY8sASa s X 1 `6 B C s P 1 H 1 ` xIP m 7pR@ 3a TUIk37I7H { h k Ca w s 1 Ca 2 ahV B e B Caa4q 24 61e 8 P 1H tWE sR4 iU4 7Q1 7YeggR%Ugfg7rp w cq 6GP 8FrUgrSp4sWU1 1 H G B6 @ 1 P 4 G @ G @ X a a 16 q 8 4 V 1 P @ V W spc 9IItWkFpRtSWtxp7W4 V a 8 B e 46 FU1 gSIq 4 G 1 z @ H CGa 1 H ` 4 HG C z 2 4 G C 4 x3IWRrBYBpISISi1 gUkFYPgq B7@V CGsIIx| m IYPga )W)3c rB7V )...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

University of Toronto - CSC - 310
vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv vv x hW 9C U AC AtA)cvE Q 1 9 1 C C p7C S U C S F 1 h 9 U f E h 9 U C7 ADAX3cTb6XTtTAyAHYCXfA)cfw_X83514 Cd7 CS E7 CI9W6C Q EI Cd7 UC 461 E x 1 47 h E6 DbTaBb`D)c`Af3R
University of Toronto - CSC - 310
QadX jFFG v aeCV4D RV!FlufC#1UWgU9$'DE qS EGdX v GQa gD pD HGfDc S GTSQ v hv`v7C1#gCmrIG CC4Dg`sxaF's94eU'GuVQ p Y HvDt s E vtSt pB Y ED fXDc E G QcX pt p v E S Gt vAD H pD HGfD jFVqSr9'Sa Y 4'Dgg#f C4PiufqPC1Uc maeC1D Rh'GE 7HFFD hFFG IE #eFD EGdX v GQa
University of Toronto - CSC - 310
@ XP V FD s lIV 0AGACacX P dIAW&WW4I"W9ar0IkWqlCl~9EYWF X @pg cF @ xV`F XPs x cF 8Vgp c r @ c p X X i F i xD ` x i r tp @ 8 P r xDH @ x V ` F X P s x c 0f@ 0P iXa`Wh4QAs WyuAvu4I"W9ar0IkWF H x 8 P c ` @ 8 P P g x @D g r @ c kvAh@ dAUwfQ693uWF bUv"g h 8 P
University of Toronto - CSC - 310
h v Y S I q a I q ah G I Sf TiRxsTxcPICa ug#q aqWa hS p Y w q p YQS p wSv G I v f Ghv Ya a SIS TRkixiQ S xxxTTx R 4xPIlgR4 w q G a Q qf ` Y I w q Yf ` G Sf S W d w u s xTQ R3#lo xxR3Rbh jg9HHytr Ps hWafI w ShSW TTS Xsia W G U S p Y w q p Y Q S p w S v G
University of Toronto - CSC - 310
wp `fP ` `V iP 88!V IdaH G0qH h F FV FU P FV PV pU a V p U Fv ` P V c ` D h P |'yeIteff `F Wsbaeiedadd9U H P ` D ~ PU FU P F V X ` w p w FU E U FUU P P V c ` D h P t9UG'99ItgfesV m`I899iedadd9U XVU P E FU E ` V P f p V H H P a F E ` H F HV F WsIG9H G0Ri|
University of Toronto - CSC - 310
a h eV C t I e h h V V X n Q I e n Q Id V T n Q FRud &RR RrfQSqRI7RWC`tPrfQPRu%aYRPRcfw_ dI ea gC hcfw_ enC h I nTTQ cfw_Cvwa t Ftftru~YR`G pFFrt3t7s7FPcfw_ri RG 2sRud 9e`C Rpud 7Fd YaRcsFP62d E edT h VI t cfw_ n C h e E wa e gC V CdGTm e dcfw_ w VT hcfw
University of Toronto - CSC - 310
CSC 310 Solutions to Mid-term Test1. You would like to encode a sequence of symbols that come from an alphabet with d + 3 symbols. You want to encode symbols a1 , a2 , and a3 using codewords that are three bits long. You want to encode symbols a4 , a5 ,
University of Toronto - CSC - 310
CSC 310, Spring 2004 - Assignment #4Due 4:00pm April 8 (drop it off in my office, SS 6016A). You're also welcome to hand it in at the start of lecture on April 7. Worth 10% of the course grade. Note that this assignment is to be done by each student indi
San Diego State - BUS - 315
Dakota State University BUS 315 Credit and Collection Unit Three: Business Credit I Reading Assignment Chapter Chapter Chapter Chapter 12: 13: 14: 15: All All except pp. 279-280 All except p. 306 Pp. 308-328 Objectives Chapter 12: Business Use of Merchand
National Taiwan University - PS - 536
Journal of Contemporary China (2000), 9(24), 291308New Interventionism in the Making: interpreting state interventions in Hong Kong after the change of sovereigntyANTHONY B. L. CHEUNG*After the change of sovereignty in Hong Kong in July 1997, there has
UMKC - ECON - 506
Stanford - CS - 103
Handout #68 December 7, 2008CS103A Robert PlummerFinal Exam Review SessionNumber Theory 1. (20 points) Prove that for all positive integers n: 6 | (n (n + 1) (2n +1). Induction is not required for this proof (but is allowed).Induction 2. (20 points) L
Stanford - CS - 103
Handout #67 December 7, 2008CS103A Robert PlummerPractice Final Solutions1. Number Theory (20 points) (a) (5 points) Prove or Disprove the following: The total number of distinct positive divisors of any positive integer is even. Counterexample: The di
Stanford - CS - 103
Handout 66 December 7, 2008CS103A Robert PlummerProblem Set #10 Solutions1) Product rule: 30 * 12 * 4 *6 2) a) The two kinds of numbers don't overlap (e.g., if there are exactly four 0's then there are four 1's, not three), so it's the number of ways t
Stanford - CS - 103
Handout #65 December 3, 2008CS103A Robert PlummerProblem Set #9 Solutions1) a1 = 6, an+1 = an + 6 for n 1 2) P(n): Base Case: P(0) asserts that x =0i =0nx =i1 xn+11 x1 1xSince both sides are 1, this is true. 1 xk+1 1-xInductive step: Assume P(
Stanford - CS - 103
Handout #64 December 3, 2008CS103A Robert PlummerPractice FinalExam Rules: 1) You have 3 hours to complete this exam. 2) This is an open-note exam no textbooks allowed. Handouts, problem sets and solutions are allowed. You may also bring a one-page cri
Stanford - CS - 103
Handout #63 December 3, 2008CS103A Robert PlummerRevised Combinatorics ChartHere is a revised version of the chart for combinatorics formulas. It correctly shows that when we are selecting r objects from a set of n objects with repetition allowed, r ca
Stanford - CS - 103
CS103AHO #62Gdel II12/3/08Gdel NumberingGdel's Incompleteness Theorem(84x11)9(8x=11s5y)7 13 92 3 5 7 11 13 17 19 23 29This scheme allows us to represent every formula with a unique number. Given a number, we can determine whether i
Stanford - CS - 103
CS103AHO #61Gdel I12/1/08Gdel's Incompleteness TheoremCS103A12/1/08Kurt Gdel (1906 1978)Gdel's Incompleteness TheoremGdel, Kurt (1931). ber formal unentscheidbare Stze der Principia Mathematica und verwandter Systeme I. Monatshefte fr Mathematik
Stanford - CS - 103
Handout #58 November 19, 2008CS103A Robert PlummerProblem Set #10Due: Wed., December 3 (Turn in by noon, Dec. 5 at Bob's office for one late day) Combinatoric problems can be very misleading. They seem very simple, but may turn out to be surprisingly i
Stanford - CS - 103
CS103AHO #57Functions II11/19/08InverseA function f: X Y is called invertible if and only if there exists a function g : Y X such that y = f(x) x = g(y) for all x X and for all y Y. We call g the inverse of f and write g = f-1. f y0 f y1 X Y X x1 g Y
Stanford - CS - 103
Handout #56 November 17, 2008CS103A Robert PlummerProblem Set #8 Solutions1) The formula is n(n+1). Proof: We will show that property P(n) holds for all integers n > 0 using the weak mathematical induction. Here, property P(n) means that 2 + 4 + . + .
Stanford - CS - 103
CS103A HO# 53 Slides-Combinatorics II11/14/08Sets What is |A B| ? A (A and B not necessarily disjoint) B AWhat is |A B C| ? B|A| = 8|B| = 6 C|A| + |B| = 14, which double counts the intersection |A B| = |A| + |B| - |A B| This is known as the Principl
Stanford - CS - 103
Handout #52 November 14, 2008CS103A Robert PlummerCombinatoricsThis handout presents in prose form many of the principles and examples discussed in class.Combinatorics is the study of counting, which is important in Computer Science in many ways: To u
Stanford - CS - 103
CS103A HO#51 Slides-Combinatorics I11/12/08Combinatorics The Art and Science of CountingCombinatorics The Art and Science of CountingWhy count?Even Hollywood is interested:"There's only so many hands in a deck of cards." From the movie Shane To und
Stanford - CS - 103
Handout #50 November 10, 2008CS103A Robert PlummerProblem Set #9Due: November 19Part I: 1 point each 1) Give a recursive definition of the sequence a1, a2, . an when the nth element can be found using the formula an = 6n. n 1 xn+1 2) Prove by inductio
Stanford - CS - 103
CS103A HO# 49 Slides-Recursive Functions11/10/08Recursive Definition of a SetTo define a set S recursively, we specify - one or more initial elements of S - a rule for constructing new elements of S given those already in the set Example: 3S If x, y S,
Stanford - CS - 103
Handout #48 November 10, 2008CS103A Robert PlummerRevised SyllabusDate 11/3 Day M Lecture # 19 Topic Sequences and Summations; Induction I PS8 distributed Induction II Induction III, Recursion Recursive Functions PS9 distributed Combinatorics I Combina
Stanford - CS - 103
Handout #46 November 7, 2008CS103A Robert PlummerProblem Set #7 SolutionsNote: There is more than one way in which certain questions can be proved. What we've provided here for each question is just one of those alternatives. The main purpose of these
Stanford - CS - 103
CS103AHO# 45Slides-Induction II11/5/08Peano's Axioms There is a number 0. Every number has a successor, denoted by S(a). There is no number whose successor is 0, i.e., x (S(x) 0). Two numbers with the same successor are themselves equal, i.e., x y(S(x
Stanford - CS - 103
Handout #43 November 3, 2008CS103A Robert PlummerProblem Set #8Due: 11/1088 points total; 8 points for each problem Prove all the following using either weak or strong induction. Proper form for your proofs is important! 1) Find a formula for the sum
Stanford - CS - 103
Handout #41 November 3, 2008CS103A Robert PlummerSequences and SummationsA mathematician, like a poet or a painter, is a maker of patterns. G.H. Hardy A Mathematician's Apology (1940) Sequences Imagine a person (with a lot of spare time) who decides to
Stanford - CS - 103
Handout #42 November 3, 2008CS103A Robert PlummerIntroduction to Mathematical InductionOne of the most important tasks in mathematics is to discover and characterize regular patterns or sequences. The main mathematical tool we use to prove statements a
Stanford - CS - 103
CS103AHO#39RSA10/31/08RSA Cryptography: Motivation Alice Bob AliceRSA Cryptography: Motivation BobWe need a design such that Eve can also get a supply of Bob's locks, but cannot deduce the key.RSA Cryptography: Motivation We want a function E(m, Ke
Stanford - CS - 103
Handout #38 October 29, 2008CS103A Robert PlummerMidterm Exam SolutionsThe average on the midterm was 80.0.12Midterm Histogram10Number of Students86420 35-39 40-44 45-49 50-54 55-59 60-64 65-69 70-74 75-79 80-84 85-89 90-94 95-99 100 Grade Ran
Stanford - CS - 103
CS103A HO# 37Intro to Cryptography10/29/08Cryptography: Some ReferencesDavid Kahn. The Codebreakers (1967). Simon Singh. The Code Book (1999). Niels Ferguson and Bruce Schneier. Practical Cryptography (2003). Bruce Schneier. Applied Cryptography, 2nd
Stanford - CS - 103
CS103A HO# 36 Slides-Number Theory II10/27/08Some properties of gcd If a = bq + r for integers a, b, q, and r, then gcb(a, b) = gcd(b, r). gcd(66, 45) = gcd(45, 21) Theorem 32.4 (proved in the handout)10/27/08CS103AIf you want a text: Kenneth Rosen D
Stanford - CS - 103
Handout #35 October 27, 2008CS103A Robert PlummerMathematical ProofsJohn C. Mitchell & Maggie Johnson Department of Computer Science Stanford University1. Why write proofs?According to Webster's Unabridged Dictionary, the word prove comes from the La
Stanford - CS - 103
CS103A HO# 34 Slides-Introduction to Number Theory10/24/08Outline of topics for CS103A Basic ToolsCS103A10/24/08Problem Set 7 is due Monday, 11/3.This is one class period later than the date given in the Syllabus.Formal Logic and Proof Techniques Nu
Stanford - CS - 103
Handout #33 October 24, 2008CS103A Robert PlummerProblem Set #7As we have mentioned in class, it takes practice to develop the skill of doing mathematical proofs and this problem set is meant to provide that practice. Because of the nature of the probl
Stanford - CS - 103
Handout #31 October 24, 2008CS103A Robert PlummerNumber Theory & Proving "Real" TheoremsWe have just spent weeks learning about first-order logic and how to do both formal and informal proofs in FOL. For the most part, the proofs we have done pertained
Stanford - CS - 103
Handout #32 October 24, 2008CS103A Robert PlummerNumber Theory & Proving "Real" Theorems: Part IIBasics of Number TheoryNumber theory was once thought to be "pure" mathematics math for the sake of math. But with the evolution of computers (and particu
Stanford - CS - 103
CS103AHO#29Slides-ResolutionResolution PQ Q R PRResolution PQ Q R PR Resolution is a valid rule of inference, which we can use as a proof procedure. To see how we do this, we have to remind ourselves about conjunctive normal form.Conjunctive Normal F
Stanford - CS - 103
Handout #28 October 20, 2008CS103A Robert PlummerMidterm Review SessionThe following problems will be discussed in the Midterm review session, Tuesday, Oct. 21, from 9:30 10:45 am in Gates B03. You may want to look over the problems before the session.
Stanford - CS - 103
Handout #25 October 17, 2008CS103A Robert PlummerComplete Inference Rules= Elim P(n) . n=m . P(m) = Intro . a=a . ^ Elim P1 ^ P2 . P1 P2 ^ Intro P1 . P2 . P1 ^ P2 Intro P . P P2 . S S Intro P . P Elim . P Intro P . Q Q . P PQ Intro Elim PQ P . Q PQ Eli
Stanford - CS - 103
Handout #24 October 17, 2008CS103A Robert PlummerPractice MidtermExam Rules: 1) You have 2.0 hours to complete this exam. 2) Do not include your scratch work with your exam. Please work the solutions out on another sheet of paper and then write your so
Stanford - CS - 103
CS103A HO#22 Slides-Proofs with Quantifiers10/17/08Proofs with Quantifiers Every child is right-handed or intelligent No intelligent child eats liver There is a child who eats liver and onions There is a right-handed child who eats onions Midterm Exam T
Stanford - CS - 103
Handout #23 October 17, 2008CS103A Robert PlummerProblem Set #6Due: 10/22 (Must be submitted Wednesday, 10/22-late days are not allowed on this problem set due to the midterm.) Multiple Quantifiers Notes: Hints for some of these problems are available
Stanford - CS - 103
Handout #20 October 13, 2008CS103A Robert PlummerProblem Set #5Due: 10/17 in class Logic of Quantifiers 1) Exercise 10.7 on p. 266. Explain your assessment of validity. 2) Exercise 10.9 on p. 273 3) Exercises 10.17, 10.18, 10.19 on p. 274 Multiple Quan
Stanford - CS - 103
CS103A Handout #19 Slides-Logic of Quantifiers10/13/088.38.2CS103A10/13/08Midterm Exam Thurs., Oct. 23 7 - 9 pm Location TBADescribe a world for each of these x Cube(x) x Cube(x) x (Professor(x) Smart(x) x Professor(x) x Cube(x) x Cube(x) x Smart(x)
Stanford - CS - 103
Handout #18 October 10, 2008CS103A Robert PlummerIntroduction to QuantificationPredicates Revisited We have been working with predicates since the beginning of our studies in logic. Predicate symbols are used to express some property of objects or some
Stanford - CS - 103
CS103AHO#17Slides-Quantifiers10/10/088.38.2CS103A10/10/08Midterm Exam Thurs., Oct. 23 7 - 9 pm Location TBA8.38.28.38.28.38.28.38.21CS103AHO#17Slides-Quantifiers10/10/08PQ P P P Q P Q P P Q P Q P Q P P Q Q Q PQ (P Q) (P Q)8.29Taut Con E
Stanford - CS - 103
Handout #16 October 10, 2008CS103A Robert PlummerInference Rules= Elim P(n) n=m P(m) Intro P PQ = Intro a=a Elim P1 P2 P1 P2 Intro P1 P2 P1 P2 Intro P P P2 S S Intro P P Elim P Intro P Q Q P PQ Intro Elim PQ P Q PQ Elim P Q (or Q P) P Q Elim P1 P2 P1
Stanford - CS - 103
Handout #14 October 8, 2008CS103A Robert PlummerProblem Set #4Due: 10/13 in class You may use Taut Con for the Law of the Excluded Middle in this problem set (but not for anything else).Conditional/Biconditional Proofs 1) Exercises 8.26, 8.27 on p. 21
Stanford - CS - 103
CS103A HO#15 Slides-Conditionals10/8/08ConditionalsConditionalsP T T F FQ T F T FP ? Q T F T TP T T F FQ T F T FP ? Q T F T TP Q T F T TObservation 1: The ? connective is pretty weak. Knowing that P ? Q is true only eliminates one possible comb
Stanford - CS - 103
Handout #13 October 8, 2008CS103A Robert PlummerProof StrategiesWhere To Start? As you begin a proof, convince yourself that the conclusion is indeed true by studying the premises and understanding their meaning: Analyze the structure of each premise a
Stanford - CS - 103
CS103A HO#12 Slides-Fitch Examples10/6/08Proof of Resolution Principle AB BC A AC B B AC C AC AC AC Intro Intro Elim Intro Elim Elim (Proof 6.19)Two Ways To Use ContradictionsProof by Contradiction (Intro) Negation Elimination (Elim)6.9 Cube(b) (Cube
Stanford - CS - 103
Handout #11 October 3, 2008CS103A Robert PlummerProblem Set #3Due: 10/8 in class This problem set is more challenging and time-consuming than the previous two be sure to allocate enough time! Also, be sure to read the instructions for each group of pro
Stanford - CS - 103
CS103AHO#9Consequence10/1/08Tautologies / Logical Necessity / Logical PossibilityTautologies / Logical Necessity / Logical Possibility As we've seen, some things are possible in a truth table that are not possible in Tarski's World.Tet(a) Cube(a) Do
Stanford - CS - 103
CS103A HO# 8 Boolean Connectives9/29/08Truth Tables for Boolean ConnectivesNegation P P T F F T P T T F F P T T F F Q T F T F Q T F T F PQ T T T F PQ T F F F P is true if and only if P is false.Truth Tables for Boolean ConnectivesConjunction P T T F
Stanford - CS - 103
Handout #7 September 29, 2008CS103A Robert PlummerProblem Set #2Due: 10/3 in class (electronic submission must be done before class) You should work on these problems as the material is covered in class and in reading assignments. Leaving it all till t