Math1a Set 1 Solutions
|
|
- Sharleen Richards
- 5 years ago
- Views:
Transcription
1 Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also a multiple of 7, i.e. y x. (iii) If x y and y z then there exist k, l Z such that x y = 7k, y z = 7l and consequently x z = (x y)+(y z) = 7k +7l = 7(k +l) is also a multiple of 7. So, x z. Therefore, satisfies all axioms of an equivalence relation. (b) We will show that S = {0, 1, 2, 3, 4, 5, 6} is a set of representatives for Y = X/. To prove that S is a set of representatives, one has to show 1. Elements of S are pairwise inequivalent; 2. Every integer is equivalent to one element of S. Now we show these two for S 1. The difference between two different elements of S is never a multiple of 7. This means that elements of S are pairwise inequivalent. 2. Given any integer n, we may write (by division by 7) n = 7a + r, with a, r Z, such that the remainder r satisfies: 0 r 6, i.e. r S. Since n r is a multiple of 7, we know that n r. So, any integer n is equivalent to one element of S. We showed that S is a set of representatives for Y = X/. Hence the cardinality of Y is equal to the cardinality of S, which is 7. Problem 2. The method of contrapositive is to prove P = Q by showing Q = P. Let a, b Z. We are to show that if 1
2 (i) ab even either a or b is even (ii) ab odd both a and b are odd (i): To use the method of contrapositive for this problem, we let P be the statement that ab is even, and let Q be the statement that either a or b is even. Note that: 1. P is the statement that ab is not even, or equivalently ab is odd. 2. Q is the statement that neither a nor b is even, or equivalently a and b are both even. By the method of contrapositive, to prove this problem we have to show that Q = P, or equivalently if both a and b are odd, then ab is odd. We show this now. If both a and b are odd, then there are k, l Z such that a = 2k + 1, b = 2l + 1. Then ab = (2k + 1)(2l + 1) = 4kl + 2k + 2l + 1 = 2(2kl + k + l) + 1 is also odd. (ii): To use the method of contrapositive for this problem, we let P be the statement that ab is odd, and let Q be the statement that a and b are both odd. Note that: 1. P is the statement that ab is not odd, or equivalently ab is even. 2. Q is the statement that either a or b is not odd, or equivalently either a or b is even. By the method of contrapositive, to prove this problem we have to show that Q = P, or equivalently if either a or b is even, then ab is even. We show this now. If either a or b is even, we may assume a is even (the case of b being even can be done identically swapping the names of a and b). So, there is a k Z such that a = 2k. This means ab = 2kb, i.e. ab is even. Problem 3. Set up for the proof by contradiction: to prove the statement of the problem by contradiction, we keep the conditions (i.e. x and y are positive integers), but we assume the opposite of what we are trying to prove (ie. that there exist such x and y satisfying the equation x 2 y 2 = 2). 2
3 Factorization: We have x 2 y 2 = 2, so we can factorize both the left and right hand sides. The left side factorizes as (x y)(x + y) and since both x and y are positive integers, it follows x y is an integer (could be negative!) and x+y is a positive integer. Thus, we need to factorize 2 into two integers at least one of which is positive. This can only be done as 1 2 or 2 1. Reaching a contradiction: The two factorisations of 2 lead to the two systems of equations: x y = 2, x + y = 1, or x y = 1, x + y = 2. Both of them yield 2x = 3, so there is no solution where x is an integer, so we contradict our condition on x. Therefore, we conclude by saying our assumption must have been wrong and therefore, there do not exist positive integers x and y such that x 2 y 2 = 2. Replacing 2 by 2n: We proceed exactly as before. Let x and y be positive integers and assume there exists a solution to x 2 y 2 = 2n for some n odd. Factorizing as before gives (x y)(x+y) = 2n. Again, x y and x+y are integers. As the left hand side is the product of two integers, we should factorize the 2n into two integers, say p q. (Be careful here, there may be more factorisations than just 2 n or n 2.) Since 2n is even, at least one of p or q is even. If both p and q are even then 2n = p q is divisible by 4 which is not the case since n is odd. So, exactly one of p and q is even and the other is odd. Recall that the sum of an even integer and an odd integer is odd. But then 2x = (x y) + (x + y) = p + q is odd. So, x is again not an integer contradicting the condition on x. So, we conclude that our assumption was wrong and indeed there do not exist positive integers x and y such that x 2 y 2 = 2n where n is odd. Problem 4. [Note: a key fact that is used in the problem is the following. m is a positive integer such that m 2 n = m n for all positive integer n, iff m is square-free. In particular, this applies when m is a prime number. It is important in your solutions to make note that you understand that this is true for primes as it is not true for all numbers, for example m = 4.] To prove the statement of the problem by contradiction, we assume the opposite of what we are trying to prove (ie. that 14 is rational). We now use this fact to reach a contradiction. Since we have assumed 14 is rational, we can write it as the ratio of two integers, ie. 14 = a where a, b Z and b 0. If a is negative, then b must be too, so we can multiply a and b by 1 to make it a ratio of positive integers. In the same vein, if a and b have a positive integer divisor d in common, we can divide the numerator and denominator by d and still have 14 as the ratio of positive integers. Thus, b 3
4 the natural conclusion is to divide through by the greatest common divisor of a and b leaving 14 as the ratio of two positive integers with no positive integer factor in common other than 1. Hence, 14 = A B where A, B N and gcd(a, B) = 1 (We have ignored the possibility A = 0 since 14 0). Rearranging and squaring yields 14B 2 = A 2. The left hand side is divisible by 2, so the right hand side must be as well. Thus, 2 divides A 2 and hence 2 divides A as 2 is prime. We may write A = 2C where C is a positive integer. Substituting in gives 14B 2 = 4C 2. Dividing by 2 yields 7B 2 = 2C 2. The right hand side is divisible by 2, so the left hand side must be too. Since 2 does not divide 7, it must divide B 2 and hence 2 divides B since 2 is prime. So, we can write B = 2D where D is a positive integer. However, note that therefore, both A and B have a common divisor of 2 which contradicts the fact that gcd(a, B) = 1. So, our assumption is wrong and in fact, 14 is irrational. Before we continue to the second part of the problem, note that if we add, multiply, subtract, or divide two rational numbers, we again get a rational number. The second part of the problem requires us to show that 2+ 7 is irrational. Again, we proceed with a proof by contradiction. Assume is rational. So, write = A B where A, B Z and B 0 (we could again insist that gcd(a, B) = 1, but it actually will not be necessary). Then B( 2 + 7) = A, which after squaring yields B 2 ( ) = A 2. We now want to isolate the 14, so subtracting 9B 2 and dividing by 2B 2 (which is nonzero because B 0) gives 14 = A 2 9B 2 2B 2. Note that the numerator is an integer as A, B and 9 are. Moreover, the denominator is a non-zero integer since B 0. So, we have written 14 as a ratio of an integer with a non-zero integer. So we conclude 14 is rational which contradicts the first part of this problem where we proved 14 is actually irrational. So, we conclude that our assumption was false and indeed it follows that is irrational. Problem 5. The proposition we are going to prove is the following: P(n): Given polynomial f of degree n and real number b, there exists a polyno- 4
5 mial g of degree n 1 and a real number c such that f(x) = (x b)g(x) + c. In this form, we can prove this using induction on n, the degree of our polynomial. One must start with the base case, which entails proving the statement for n = 1. Base Case: We want to show that if f(x) = a 1 X + a 0, with a 0, a 1 R, and b R, we can find a degree n 1 = 0 polynomial (i.e. a constant, say g R), and c R, such that f(x) = (x b)g + c. We can actually just solve this by equating polynomials: a 1 x + a 0 = gx bg + c. This yields g(x) = g = a 1 and c = a 0 + bg = a 0 + ba 1. Inductive Step: To complete this step, one must prove that the statement is true for n = k + 1 assuming it is true for all n k. First, we assume that for all n k, for any degree n polynomial f and real number b, there is a degree n 1 degree polynomial g and real number c such that f(x) = (x b)g(x) + c. (1) Next, we look at an arbitrary k + 1 degree polynomial F (x) = α k+1 x k+1 + α k x k + + α 0. Now for arbitrary b R, we can observe that: F (x) = x(α k+1 x k + α k x k α 1 ) + α 0. (2) Notice that inside the brackets in Equation 2, is the degree k polynomial: α k+1 x k + α k x k α 1. So, we can apply Equation 1, which tells us that there is a degree k 1 polynomial g(x) and c R such that α k+1 x k + α k x k α 1 = (x b)g(x) + c. (3) Substituting Equation 3 into Equation 2 yields F (x) = x((x b)g(x) + c) + α 0. (4) We are not done as Equation 4 is not in the form of the proposition. We are looking for a degree k polynomial G and a real number C such that F (x) = (x b)g(x) + C. (5) Like in the base case, we attempt to solve for G and C simply using polynomial equality. In particular, using Equations 4 and 5 gives us (x b)g(x) + C = x((x b)g(x)) + c) + α 0 = (x b)(xg(x)) + cx + α 0 = (x b)(xg(x) + c) + cb + α 0. So, setting G(x) = xg(x) + c and C = cb + α 0 gives the required G and C and the induction is complete. 5
6 Hence, by the principle of mathematical induction, given polynomial f of degree n and real number b, there exists a polynomial g of degree n 1 and a real number c such that f(x) = (x b)g(x) + c. The second part of the problem requires us to show that b is a root of f iff c = 0. This is now much easier after having completed the induction. (only if direction): Suppose b is a root of of f. Then f(b) = 0, so (b b)g(b)+ c = 0 which simplifies to c = 0. (if direction): Suppose c = 0, then f(x) = (x b)g(x). Then f(b) = (b b)g(b) = 0, so b is a root of f. Variations on the inductive step in Problem 5 There are a couple of variations to the proof of the induction step worth mentioning. First of all, one could eliminate the top term by writing F (X) = α k+1 x k (x b) + (α k + bα k+1 )x k + α k 1 x k α 1 + α 0. Then notice that (α k + bα k+1 )x k + α k 1 x k α 1 + α 0 is of degree at most k, so we can apply the inductive step here: (α k + bα k+1 )x k + α k 1 x k α 1 + α 0 = (x b)g(x) + c. Then, F (x) = α k+1 x k (x b)+(x b)g(x)+c = (x b)(g(x)+α k+1 x k )+c. So, G(x) = g(x) + α k+1 x k and C = c satisfy the requirements. Another variation is to first prove that for single term polynomials of the form x n, for any b R, there exists some degree n 1 polynomial, h(x), and c R such that x n = (x b)h(b)+c. The induction step in this proof can be done by writing x k+1 = x x k = x(x b)h(x)+cx = (x b)(xh(x)+c)+bc. Next, we can observe that the sum of degree k polynomial and degree < k polynomials is also a degree k polynomial. Also, that a nonzero scalar product of a degree n polynomial is also degree n. Now, the induction step of the original problem can be proven by applying the first step. Denote F 1 (x) = α n x n and F 2 (x) = α n 1 x n α 0 (which is not necessarily a degree n 1 polynomial as α n 1 could be 0). Then F (x) = F 1 (x) + F 2 (x) = (x b)h(x) + c 1 + (x b)g(x) + c 2, where h(x) is a degree n 1 polynomial, and g(x) is of degree at most n 2, hence g(x) + h(x) is a degree n 1 polynomial. 6
Twitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
More information( 3) ( ) ( ) ( ) ( ) ( )
81 Instruction: Determining the Possible Rational Roots using the Rational Root Theorem Consider the theorem stated below. Rational Root Theorem: If the rational number b / c, in lowest terms, is a root
More informationMultiplication of Polynomials
Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationx 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?
1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationPolynomial and Rational Functions. Copyright Cengage Learning. All rights reserved.
2 Polynomial and Rational Functions Copyright Cengage Learning. All rights reserved. 2.3 Real Zeros of Polynomial Functions Copyright Cengage Learning. All rights reserved. What You Should Learn Use long
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationSYMBOL NAME DESCRIPTION EXAMPLES. called positive integers) negatives, and 0. represented as a b, where
EXERCISE A-1 Things to remember: 1. THE SET OF REAL NUMBERS SYMBOL NAME DESCRIPTION EXAMPLES N Natural numbers Counting numbers (also 1, 2, 3,... called positive integers) Z Integers Natural numbers, their
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationMath 261 Exercise sheet 5
Math 261 Exercise sheet 5 http://staff.aub.edu.lb/~nm116/teaching/2018/math261/index.html Version: October 24, 2018 Answers are due for Wednesday 24 October, 11AM. The use of calculators is allowed. Exercise
More informationSection 2.4: Add and Subtract Rational Expressions
CHAPTER Section.: Add and Subtract Rational Expressions Section.: Add and Subtract Rational Expressions Objective: Add and subtract rational expressions with like and different denominators. You will recall
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More information3.6. Disproving Quantified Statements Disproving Existential Statements
36 Dproving Quantified Statements 361 Dproving Extential Statements A statement of the form x D, P( if P ( false for all x D false if and only To dprove th kind of statement, we need to show the for all
More informationChapter Five Notes N P U2C5
Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have
More informationPolynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:
Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationMath 0310 Final Exam Review
MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the linear equation and check the solution. 1) 13(x - 52) = 26 1) A) {26} B) {52} C) {50} D)
More informationSelected Math 553 Homework Solutions
Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that
More informationMath 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2
Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationAlgebra I. Book 2. Powered by...
Algebra I Book 2 Powered by... ALGEBRA I Units 4-7 by The Algebra I Development Team ALGEBRA I UNIT 4 POWERS AND POLYNOMIALS......... 1 4.0 Review................ 2 4.1 Properties of Exponents..........
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationHomework #2 Solutions
Homework # Solutions Thayer Anderson, Davis Lazowski, Handong Park, Rohil Prasad Eric Peterson 1 For submission to Thayer Anderson Problem 1.1. Let E denote the extended reals: E := R {, }. The usual arithmetic
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationCh 4.2 Divisibility Properties
Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationChapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers
Fry Texas A&M University! Fall 2016! Math 150 Notes! Section 1A! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {2, 4, 6, 8, 10, 12, 14, 16,...} and let B = {3, 6, 9, 12, 15, 18,
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationChapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010
Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationWhich one of the following is the solution to the equation? 1) 4(x - 2) + 6 = 2x ) A) x = 5 B) x = -6 C) x = -5 D) x = 6
Review for Final Exam Math 124A (Flatley) Name Which one of the following is the solution to the equation? 1) 4(x - 2) + 6 = 2x - 14 1) A) x = 5 B) x = -6 C) x = -5 D) x = 6 Solve the linear equation.
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationNotes for Math 345. Dan Singer Minnesota State University, Mankato. August 23, 2006
Notes for Math 345 Dan Singer Minnesota State University, Mankato August 23, 2006 Preliminaries 1. Read the To The Student section pp. xvi-xvii and the Thematic Table of Contents. 2. Read Appendix A: Logic
More informationArithmetic, Algebra, Number Theory
Arithmetic, Algebra, Number Theory Peter Simon 21 April 2004 Types of Numbers Natural Numbers The counting numbers: 1, 2, 3,... Prime Number A natural number with exactly two factors: itself and 1. Examples:
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationSolutions 2017 AB Exam
1. Solve for x : x 2 = 4 x. Solutions 2017 AB Exam Texas A&M High School Math Contest October 21, 2017 ANSWER: x = 3 Solution: x 2 = 4 x x 2 = 16 8x + x 2 x 2 9x + 18 = 0 (x 6)(x 3) = 0 x = 6, 3 but x
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
More informationAnalysis I (Math 121) First Midterm Correction
Analysis I (Math 11) First Midterm Correction Fall 00 Ali Nesin November 9, 00 1. Which of the following are not vector spaces over R (with the componentwise addition and scalar multiplication) and why?
More information6x 3 12x 2 7x 2 +16x 7x 2 +14x 2x 4
2.3 Real Zeros of Polynomial Functions Name: Pre-calculus. Date: Block: 1. Long Division of Polynomials. We have factored polynomials of degree 2 and some specific types of polynomials of degree 3 using
More informationa factors The exponential 0 is a special case. If b is any nonzero real number, then
0.1 Exponents The expression x a is an exponential expression with base x and exponent a. If the exponent a is a positive integer, then the expression is simply notation that counts how many times the
More informationHomework 3, solutions
Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More information3.4. ZEROS OF POLYNOMIAL FUNCTIONS
3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationChapter 8. Exploring Polynomial Functions. Jennifer Huss
Chapter 8 Exploring Polynomial Functions Jennifer Huss 8-1 Polynomial Functions The degree of a polynomial is determined by the greatest exponent when there is only one variable (x) in the polynomial Polynomial
More informationZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS
ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental
More informationA group of figures, representing a number, is called a numeral. Numbers are divided into the following types.
1. Number System Quantitative Aptitude deals mainly with the different topics in Arithmetic, which is the science which deals with the relations of numbers to one another. It includes all the methods that
More informationA Level Maths. Induction Booklet CONTENTS
A Level Maths Induction Booklet CONTENTS Chapter 1 Removing brackets page Chapter Linear equations page 4 Chapter 3 Simultaneous equations page 8 Chapter 4 Factors page 10 Chapter 5 Change the subject
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationMathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) May 2010
Link to past paper on OCR website: http://www.mei.org.uk/files/papers/c110ju_ergh.pdf These solutions are for your personal use only. DO NOT photocopy or pass on to third parties. If you are a school or
More informationAMB111F Notes 1: Sets and Real Numbers
AMB111F Notes 1: Sets and Real Numbers A set is a collection of clearly defined objects called elements (members) of the set. Traditionally we use upper case letters to denote sets. For example the set
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationSCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING. Self-paced Course
SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING Self-paced Course MODULE ALGEBRA Module Topics Simplifying expressions and algebraic functions Rearranging formulae Indices 4 Rationalising a denominator
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationThere are seven questions, of varying point-value. Each question is worth the indicated number of points.
Final Exam MAT 200 Solution Guide There are seven questions, of varying point-value. Each question is worth the indicated number of points. 1. (15 points) If X is uncountable and A X is countable, prove
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More informationPolynomial and Rational Functions. Chapter 3
Polynomial and Rational Functions Chapter 3 Quadratic Functions and Models Section 3.1 Quadratic Functions Quadratic function: Function of the form f(x) = ax 2 + bx + c (a, b and c real numbers, a 0) -30
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationAn Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt
An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Field Axioms Finite Fields Field Extensions Class 5: Fields and Field Extensions 1 1. Axioms for a field
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More information(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a.
Math 299 Midterm 2 Review Nov 4, 2013 Midterm Exam 2: Thu Nov 7, in Recitation class 5:00 6:20pm, Wells A-201. Topics 1. Methods of proof (can be combined) (a) Direct proof (b) Proof by cases (c) Proof
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationMATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationCHAPTER 1. Review of Algebra
CHAPTER 1 Review of Algebra Much of the material in this chapter is revision from GCSE maths (although some of the exercises are harder). Some of it particularly the work on logarithms may be new if you
More informationSection September 6, If n = 3, 4, 5,..., the polynomial is called a cubic, quartic, quintic, etc.
Section 2.1-2.2 September 6, 2017 1 Polynomials Definition. A polynomial is an expression of the form a n x n + a n 1 x n 1 + + a 1 x + a 0 where each a 0, a 1,, a n are real numbers, a n 0, and n is a
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationNotes: Pythagorean Triples
Math 5330 Spring 2018 Notes: Pythagorean Triples Many people know that 3 2 + 4 2 = 5 2. Less commonly known are 5 2 + 12 2 = 13 2 and 7 2 + 24 2 = 25 2. Such a set of integers is called a Pythagorean Triple.
More informationEquations and Inequalities
Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More information