CSC165H1 Lecture Notes - Lecture 6: Natural Number, Formal Proof

33 views2 pages
cherryberry1035 and 38883 others unlocked
CSC165H1 Full Course Notes
3
CSC165H1 Full Course Notes
Verified Note
3 documents

Document Summary

Steps in proof process: identify 2) translate to predicate logic 3) informal discussion 4) formal proof d|n: " Wts x|5 true since for k = 1 is true. If lhs of of is true need to nd k" such that is false, is vacuously true if lhs of is true then. To show rhs: proof let be an arbitrary integer and assume x|(x + 5) Then 5 = kx - x =(k - 1)x let k" = k - 1. Proof: as above, replace 5 by d but start with let. A natural number p is prime when it is greater than 1 and the only natural numbers that divide it are 1 and itself(p) Also consider: true 2) given 3) suppose. Assume prime (p) and also x|(x + p) to make by hypothesis true. Wts x = 1 or x = p is true.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions