CSE 20 * Discrete Mathematics
... Basis step: Show the theorem holds for n=2. Inductive step: Assume that for some n2, all integers 2kn are divisible by a prime. WTS that n+1 is divisible by a prime. Proof by cases: Case 1: n+1 is prime. n+1 divides itself so we are done. Case 2: n+1 is composite. Then n+1=ab with 1
... Basis step: Show the theorem holds for n=2. Inductive step: Assume that for some n2, all integers 2kn are divisible by a prime. WTS that n+1 is divisible by a prime. Proof by cases: Case 1: n+1 is prime. n+1 divides itself so we are done. Case 2: n+1 is composite. Then n+1=ab with 1
Set-Builder Notation
... expressed as the quotient of two integers, a, b, b ≠ 0. {a/b | a and b are integers, b ≠ 0} – Irrational numbers: any number that CANNOT be expressed as the quotient of two integers. – Real numbers: any number that lies on the number line. ...
... expressed as the quotient of two integers, a, b, b ≠ 0. {a/b | a and b are integers, b ≠ 0} – Irrational numbers: any number that CANNOT be expressed as the quotient of two integers. – Real numbers: any number that lies on the number line. ...
Advanced Algebra II Semester #1 Review Questions Handout
... problems and help each other out when someone doesn’t understand a problem/concept. Explaining the material to someone else is a great way to master concepts. Finally, I have all of the lectures on my hard drive if you need to listen to my explanations of certain topics one more time. Bring me a fla ...
... problems and help each other out when someone doesn’t understand a problem/concept. Explaining the material to someone else is a great way to master concepts. Finally, I have all of the lectures on my hard drive if you need to listen to my explanations of certain topics one more time. Bring me a fla ...
