# MATH 150 HOMEWORK 4 SOLUTIONS

Size: px
Start display at page: Transcription

1 MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers , , nd is nonnegtive. Is your proof constructive or nonconstructive? For ny three rel numbers x, y, nd z, it must be the cse tht one of xy, xz, or yz is nonnegtive. There re severl wys to show this; one is cse-by-cse rgument bsed on whether the numbers re positive, negtive, or zero. Insted we use proof by contrdiction. Assume tht xy, xz, nd yz re ll negtive. (This is the negtion of the sttement we re trying to prove.) So xy < 0. The only wy for product of numbers to be negtive is if they re of opposite signs. So either x > 0 nd y < 0, or x < 0 nd y > 0. Without loss of generlity, ssume tht x > 0 nd y < 0. (Otherwise, we could just switch the nmes of x nd y.) Now we know tht x > 0 nd xz < 0. So z < 0. Then yz > 0, s both y nd z re negtive. But we ssumed tht yz < 0. This is contrdiction, so t lest one of xy, xz, or yz must be nonnegtive. This proof is nonconstructive becuse it only shows tht one of the products is nonnegtive, but it does not identify which one. 14. Prove or disprove tht if nd b re rtionl numbers, then b is rtionl. This is flse. let = 2 nd b = 1/2. Then b = 2, which is n irrtionl number. (This ws shown in clss.) 16. Show tht if, b, nd c re rel numbers nd 0, then there is unique solution of the eqution x + b = c. First we show tht there is solution. Let x = c b. Then x + b = c b + b = c b + b = c. Now we show tht the solution is unique. Suppose tht there is some number y such tht y + b = c. Therefore y = c b, nd y = c b. So 1

2 2 MATH 150 HOMEWORK 4 SOLUTIONS c b is the only solution. 30. Prove tht there re no solutions in integers to the eqution 2x 2 + 5y 2 = 14. Both 2x 2 nd 5y 2 re nonnegtive, so if they sum to 14, then ech is less thn or equl to 14. So 2x 2 14, so x 2 7. The only integers x cn be re 2, 1, 0, 1, or 2. Likewise, 5y 2 14, so y 2 14, nd the 5 only integers tht solve this inequlity for y re 1, 0, or 1. As both x nd y re squred in this eqution, we my ssume without loss of generlity tht both re nonnegtive. (If negtive vlue of x gives solution to the eqution, then nonnegtive vlue of x would lso solve the eqution.) So x {0, 1, 2} nd y {0, 1}. Now we compute: 2(0) 2 + 5(0) 2 = 0 2(1) 2 + 5(0) 2 = 2 2(2) 2 + 5(0) 2 = 8 2(0) 2 + 5(1) 2 = 5 2(1) 2 + 5(1) 2 = 7 2(2) 2 + 5(1) 2 = 13 None of these give 14, so the eqution hs no solution in integers. 34. Prove tht 3 2 is irrtionl. Assume tht there exists rtionl number x such tht x 3 = 2. So x = p for some integers p nd q with q 0, nd we my ssume tht q ( ) 3 p p nd q hve no common fctors. We hve tht q = 2, so p 3 = 2q 3. Therefore p 3 is even. This implies tht p is even, s follows: if p is odd, then p = 2k + 1 for some integer k. Then p 3 = (2k + 1) 3 = 8k k 2 + 6k + 1 = 2(4k 3 + 6k 2 + 3k) + 1 nd so p 3 is odd. So if p 3 is not odd (i.e. even), then p is even. Therefore p = 2k for some integer k. Then nd dividing by 2, (2k) 3 = 2q 3 4k 3 = q 3.

3 MATH 150 HOMEWORK 4 SOLUTIONS 3 So q 3 is divisible by 4, nd in prticulr is even. So q is even by the rgument bove. But then p nd q hve common fctor of 2, which is contrdiction. Section Show tht if A nd B re sets with A B, then ) A B = B. Let x A B. So x A x B. If x A, then x B becuse A B. If x / A, then x B by disjunctive syllogism. Either wy, x B, so A B B. Now insted, let x B. By the ddition rule, x A x B. So x A B. So B A B. b) A B = A. Let x A B. So x A x B. By simplifiction, x A. So A B A. Insted, let x A. As we know A B, we hve x B. So x A x B. So x A B. 12. Determine whether ech of these functions from Z to Z is one-toone. ) f(n) = n 1 is one-to-one; if n 1 = m 1 then n = m. b) f(n) = n is not one-to-one; f(1) = 2 nd f( 1) = 2. c) f(n) = n 3 is one-to-one; rel numbers (nd hence integers) hve unique cube root. d) f(n) = n/2 is not one-to-one; f(1) = 1 nd f(2) = Let f : R R nd let f(x) > 0 for ll x R. Show tht f(x) is strictly incresing if nd only if g(x) = 1/f(x) is strictly decresing. Assume tht f(x) is incresing. Suppose tht x < y. Then f(x) < f(y). Tking reciprocls of both sides gives 1/f(x) > 1/f(y). So g(x) > g(y), nd g is decresing. Now ssume tht g(x) = 1/f(x) is decresing. So if x < y, then g(x) > g(y). So 1/g(x) < 1/g(y). So f(x) < f(y). So f is incresing. 28. Show tht f(x) = e x from the set of rel numbers to the set of rel numbers is not invertible, but if the codomin is restricted to the set

