This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: using more of the denition
You may have been disappointed that the last proof used only part of the denition of oor. Here's a symbolic rewriting of the denition of oor: V PR
x y = x D y P Z y x (V P Z
z ;z x A z y ) The full version of the denition should prove useful to prove: V PR x ; x > x 1 slide 7 prove something is false
Dene a sequence: = n=2 (of course, if you treat \/" as integer division, there's no need to take the oor. Now consider the claim: Wi P N; Vj P N; j > i A aj = ai The claim is false. Disprove it.
n an V PN slide 9 cases
Sometimes your argument has to split to take into account possible properties of your generic element: Vn P N; n2 + n is even A natural approach is to factor n2 + n as n(n + 1), and then consider the case where n is odd, then the case where n is even. slide 11 ...
View
Full
Document
This note was uploaded on 10/13/2011 for the course COMPUTER S CSC 165 taught by Professor Dannyheap during the Fall '10 term at University of Toronto Toronto.
 Fall '10
 DannyHeap
 Computer Science

Click to edit the document details