NSF Flashcards
What is a Statement?
A statement or assertion is an expression which can be a complete sentence by itself, and is either true or false.
What is a Negation?
If P is a statement, the negation of P is the statement “not P” (that is “P is false”)
What is an Implication?
Suppose that P and Q are statements. The statement “If P then Q” is called an implication. It is false if P is true and Q is false. Otherwise it is true. We write P ⇒ Q to mean “If P then Q”.
What is a converse?
The converse of P ⇒ Q is the implication Q ⇒ P
What is the contrapositive?
The contrapositive of P ⇒ Q is the implication (not Q) ⇒ (not P)
What is a counterexample?
to disprove a “for all” statement, you need to give an example for which the statement isn’t true
What is divisibility?
Suppose d, n ∈ N. We say that d divides n if there exists some k ∈ N with n = dk. We write d | n to mean that d divides n.
What is a prime number?
n is prime if n > 1 and n has no factors except 1 and n
What is a composite number?
n is composite if n > 1 and n is not prime.
What is prime factorisation?
every natural number n can be written as a product of primes, and this “prime factorisation” is unique (up to re-ordering)
What is the Fundamental Theorem of Arithmetic?
The fact that prime factorisation is unique up to re-ordering
What is the greatest common divisor?
The greatest common divisor of a and b is the largest natural number d
such that d | a and d | b. We write gcd(a, b) for the greatest common divisor of a and b.
What does it mean to be coprime?
We say that a and b are coprime if gcd(a, b) = 1. This means they have no common factors except 1
What is the lowest common multiple
The lowest common multiple of a and b is the smallest m ∈ N such that a | m and b | m. We write lcm(a, b) for the lowest common multiple of a and b
How do you calculate the lcm(a,b)
ab/gcd(a,b)
What is the Cartesian product?
If A and B are sets, the Cartesian product of A and B is the set of all ordered pairs (a, b) with
a ∈ A and b ∈ B. We denote this by A × B
What is the cardinality of a set?
If A is a finite set then the cardinality of A is the number of elements it contains
What is a Power set?
If X is a set, we define the power set of X to be the set of all subsets of X. It is denoted by P(X)
Theorem 5.2 cardinality of a power set
Suppose X is a finite set, and |X| = n. Then |P(X)| = 2^n
What is a function?
Let A and B be sets. A function from A to B is a rule which assigns an element of B to each element of A