Fichas
Chapter 0
Fichas del conjunto (8)
- 1Well Ordering PrincipleEvery nonempty set of positive integers contains a smallest member.
- 2Division AlgorithmLet a and b be integers with b > 0. Then there exist unique integers q and r for which a = bq + r and
0 ≤ r < b. - 3GCD is a linear combinationFor any nonzero integers a and b, there exist integers
s and t for which gcd(a,b) = as + bt.
Furthermore, gcd(a,b) is the smallest positive integer of the form as + bt. - 4Euclid’s LemmaFor prime p, p | ab (integer a and b) implies
p | a or p | b. - 5Fundamental Theorem of ArithmeticEvery integer greater than 1 is a prime or a product of primes. This product is unique, except for the order in which factors appear.
- 6First Principle of Mathematical InductionLet S be a set of integers containing a. Suppose that S has the property that whenever some integer n ≥ a belongs to S, then the integer n + 1 also belongs to S. Then S contains every integer greater than or equal to a.
- 7Second Principle of Mathematical Induction (strong form)Let S be a set of integers containing a. Suppose that S has the property that whenever some integer n ≥ a belongs to S, then every integer less than n and greater than a also belongs to S. Then S contains every integer greater than or equal to a.
- 8Equivalence relation on a set SA set R of ordered pairs of elements of S such that
(1) for all a in S (reflexive property).
(2) implies for all a, b in S
(symmetric property).
(3) and imply
for all a, b, c in S (transitive property).
Información
- Descripción
- Fichas sobre Chapter 0 , creado por MathGirl88 el 19/10/2014.
- Creado por
- MathGirl88
- Visitas
- 6
- Valoración