Skip to content

Instantly share code, notes, and snippets.

@joshuaaguilar20
Created June 26, 2019 16:37
Show Gist options
  • Save joshuaaguilar20/809ccb38aa034e5871f122677a29e73b to your computer and use it in GitHub Desktop.
Save joshuaaguilar20/809ccb38aa034e5871f122677a29e73b to your computer and use it in GitHub Desktop.
Tom Leighton's MIT Mathmatical Proofs Course Week 1

Predicate: Proposition whos truth depends on the value of the variable, Prime Numbers: used to Break RSA Encrytions Implication: p => q if p is false or q is true = will be true False Implys Anything is True* (if Pigs could fly I would be king ) Proposition - True or False

Truth Table p|q| p => q | q <=> p| p <==> q| T|T|T| | T | T T|F|F| | T | F F|T|T| | F | F F|F|T| | T |T

  1. Axioms: Are Propositions we Assume are True ⋅⋅*Must be Consistant and Complete ..*Set of Axioms is consistant if No proposition can be true or false ..*Set of Axioms is complete if you can prove every propistion as eather true or false

Symbols <=> - if any only if must check both ways for it

Famous Conjectors Reamon Hypothisis Goldbacks Conjecter - Regions in map (google it for details)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment