# Math 140a - HW 1 Solutions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Math 140a - HW 1 Solutions Problem 1 (WR Ch 1 #1). If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Given that r is rational, we can write r = a b for some integers a and b. We are also given that x is irrational. From here, we proceed with a proof by contradiction. We first assume that r + x is rational, and then we use this fact in some way to show that x is rational, contradicting one of the facts we were given. This will prove that r + x is instead irrational. So if r + x is rational, we can write r + x = c d for some relatively prime integers c and d. But then x = c d r = c d a bc ad =, b bd and thus x is rational, which is a contradiction. Therefore, r + x is irrational. Next, we prove that rx is irrational using a similar contradiction proof. Assume that rx is rational. Then we can write rx = c d for some integers c and d. But then x = c rd = c a b d = bc ad, and thus x is rational, which is a contradiction. Therefore, rx is irrational. Problem 2 (WR Ch 1 #2). Prove that there is no rational number whose square is 12. Solution. Let x be a rational number such that x 2 = 12. Then we can write x = a b, and furthermore, we can choose a and b to be relatively prime (which means there is no prime number dividing both a and b), so that the fraction a b little algebraic manipulation, 12 = x 2 = a2 b 2 = 12b 2 = a 2. is written in lowest terms. With a Now, the prime factorization of 12 is , so since there is an odd number of factors of 3 (just 1), we ll concentrate on 3 and how it divides both sides of the equation 12b 2 = a 2. Notice that 3 divides the left side since it has a factor of 12. Therefore, 3 must divide the right side of the equation, a 2. From here, the crucial step is realizing that if 3 divides a 2, then it must also divide a. This is because if we factor a 2 into its prime factors, saying that 3 divides a 2 is equivalent to saying that 3 is one of those prime factors, but a square of an integer must have an even number of each factor (it can t have just 1), so that means 3 2 must divide a 2, and 3 must divide a. Since we have shown that 3 2 divides the right side, 3 2 must divide the left side, but there is only one factor of 3 in 12, so that means 3 divides b 2. Using the same logic as before, this means that 3 must divide b. 1

2 Therefore, we have shown that 3 divides both a and b, but this contradicts the fact that we already chose a and b to be relatively prime (so that a b would be expressed in lowest terms). Since our initial assumption leads to a contradiction, we have instead that there is no rational number whose square is 12. Problem 3 (WR Ch 1 #7). Fix b > 1, y > 0, and prove that there is a unique real x such that b x = y, by completing the following outline. (This is called the logarithm of y to the base b.) (a) For any positive integer n, b n 1 n(b 1). Solution. First, we factorize the left hand side: b n 1 = (b 1)(b n 1 + b n b 2 + b + 1). Then, since b > 1, we know that b n 1 + b n b 2 + b + 1 n. So b n 1 = (b 1)(b n 1 + b n b 2 + b + 1) (b 1)n. (b) Hence b 1 n(b 1/n 1). Solution. If b > 1 then b 1/n > 1, so since we proved that b n 1 n(b 1) for any b > 1, we can substitute b 1/n for b in that equation to get that b 1 n(b 1/n 1). (c) If t > 1 and n > (b 1)/(t 1), then b 1/n < t. Solution. n > (b 1)/(t 1) implies that n(t 1) > (b 1). Using the previous result for the second inequality, n(t 1) > (b 1) n(b 1/n 1). Therefore, n(t 1) > n(b 1/n 1). Dividing by n 0 we have that t 1 > b 1/n 1. Then we add 1 to both sides to get the result. (d) If w is such that b w < y, then b w+(1/n) < y for sufficiently large n; to see this, apply part (c) with t = y b w. Solution. First of all, b w < y implies that yb w > 1. Therefore, for t = yb w, we have t > 1, so if we also choose some n > b 1 yb w 1 we can then use part (c) to get that b 1/n < t = b 1/n < yb w = b w+(1/n) < y. 2

3 (e) If b w > y, then b w (1/n) > y for sufficiently large n. Solution. First of all, b w > y implies that y 1 b w > 1. Therefore, for t = y 1 b w, we have t > 1, so if we also choose some n > b 1 y 1 b w 1 we can then use part (c) to get that b 1/n < t = b 1/n < y 1 b w = y < b w (1/n). (f) Let A be the set of all w such that b w < y, and show that x = sup A satisfies b x = y. Solution. To show that b x = y, we will first show that b x is not greater than y and then show that it is not less than y. Assume (by way of contradiction) that b x > y. Then by part (e), there is some integer n such that b x (1/n) > y. However, this means that x (1/n) is an upper bound for A, but since x (1/n) < x, this means that x is not the least upper bound, a contradiction of the definition of x as the supremum of A. Therefore, instead we have that b x is not greater than y, or equivalently, b x y. Next assume (by way of contradiction) that b x < y. Then by part (d), there is some integer n such that b x+(1/n) < y. However, this means that x + (1/n) A, but x < x + (1/n), which means that x is not an upper bound, a contradiction of the definition of x as the supremum of A. Therefore, instead we have that b x is not less than y, or equivalently, b x y. (g) Prove that this x is unique. Solution. Assume there is some other z R such that y = b z. Then b x = y = b z. If we assume that x z, then either x > z or z > x. In the first case, we divide both sides of the above equation by b z to get b x z = 1 (and note that x z is a positive real number). However, b > 1, so that b w > 1 for any positive real number w, contradicting the fact that b x z = 1. In the second case, we divide both sides of the above equation by b x to get b z x = 1 (and note that z x is a positive real number). However, b > 1, so that b w > 1 for any positive real number w, contradicting the fact that b x z = 1. Problem 4 (WR Ch 1 #9). Suppose z = a + bi, w = c + di. Define z < w if a < c, and also if a = c but b < d. Prove that this turns the set of all complex numbers into an ordered set (This type of order relation is called a dictionary order, or lexicographic order, for obvious reasons.) Does this ordered set have the least-upper-bound property? Solution. To prove that < is an order on the set of all complex numbers, we need to check the two axioms of an ordered set. 3

4 The first is that for any z, w C, one and only one of the statements z < w, z = w, or z > w is true. To show that this is true, we need to break the proof up into cases using the first axiom of the usual ordering for real numbers: Case 1 : a < c. This results in z < w. Case 2 : a = c. Here we are again essentially using the first axiom of the usual ordering for real numbers. We must have exactly one of the following cases: b < d, b = d, or b > d. From here, b < d if and only if z < w; b = d if and only if z = w; and b > d if and only if z > w. Case 3 : a > c. This results in z > w. Next we prove the second axiom, which is that for any z, y, w C, z < y and y < w = z < w. For notation, let y = e + fi. Then if z < y we know that either a < e or a = e and b < f. Likewise, if y < w we know that either e < c or e = c and f < d. This give us four possible cases to check: Case 1 : a < e and e < c. By the transitive property of the usual ordering for the real numbers, we then know that a < c, which implies that z < w. Case 2 : a < e and e = c. Then a < c, which implies that z < w. Case 3 : a = e and e < c. Then a < c, which implies that z < w. Case 4 : a = e and e = c, with b < f and f < d. Then by the transitive property of the usual ordering for the real numbers, we then know that b < d, which means that a = c and b < d, so that z < w. Lastly, in order to show that C doesn t have the least upper bound property, we need to find a subset of C that has no least upper bound. There are plenty, but let s consider the set A = {z C z = a + bi for some a, b R, and a < 0}. Assume there is a least upper bound w = c + di. Then if c > 0, we know that 0 + di < w, and 0 + di is an upper bound for A, contradicting the fact that w is a least upper bound. If c < 0, then c/2 + di is a complex number with a negative real part, so c/2 + di is in A and c + di < c/2 + di, contradicting the fact that w is an upper bound. Therefore c = 0, and thus w is of the form di for some d R. However, for any choice of d R, the complex number (d 1)i is an upper bound for A which is less than di under the order, contradicting the fact that w is a a least upper bound once again. Hence, A has no least upper bound, and more generally C does not have the least upper bound property with the order described above. 4

5 Problem 5 (WR Ch 1 #17). Prove that x + y 2 + x y 2 = 2 x y 2 if x R k and y R k. Interpret this geometrically, as a statement about parallelograms. Solution. Let x = (x 1,..., x n ) and y = (y 1,..., y n ). Then ( ) 2 ( ) 2 x + y 2 + x y 2 = (x1 + y 1 ) (x n + y n ) 2 + (x1 y 1 ) (x n y n ) 2 = (x 1 + y 1 ) (x n + y n ) 2 + (x 1 y 1 ) (x n y n ) 2 = (x x 1 y 1 + y 2 1) + + (x 2 n + 2x n y n + y 2 n) + (x 2 1 2x 1 y 1 + y 2 1) + + (x 2 n 2x n y n + y 2 n) = (x x 1 y 1 + y 2 1) + + (x 2 n + 2x n y n + y 2 n) + (x 2 1 2x 1 y 1 + y 2 1) + + (x 2 n 2x n y n + y 2 n) = 2(x x 2 n) + 2(y yn) 2 ( 2 ( = 2 x 2 1 n) + + x2 + 2 y y2 n = 2 x y 2. ) 2 Interpreted geometrically, the statement simply says that: The sum of the squares of the diagonals of a parallelogram is equal to twice the sum of the squares of the sides. 5

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### 12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### 3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### A Problem With The Rational Numbers

Solvability of Equations Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. 2. Quadratic equations

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

### Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### 1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N.

CHAPTER 3: EXPONENTS AND POWER FUNCTIONS 1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N. For example: In general, if

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### Lesson 6: Proofs of Laws of Exponents

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 6 8 Student Outcomes Students extend the previous laws of exponents to include all integer exponents. Students base symbolic proofs on concrete examples to

### arxiv:0909.4913v2 [math.ho] 4 Nov 2009

IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

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

### 5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

### Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

### Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### This is a square root. The number under the radical is 9. (An asterisk * means multiply.)

Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize

### The basic unit in matrix algebra is a matrix, generally expressed as: a 11 a 12. a 13 A = a 21 a 22 a 23

(copyright by Scott M Lynch, February 2003) Brief Matrix Algebra Review (Soc 504) Matrix algebra is a form of mathematics that allows compact notation for, and mathematical manipulation of, high-dimensional

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

### RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

### DigitalCommons@University of Nebraska - Lincoln

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

### March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions

MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial

### This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.

Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course

### The Method of Partial Fractions Math 121 Calculus II Spring 2015

Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### 4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

### Figure 1.1 Vector A and Vector F

CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### 3.3 Real Zeros of Polynomials

3.3 Real Zeros of Polynomials 69 3.3 Real Zeros of Polynomials In Section 3., we found that we can use synthetic division to determine if a given real number is a zero of a polynomial function. This section

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### Integrating algebraic fractions

Integrating algebraic fractions Sometimes the integral of an algebraic fraction can be found by first epressing the algebraic fraction as the sum of its partial fractions. In this unit we will illustrate

### Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

### Algebraic and Transcendental Numbers

Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

### 1 Review of complex numbers

1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely

### Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

### The Rational Numbers

Math 3040: Spring 2011 The Rational Numbers Contents 1. The Set Q 1 2. Addition and multiplication of rational numbers 3 2.1. Definitions and properties. 3 2.2. Comments 4 2.3. Connections with Z. 6 2.4.

### Set theory as a foundation for mathematics

Set theory as a foundation for mathematics Waffle Mathcamp 2011 In school we are taught about numbers, but we never learn what numbers really are. We learn rules of arithmetic, but we never learn why these

### Guide to Leaving Certificate Mathematics Ordinary Level

Guide to Leaving Certificate Mathematics Ordinary Level Dr. Aoife Jones Paper 1 For the Leaving Cert 013, Paper 1 is divided into three sections. Section A is entitled Concepts and Skills and contains

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Solutions of Linear Equations in One Variable

2. Solutions of Linear Equations in One Variable 2. OBJECTIVES. Identify a linear equation 2. Combine like terms to solve an equation We begin this chapter by considering one of the most important tools

### Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

### c 2008 Je rey A. Miron We have described the constraints that a consumer faces, i.e., discussed the budget constraint.

Lecture 2b: Utility c 2008 Je rey A. Miron Outline: 1. Introduction 2. Utility: A De nition 3. Monotonic Transformations 4. Cardinal Utility 5. Constructing a Utility Function 6. Examples of Utility Functions

### If n is odd, then 3n + 7 is even.

Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that

### 5.1 Commutative rings; Integral Domains

5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following

### COMPASS Numerical Skills/Pre-Algebra Preparation Guide. Introduction Operations with Integers Absolute Value of Numbers 13

COMPASS Numerical Skills/Pre-Algebra Preparation Guide Please note that the guide is for reference only and that it does not represent an exact match with the assessment content. The Assessment Centre

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### Homework # 3 Solutions

Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8

### Solutions to Homework 10

Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

### Black Problems - Prime Factorization, Greatest Common Factor and Simplifying Fractions

Black Problems Prime Factorization, Greatest Common Factor and Simplifying Fractions A natural number n, such that n >, can t be written as the sum of two more consecutive odd numbers if and only if n

### 4.2 Euclid s Classification of Pythagorean Triples

178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

### Set theory as a foundation for mathematics

V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed