Fundamentals of Pure Mathematics - Problem Sheet

Size: px
Start display at page:

Download "Fundamentals of Pure Mathematics - Problem Sheet"

Transcription

1 Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions all variables are 1 Mathematical Argument 1.1 ( ) Which of the following statements are true for real numbers x? (a) x = 1 implies x 2 3x + 2 = 0. (b) x = 1 if x 2 3x + 2 = 0. (c) x = 1 only if x 2 3x + 2 = 0. (d) If x = 1 then x 2 3x + 2 = 0. (e) x = 1 is a necessary condition for x 2 3x + 2 = 0. (f) x = 1 is a sufficient condition for x 2 3x + 2 = 0. (g) x > 2 implies x > 1. (h) x > 2 is a sufficient condition for x > (a) Give a careful deductive proof that if 2x 2 5x + 2 < 0 then x > 0 (b) Give a proof by contradiction of the same fact. (c) Decide whether the following statement is true or false, giving a proof or a counterexample. For all x > 0, 2x 2 5x + 2 > ( ) What does the following argument prove? Assume that x 2 5x + 6 = 0. Then (x 2)(x 3) = 0. so either x 2 = 0 or x 3 = 0. Thus either x = 2 or x = ( ) Mark the following statements true or false. (a) There exists x such that sin(x + π/2) = sinx. (b) For all x, sin(x + π/2) = sin x. (c) There exists x such that for all y, y x. (d) For all y, there exists x such that y x. (e) x such that x 2 = 2x. (f) x, x 2 2x. (g) x z y such that x + y = z. 1

