Final Exam Flashcards
A countable set
Discrete set
A declarative sentence that is true or false, but not both
Proposition
A propositional form that is always true, denoted t
Tautology
A propositional form that is always false, denoted c
Contradiction
An argument where every case the premise (hypothesis) is proven true, the conclusion is also true
Valid argument
An integer n is ________ iff ∃k ε Z s.t. n = 2k.
Even integer
An integer n is ________ iff ∃k ε Z s.t. n = 2k + 1.
Odd integer
An integer n is ________ iff n > 1 and it has no positive divisor other than 1 and itself.
i.e. iff n > 1 and ∀r,s ε Z+ if n = r * s then r = 1 or s = 1.
Prime
An integer is __________ iff n > 1 and n is not prime.
i.e. iff n > 1 and ∃r,s ε Z+ s.t. n = r * s but r ≠ 1 and s ≠ 1.
Composite
r ε R is called a _____________ iff ∀a,b ε Z s.t. r = a/b and b ≠ 0.
Rational number
∀n ε Z ∀d ε Z s.t d ≠ 0 ______________, denoted d | n iff ∃k ε Z s.t. n = dk.
d divides n
Any integer n s.t. n > 1 is either a prime or it can be uniquely written as a product of primes in a non-decreasing order.
Fundamental Theorem of Arithmetic (FTA)
∀n ε Z ∀d ε Z+ ∃! q, r ε Z s.t. n = dq + r and 0 ≤ r < d
Quotient Remainder Theorem
An unordered collection of elements.
A set
A set A is a subset iff every element of A is also in B.
A ⊆ B