4 4 MATH 150 HOMEWORK 4 SOLUTIONS of positive rel numbers, then the resulting function is invertible. If f : R R is given by f(x) = e x, then f is not onto, becuse e x is lwys positive, so for exmple e x = 1 hs no solution. Let g : R R + be given by g(x) = e x, where here the codomin is the set of positve rel numbers. For ny y R +, the eqution e x = y is solved by x = ln(y), so g is onto. Also, g is incresing, so g is one-to-one. Therefore g is invertible.

### Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

### On the Robustness of Most Probable Explanations On the Robustness of Most Probble Explntions Hei Chn School of Electricl Engineering nd Computer Science Oregon Stte University Corvllis, OR 97330 chnhe@eecs.oregonstte.edu Adnn Drwiche Computer Science

### First variation. (one-variable problem) January 21, 2015 First vrition (one-vrible problem) Jnury 21, 2015 Contents 1 Sttionrity of n integrl functionl 2 1.1 Euler eqution (Optimlity conditions)............... 2 1.2 First integrls: Three specil cses.................

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### When Simulation Meets Antichains (on Checking Language Inclusion of NFAs) When Simultion Meets Antichins (on Checking Lnguge Inclusion of NFAs) Prosh Aziz Abdull 1, Yu-Fng Chen 1, Lukáš Holík 2, Richrd Myr 3, nd Tomáš Vojnr 2 1 Uppsl University 2 Brno University of Technology

### The Tradeoff Between Inequality and Growth ANNALS OF ECONOMICS AND FINANCE 4, 329 345 2003 The Trdeoff Between Inequlity nd Growth Jess Benhbib Deprtment of Economics, New York University 269 Mercer Street, 7th floor, New York, NY 10003, USA. E-mil:

### You know from calculus that functions play a fundamental role in mathematics. CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### LIFE AS POLY-CONTEXTURALITY *) Ferury 2004 LIFE AS POLY-CONTEXTURALITY *) y Gotthrd Günther Kein Leendiges ist ein Eins, Immer ist's ein Vieles. (Goethe) Prt I : The Concept of Contexture A gret epoch of scientific trdition is out to

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m) Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4. 11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order

### Maximum area of polygon Mimum re of polygon Suppose I give you n stiks. They might e of ifferent lengths, or the sme length, or some the sme s others, et. Now there re lots of polygons you n form with those stiks. Your jo is

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### Inversion. Chapter 7. 7.1 Constructing The Inverse of a Point: If P is inside the circle of inversion: (See Figure 7.1) Chapter 7 Inversion Goal: In this chapter we define inversion, give constructions for inverses of points both inside and outside the circle of inversion, and show how inversion could be done using Geometer

### Some Techniques for Proving Correctness of Programs which Alter Data Structures Some Techniques for Proving Correctness of Progrms which Alter Dt Structures R. M. Burstll Deprtment of Mchine Intelligence University of Edinburgh 1. INTRODUCTION Consider the following sequence of instructions

### Doug Ravenel. October 15, 2008 Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we

### Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima. Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =

### How To Understand The Theory Of Algebraic Functions Homework 4 3.4,. Show that x x cos x x holds for x 0. Solution: Since cos x, multiply all three parts by x > 0, we get: x x cos x x, and since x 0 x x 0 ( x ) = 0, then by Sandwich theorem, we get: x 0

### 1. Graphing Linear Inequalities Notation. CHAPTER 4 Linear Programming 1. Graphing Linear Inequalities x apple y means x is less than or equal to y. x y means x is greater than or equal to y. x < y means x is less than y. x > y means

### 2 Polynomials over a field 2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special

### How To Understand The Relation Between Quadratic And Binary Forms 8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS PETE L. CLARK 1. Basic definitions An integral binary quadratic form is just a polynomial f = ax 2 + bxy + cy 2 with a, b, c Z. We define the discriminant

### If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

### Switching Algebra and Logic Gates Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design

### Magnetism from Conductors, and Enhanced Non-Linear Phenomena Mnetism from Conductors, nd Enhnced Non-Liner Phenomen JB Pendry, AJ Holden, DJ Roins, nd WJ Stewrt Astrct - We show tht microstructures uilt from non-mnetic conductin sheets exhiit n effective mnetic

### A 2-factor in which each cycle has long length in claw-free graphs A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### G = G 0 > G 1 > > G k = {e} Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### Does the chimpanzee have a theory of mind? 30 years later Review Does the chimpnzee hve theory of mind? 30 yers lter Josep Cll nd Michel Tomsello Mx Plnck Institute for Evolutionry Anthropology, Deutscher Pltz 6, D-04103 Leipzig, Germny On the 30th nniversry

### (LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine. (LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,

### Preliminary Version: December 1998 On the Number of Prime Numbers less than a Given Quantity. (Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse.) Bernhard Riemann [Monatsberichte der Berliner Akademie, November 859.] Translated VoIP for the Smll Business Reducing your telecommunictions costs Reserch firm IDC 1 hs estimted tht VoIP system cn reduce telephony-relted expenses by 30%. Voice over Internet Protocol (VoIP) hs become Skepticism about the external world & the problem of other minds So far in this course we have, broadly speaking, discussed two different sorts of issues: issues connected with the nature of persons (a