2 1.5 Euler suggested the following formula for generating prime numbers: if n is a positive integer then n 2 + n + 41 is a prime. Verify this for some small values of n. Give a counter example to show that it is not in general true. [Hint: chose an n that makes n 2 + n a multiple of In fact it may be shown that no such polynomial formula can generate only primes.] 1.6 Show by induction, writing out your proof very carefully, that for each positive integer n n(n + 1) = n n Sets, Relations and Functions 2.1 Let X = {1,2,3} and Y = {3,4}. Find X Y, X Y, X Y, X \Y, Y \ X, (X Y ) X, P (X), {n + m : n X,m Y }. 2.2 For all n = 1,2,3,... let X n R be the open interval (1/n,2 + 1/n). Find 4[ X n, n=1 4\ X n, n=1 [ X n, n=1 \ X n. n=1 2.3 Prove that for all sets X,Y and Z (a) (X Y ) Z = (X Z) (Y Z), (b) (X \Y ) (X \ Z) = X \ (Y Z), (c) (X Y ) (Y X) = (X Y ) (X Y ). 2.4 Let X denote the number of elements in a finite set X. Prove that for all finite sets X,Y and Z X Y = X + Y X Y, X Y Z = X + Y + Z X Y Y Z Z X + X Y Z. 2.5 Which of the properties Reflexive, Symmetric and Transitive are satisfied by the following relations where x,y R? (a) x < y (b) x y (c) x y < 1 (d) x y is rational (e) x y is irrational (f) x y < 1 (g) x < y 2 (h) xy 0. 2

3 2.6 Show that the following are equivalence relations on Z and describe the equivalence classes. (a) 3 divides x y (b) 5 divides x + 4y (c) x 2 = y Define a relation R on the Euclidean plane R 2 by (x 1,y 1 )R(x 2,y 2 ) if and only if x 1 + y 1 = x 2 +y 2. Show that R is an equivalence relation and describe the equivalence classes geometrically. 2.8 Let R and S be equivalence relations on a set X. Show that the relation T defined by xty if and only if xry and xsy is an equivalence relation. Give and example to show that xry if and only if xry or xsy is not an equivalence relation. 2.9 Let Z denote the non-zero integers. Define a relation R on Z Z by (a,b)r(c,d) if and only if ad = bc. Show that this is an equivalence relation and describe the equivalence classes. Does this remind you of anything? 2.10 Define a relation on the Euclidean plane R R as follows: (x,y) (a,b) means either x < a or both x = a and y b. Show that is an order relation, and describe (x, y) (a, b) geometrically ( ) Establish which of the following functions are injections, surjections and bijections. Find the inverses of any bijections. (a) f : R R f (x) = x 2 (b) f : R R f (x) = x 3 (c) f : Z Z f (x) = x 2 (b) f : Z Z f (x) = x 3 (e) f : Z Z f (x) = x + 7 (f) f : Z Z f (x) = x + 7 (g) f : R R f (x) = x 3 + 9x (h) f : R R f (x) = x 3 9x Let f : X Y be a function and A X Show that f (A B) = f (A) f (B), f (A B) f (A) f (B). Give and example to show that cannot be replaced by = in the second case. 3

4 2.13 Let R be the equivalence relation on Z defined by xry if 3 divides x y. Which of the following binary operations on Z induce a well-defined operation on the equivalence classes of R? In each case either give a short proof and write out the table giving the induced operation, or give an example to show the operation is not well-defined. (a) x y = x + 2y (b) x y = xy (c) x y = x + y Let R be the equivalence relation defined on Z Z by (a,b)r(c,d) if and only if ad = bc (see question 2.9). Show that the binary operation defined by (a,b) (p,q) = (aq + bp, bq) induces a well-defined operation on the equivalence classes. What does this remind you of? 2.15 ( ) Let f : X Y and g : Y Z. Show that if f and g are both injections then the composition g f is an injection and that if f and g are both surjections then the composition g f is an surjection [For those familiar with some group theory] Let (G,.) be a group and H a subgroup. Define a relation on G by taking xry to mean xy 1 H. Show that R is an equivalence relation. Show that the equivalence classes are the left cosets xh = {xy : y H}. Show that if H is an normal subgroup, i.e. if y 1 Hy = H for all y, then the induced operation on G/R is well-defined (the quotient group ). 4

5 3 Number systems 3.1 Show from the defining properties of a ring (R,+,.): (i) 0 is unique (i.e. if r is an element such that r + a = a for all a then r = 0) (ii) if x + a = 0 then x = a (iii) ( a) = a for all a R. 3.2 Check, using the definitions of + and in Q and arithmetic properties in Z that in Q, 0/1 is the zero, 1/1 is the identity, that a/b is the negative of a/b and b/a is the inverse of a/b provided a/b is non-zero. 3.3 Assuming the arithmetic properties of Z, show that in the rationals, (A1) a + b = b + a for a,b Q (A2) a + (b + c) = (a + b) + c for a,b,c Q (M2) a(bc) = (ab)c for a,b,c Q. 3.4 Assuming the corresponding properties of the integers, verify that (O2) a b,c d implies a + c b + d for a,b,c Q. 3.5 Show that if a Q (or indeed a belongs to any ordered field) then 0 a Prove that if a,b Q with 0 a b then a n b n for every positive integer n (where we define a n in the obvious way as an n-fold product) [Hint: induction]. Show that if a Q with 0 a there is at most one element r Q such that r n = a. 3.7 The aim of this question is to show how one could start just with the natural numbers N {1,2,3,...} and use equivalence classes to construct the integers Z: this is analogous to the way we constructed Q from Z. Here you may use and standard arithmetic properties of the natural numbers but not subtraction or properties of negative numbers. (a) Show that defines an equivalence relation on N N. (a,b)r(c,d) if and only if a + d = b + c In the usual way, we write [a,b] for the equivalence class under R that contains (a,b), and call the set of these equivalence classes Z. Define operations + and on the equivalence classes in terms of arithmetic operations on N by [a,b] + [c,d] = [a + c,b + d], [a,b] [c,d] = [ac + bd,ad + bc]. (b) Show that + is a well-defined operation on these equivalence classes (i.e. equivalent elements map to equivalent elements). 5

6 (c) Show that, for all a,b,c N, [a,b] + [c,c] = [a,b] and [a,b] + [b,a] = [c,c]; Thus we may think of [c,c] as the zero of Z and [b,a] as the negative of [a,b]. (d) We can now verify all the conditions for Z to be a ring. Show, for example, that the distributive law holds in Z, that is [a,b]([c,d] + [e, f ]) = [a,b][c,d] + [a,b][e, f ]. (e) To check that N may be regarded as a subset of Z, define f : N Z by f (x) = [1,x + 1]. Show that f is an injection, such that f (x + y) = f (x) + f (y) (where addition is in the respective sets). Similary we can show that f respects multiplication and order, so we may identify {[1,a + 1] : a N} with N. 3.8 Consider the following sets of rational numbers: X = {x Q : 1 < x < 5}, Y = {x Q : 3 x 7}, U = {1, 12, 14,..., 12 n,... }. For each of the following sets determine its maximum, minimum, least upper bound and greatest lower bound (whenever they exist), and whether or not it is dense: 1. X; 2. Y ; 3. X Y ; 4. X Y ; 5. Y \ X; 6. X \Y ; 7. X Z; 8. Y \ Z; 9. U; 10. U \ X. 3.9 On the set Q of rationals define a relation R as follows: xry x y Z. Prove that this is an equivalence relation. If we try to define addition and multiplication on the set of equivalence classes by [x] + [y] = [x + y] and [x][y] = [xy], one of the is well-defined and the other isn t. Which is which? Show that if x Q then there is a positive integer n such that the n-fold sum [x] + [x] + + [x] = [0] Prove that if A is a cut then so is A. Moreover, prove that A is positive if and only if A is negative Prove that for arbitrary cuts A,B we have A + B = B + A and AB = BA Let A,B,C be arbitrary cuts. (i) Prove that AB > O if and only if A and B are of the same sign (i.e. A,B > O or A,B < O). (ii) Prove that A 2 0 for every cut A. 6

7 (iii) Prove that if A < B and C > O then AC < BC. [Hint: Use without proof that B A > O, and the distributive law.] (iv) Prove that if A > B > O and n N then A n > B n. (v) Prove that for any positive y R and any n 1 there exists at most one positive x R such that x n = y For each of the following combinations of conditions (C1), (C2), (C3) from the definition of a cut try to find a set satisfying it: (a) (C1), (C2) but not (C3); (b) (C3), but not (C1) nor (C2); (c) none; (d) (C2), (C3) but not (C1) Verify the distributive law on C from the definitions of the operations on C: (D) a(b + c) = ab + ac for a,b,c C Derive the reverse triangle inequality for complex numbers, that z w z w for z,w C Show that for a polynomial p(z) = a n z n + + a 1 z + a 0 with real coefficients a i, that zeros occur in conjugate pairs, i.e. if p(z) = 0 then p(z) = 0. 7

8 4 Number theory 4.1 Use Euclid s algorithm to find solutions in integers x,y of the following equations: (a) 34x + 10y = 2 (1 solution) (b) 34x + 10y = 2 (all solutions) (c) 34x + 10y = 3 (all solutions) (d) 34x + 10y = 4 (all solutions) 4.2 Show that if the integers n and m are of the form 6k + 1 (i.e leave a remainder 1 on division by 6) then nm is also of the form 6k + 1. Hence show that there are infinitely many prime numbers of the form 6k +5. [Hint: Suppose p 1, p 2,..., p n are the only such primes and consider m = p 1 p 2... p n 1.] 4.3 Show that there are arbitrary long gaps between consecutive primes. [Hint: Show that there are arbitrarily long sequences of consecutive composite (i.e. non-prime) numbers - consider sequences starting n! + 2.] 4.4 Use Chebychev s prime number theorem to show that for every integer n there is a prime between n and 40n. Show that there are at least cn/logn primes in this range, for some positive constant c. 4.5 Show that the series p 1 p is divergent (where the sum is over all primes). [Hint: split the sum up as n=1 40 n <p 40 n+1 and use the estimate of the previous question.] 4.6 Show that if a 2 and a n + 1 is prime, then a is even and n is a power of 2. (Primes of the form 2 2n + 1 are called Fermat primes.) 4.7 Show that if n > 1 and a n 1 is prime, then a = 2 and n is prime. (Primes of the form 2 n 1 are called Mersenne primes.) 4.8 Let the positive numbers a, b be rational and s,t be irrational. Determine whether each of the following numbers are (i) always rational (ii) always irrational (iii) may be rational or irrational: (a) a + b; (b) s +t; (c) a + s; (d) ab; (e) as; (f) a; (g) s; 4.9 Show from the definition that 10 is irrational Show that the following numbers are irrational: (a) 2 + 5; (b) Show that is irrational (1!) (2!) (3!) 2 + 8

9 5 Countability and Cardinality 5.1 Let X and X be disjoint sets and let Y and Y be disjoint sets. Show that if X Y and X Y then X X Y Y. Show that {0,1, 2 1, 1 3, 4 1,...} { 1 2, 1 3, 1 4,...}. Deduce that [0,1] (0,1) (where [0,1] and (0,1) are the closed and open unit intervals). 5.2 Determine, giving brief reasons (you may quote any standard results), whether each of the following sets is countable or uncountable. 1. The set of prime numbers. 2. {a + bi : a,b N}. 3. Q Q = {(q,r) : q,r are rational}. 4. {x R : 0 < x < }. 5. {n 2 : n N}. 6. {x R : x > 0}. 7. { m n R + : m,n N}. 5.3 Define f : N N N by f (m,n) = 2 m 3 n. Show that f is an injection. Deduce that N N is countable. Now define f : {finite subsets of N} N by f (A) = 2 m 13 m 25 m 37 m 411 m 5... where m k = 1 if k A and m k = 0 if k / A. Show that f is a well-defined injection. Deduce that the set of all finite subsets of N is countable. 5.4 Show that the unit interval (0,1) and the interior of the unit square (0,1) (0,1) have the same cardinality. [Hint: How can the decimal expansions of two numbers x, y (0,1) be mapped (bijectively) into the decimal expansion of a single number k (0,1)?] 5.5 Use the Schroeder Bernstein Theorem to prove that (0, 1) (open interval) and [0, 1] (closed interval) are similar (compare Question 5.1). 5.6 Determine the cardinality of each of the following sets: 1. The set of lines in the Euclidean plane R The set of all sequences of integers. 3. The set of all sequences of real numbers. 5.7 What are the cardinalities of the following sets: (a) the set of all injective mappings N N; (b) the set of all equivalence relations on N? 5.8 Prove the following statements: (i) (ii) If A = B and B < C then A < C. If A < B and B < C then A < C. 9

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005 POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1

More information

Part IA. Numbers and Sets. Year

Part IA. Numbers and Sets. Year Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Solutions to Practice Final

Solutions to Practice Final s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final 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 information

MATH 201 Solutions: TEST 3-A (in class)

MATH 201 Solutions: TEST 3-A (in class) MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define

More information

RED. 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 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 information

INFINITY: CARDINAL NUMBERS

INFINITY: CARDINAL NUMBERS INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex

More information

MATH FINAL EXAM REVIEW HINTS

MATH 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 information

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

not 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 information

Chapter One. The Real Number System

Chapter One. The Real Number System Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and

More information

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics Examiners: D. Burbulla, P. Glynn-Adey, S. Homayouni Time: 7-10

More information

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

Mathematical Reasoning & Proofs

Mathematical 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 information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

More information

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed. Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply

More information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality. Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second

More information

Chapter 1 The Real Numbers

Chapter 1 The Real Numbers Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

Contribution of Problems

Contribution 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 information

Foundations and Analysis Questions. Collated and compiled by Keegan Kang MORSE Society A Year 1 Christmas Present

Foundations and Analysis Questions. Collated and compiled by Keegan Kang MORSE Society A Year 1 Christmas Present Foundations and Analysis Questions Collated and compiled by Keegan Kang MORSE Society A Year 1 Christmas Present 1 Foundations and Analysis 2 Contents 1 Foundations 5 1.1 The Compulsory Question 1...........................

More information

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017 Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a

More information

Principles of Real Analysis I Fall I. The Real Number System

Principles of Real Analysis I Fall I. The Real Number System 21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous

More information

Math 105A HW 1 Solutions

Math 105A HW 1 Solutions Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S

More information

Chapter 1. Sets and Numbers

Chapter 1. Sets and Numbers Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write

More information

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE B.Sc. MATHEMATICS V SEMESTER (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS QUESTION BANK 1. Find the number of elements in the power

More information

Math 300: Final Exam Practice Solutions

Math 300: Final Exam Practice Solutions Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a

More information

MATH 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 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 information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set 1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following

More information

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that

More information

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93. Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)

More information

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.

More information

Postulate 2 [Order Axioms] in WRW the usual rules for inequalities

Postulate 2 [Order Axioms] in WRW the usual rules for inequalities Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

More information

Logic. Facts (with proofs) CHAPTER 1. Definitions

Logic. Facts (with proofs) CHAPTER 1. Definitions CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies

More information

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

2 Elementary number theory

2 Elementary number theory 2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime. PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

a 2 = ab a 2 b 2 = ab b 2 (a + b)(a b) = b(a b) a + b = b

a 2 = ab a 2 b 2 = ab b 2 (a + b)(a b) = b(a b) a + b = b Discrete Structures CS2800 Fall 204 Final Solutions. Briefly and clearly identify the errors in each of the following proofs: (a) Proof that is the largest natural number: Let n be the largest natural

More information

Tenth Bit Bank Mathematics Real Numbers

Tenth Bit Bank Mathematics Real Numbers Tenth Bit Bank Mathematics Real Numbers 1. The rational number among the following is... i) 4.28 ii) 4.282828... iii) 4.288888... A) i) & ii) B) ii) & iii) C) i) & iii) D) All the above 2. A rational number

More information

Mathematics Review for Business PhD Students Lecture Notes

Mathematics Review for Business PhD Students Lecture Notes Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Mid Term-1 : Practice problems

Mid Term-1 : Practice problems Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition Todd Cochrane Department of Mathematics Kansas State University Contents Notation v Chapter 0. Axioms for the set of Integers Z. 1 Chapter 1.

More information

CSE 1400 Applied Discrete Mathematics Proofs

CSE 1400 Applied Discrete Mathematics Proofs CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

A Short Review of Cardinality

A Short Review of Cardinality Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information

MODEL ANSWERS TO HWK #10

MODEL ANSWERS TO HWK #10 MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it

More information

Chapter 1. Sets and Mappings

Chapter 1. Sets and Mappings Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write

More information

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets) MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question

More information

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

a b (mod m) : m b a with a,b,c,d real and ad bc 0 forms a group, again under the composition as operation.

a b (mod m) : m b a with a,b,c,d real and ad bc 0 forms a group, again under the composition as operation. Homework for UTK M351 Algebra I Fall 2013, Jochen Denzler, MWF 10:10 11:00 Each part separately graded on a [0/1/2] scale. Problem 1: Recalling the field axioms from class, prove for any field F (i.e.,

More information

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is

More information

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:

More information

Analysis I. Classroom Notes. H.-D. Alber

Analysis I. Classroom Notes. H.-D. Alber Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

MATH 13 FINAL EXAM SOLUTIONS

MATH 13 FINAL EXAM SOLUTIONS MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F

More information

a + 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.

a + 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

Properties of the Integers

Properties of the Integers 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

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

More information

There are seven questions, of varying point-value. Each question is worth the indicated number of points.

There 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 information

Math Review. for the Quantitative Reasoning measure of the GRE General Test

Math Review. for the Quantitative Reasoning measure of the GRE General Test Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving

More information

Homework 1 Solutions

Homework 1 Solutions MATH 171 Spring 2016 Problem 1 Homework 1 Solutions (If you find any errors, please send an e-mail to farana at stanford dot edu) Presenting your arguments in steps, using only axioms of an ordered field,

More information

Introduction to Proofs

Introduction to Proofs Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions

More information

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one

More information

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture 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 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going

More information

Some Basic Logic. Henry Liu, 25 October 2010

Some Basic Logic. Henry Liu, 25 October 2010 Some Basic Logic Henry Liu, 25 October 2010 In the solution to almost every olympiad style mathematical problem, a very important part is existence of accurate proofs. Therefore, the student should be

More information

Proofs. Chapter 2 P P Q Q

Proofs. 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 information

1 Implication and induction

1 Implication and induction 1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,

More information

MAS114: Solutions to Exercises

MAS114: Solutions to Exercises MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting 5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

More information

Commutative Rings and Fields

Commutative Rings and Fields Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

More information

REVIEW Chapter 1 The Real Number System

REVIEW 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 information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

Solutions to Tutorial for Week 4

Solutions to Tutorial for Week 4 The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

More information

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth

More information

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

Introduction to Abstract Mathematics MA 103. Exercises 1. 1 Consider the following (false) statement:

Introduction to Abstract Mathematics MA 103. Exercises 1. 1 Consider the following (false) statement: Introduction to Abstract Mathematics MA 103 Exercises 1 Relevant parts of the Lecture notes: Chapter 1 and Sections 2.1 2.8, 2.12 and 2.13. Relevant parts of the text books: Biggs: Chapter 1 and Sections

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

MAT115A-21 COMPLETE LECTURE NOTES

MAT115A-21 COMPLETE LECTURE NOTES MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes

More information