MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018
|
|
- Arlene Harvey
- 5 years ago
- Views:
Transcription
1 MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should be spot on. Anything else is unacceptable. You must make your arguments logical and complete. We are not responsible for figuring out what you are doing; you are supposed to make it completely clear what you are doing. When using the Well-Ordering Principle or any of the Principles of Mathematical Induction, the definition of the set to which you will apply WOP or Induction must be clearly given. Breakdown of Results: 352 students wrote this test. The marks ranged from 12% to 93%, and the average was 53%. Some statistics on grade distribution are in the table on the left, and a histogram of the marks (by decade) is on the right. Grade % Decade % % 2.2% A 8.2% 80-89% 6.0% B 10.8% 70-79% 10.8% C 16.5% 60-69% 16.5% D 18.7% 50-59% 18.7% F 45.8% 40-49% 21.6% 30-39% 14.8% 20-29% 7.1% 10-19% 2.3% 0-9% 0.0%
2 1. [10 marks; avg: 7.1] Let a, p, m and n be natural numbers. (a) [6 marks; 2 for each part] Define the following: (i) a is a divisor of n Solution: a is a divisor of n if there is a natural number k such that n = k a. (ii) p is a prime number Solution: a natural number p greater than 1 is a prime number if the only natural number divisors of p are 1 and itself. (Symbolically: p > 1 and a p a = 1 or a = p) (iii) m is a composite number Solution: a natural number m greater than 1 is a composite number if it is not a prime number. (That s the definition in the book.) Or: a natural number m greater than 1 is a composite number if there are natural numbers a, b with 1 < a, b < m and m = a b. (b) [4 marks; 2 for each part] Determine if the following numbers are prime or composite. Solution: observe that neither of the two numbers is even, so 2 is not a divisor; neither of the two numbers is divisible by 3, since the sum of their digits is not a multiple of 3; and neither of the two number is divisible by 5, since the last digit of each number is neither 0 nor 5. The next step is to divide each number by 7... (i) 119 is composite since 119 = (ii) 179 is prime since neither 7, nor 11, nor 13 divide it, 179 = = = , and the next prime, 17, is too large to bother with since 17 >
3 2. [10 marks; avg: 5.7] 2.(a) [3 marks] State the Well-Ordering Principle. Solution: every non-empty set of natural numbers contains a least element. OR: if S N and S, then there is an m S such that m n for all n S. 2.(b) [7 marks] Use the Well-Ordering Principle to prove that every natural number other than 1 has a prime divisor. Proof: let S = {n N n > 1 and n has no prime divisor}. Suppose S. By the Well-Ordering Principle, S has a least element, call it m. Since m S, m has no prime divisor. But m divides itself, so m cannot be a prime. Therefore m is a composite number and there are numbers a, b such that m = a b and 1 < a, b < m. In particular a < m, so a / S. Then a has a prime divisor, call it p. Thus p a and a m. This means p divides m, contradicting the fact that m S. Thus S =. That is, every natural number other than 1 has a prime divisor.
4 3. [10 marks; avg: 7.3] 3.(a) [3 marks] State the Principle of Mathematical Induction. Solution: if S is any set of natural numbers such that 1 is in S, and k + 1 is in S whenever k is in S, then S = N. 3.(b) [7 marks] Use the Principle of Mathematical Induction to prove that for every natural number n. Proof: let S = {n N ( ) is true for n}. 1 S since 1 < 2 = n < 2 n ( ) Now assume k S. Then ( ) holds for n = k and k + 1 k + 1 < 2 k + 1 k + 1 ( using ab a + b 2 ; so k k + 1 k + k + 1 ) 2 = 2 k k k + 1 k + k k + 1 = 2(k + 1) k + 1 = 2 k + 1 Thus ( ) holds for n = k + 1 as well. By the Principle of Mathematical Induction S = N and the formula is true for all n. OR: if you don t know the inequality ab a + b, establish the induction step using more algebra: 2 2 k + 1 k + 1 < 2 k k k < 2(k + 1) 2 k(k + 1) < 2k + 1 4k(k + 1) < (2k + 1) 2 4k 2 + 4k < 4k 2 + 4k < 1
5 4. [10 marks; avg: 5.6] 4.(a) [4 marks] State the Generalized Principle of Complete Mathematical Induction. Solution: If S is any set of natural numbers with the properties that m is in S, and k + 1 is in S whenever k is a natural number and all the natural numbers from m through k are in S, then S = {n N n m}. 4.(b) [6 marks] Use the Generalized Principle of Complete Mathematical Induction to prove that every natural number other than 1 is a product of primes. Solution: let S be the set of natural numbers greater than 1 that can be written as a product of primes. 2 S, since 2 is a prime, it is a product of a single factor, itself. Let k > 2 and suppose that all natural numbers from 2 through k can be written as a product of primes, that is all the numbers from 2 through k are in S. Consider the number k + 1. There are two cases: 1. If k + 1 is prime, then it is a product of a single factor, itself, so k + 1 S. 2. If k + 1 is composite then there are numbers a, b such that 1 < a, b < k + 1 and k + 1 = a b. Since 2 a, b k, the inductive hypothesis implies that both a and b can be written as a product of primes. Suppose in particular that a = p 1 p 2 p m and b = q 1 q 2 q n for primes p i and q j. Then k + 1 = a b = p 1 p 2 p m q 1 q 2 q n, which means that k + 1 is also a product of primes. Hence k + 1 S. By the Generalized Principle of Complete Mathematical Induction, S = {n N n 2.}
6 5. [10 marks; avg: 4.8] Let n be a natural number. Prove that if n! + n 2 + n + 1 is prime then n 2 + n + 1 is prime. Proof: by contraposition. If n 2 + n + 1 is composite, then n 4 and n 2 + n + 1 = ab, with a, b N and 1 < a, b < n 2 + n + 1. One of a, b must be less than or equal to n because otherwise a > n and b > n a n + 1 and b n + 1 ab (n + 1) 2 = n 2 + 2n + 1 > n 2 + n + 1 = ab, which is a contradiction. So, assume without loss of generality that 1 < a n. Then a divides n!. Since a already divides n 2 + n + 1 we can conclude that a divides n! + n 2 + n + 1, which means that n! + n 2 + n + 1 is also composite.
7 6. [10 marks; avg: 7.0] 6.(a) [3 marks] Let n be a natural number other than 1. Define the canonical factorization of n into a product of primes. Solution: if n > 1 then the canonical factorization of n is n = p α 1 1 pα 2 2 pαr r, where each p i is a prime, p i < p i+1, and α i is a natural number. 6.(b) [7 marks] Find the canonical factorization of Solution: is even, ends in a zero, and the sum of its digits is divisible by 3; so primes 2, 3 and 5 all divide it. We have since = since = since = Is 4459 divisible by 7? Yes: 4459 = = = Thus the canonical factorization of is = The increasing order of the primes is part of the correct answer.
8 7. [10 marks; avg: 2.7] 7.(a) [6 marks] Let a and b be integers, let p and q be distinct primes. Prove that if a b (mod p) and a b (mod q), then a b (mod p q). Proof: a b (mod p) p a b a b = p m, for some integer m. Also, a b (mod q) q a b q p m. Since q is prime, q p or q m. Since p and q are distinct primes, we must have q m. Thus m = q n, for some integer n, and which means a b (mod p q). a b = p m = p q n, 7.(b) [4 marks] Prove that if a is any integer such that a 1 (mod 30), then a 1 (mod 2) or a 1 (mod 3) or a 1 (mod 5). Proof: by contraposition. Suppose a 1 (mod 2) and a 1 (mod 3) and a 1 (mod 5). By part (a), a 1 (mod 6). So a 1 = 6k, for some integer k. But also a 1 (mod 5). Therefore 5 divides a 1 = 6k. Since 5 doesn t divide 6, 5 k, and so k = 5j, for some integer j. Consequently a 1 = 6k = 6 5 j = 30 j, which means a 1 (mod 30).
9 8. [10 marks; avg: 2.3] 8.(a) [6 marks] Let p be a prime number, with p > 3. Prove that p = 6k ± 1, for some natural number k. Proof: every number p is congruent to one of 0, 1, 2, 3, 4 or 5, mod 6. Consider the four cases: 1. p 0 (mod 6) p = 6k p, so p is not prime. 2. p 2 (mod 6) p = 6k + 2 = 2(3k + 1) 2 p, so p is not prime if p > p 3 (mod 6) p = 6k + 3 = 3(2k + 1) 3 p, so p is not prime if p > p 4 (mod 6) p = 6k + 4 = 2(3k + 2) 2 p, so p is not prime if p > 3. If p > 3 is prime then it must be true that p 1 (mod 6) or p 5 1 (mod 6). So p = 6k ± 1, for some natural number k. Use this criterion to determine if could be prime. Solution: since = (mod 6), the number is not prime. 8.(b) [4 marks] Let m be a natural number other than 1. Prove that if m has the property that m divides at least one of the natural numbers a and b whenever it divides the product a b, then m is a prime. Proof: let p be a prime divisor of m. Then m = p k for some natural number k, and 1 p, k m. Since m divides itself, m divides p k. By the given property, m divides p or m divides k. Consider the two cases: 1. if m divides p, then we have p m p, which means m = p, and so m is a prime. 2. if m divides k, then as in Case 1, we have k m k, which means m = k. That implies p = 1, contradicting the fact that p is a prime. Thus Case 2 is impossible. Conclusion: m is a prime. Alternate Proof: by contradiction. Suppose m is composite. Then there are numbers a, b such that 1 < a, b < m, and m = a b. By the property, m should divide a or m should divide b. But since both a and b are less than m, m cannot divide them.
10 9. [10 marks; avg: 5.1] 9.(a) [4 marks] Use modular arithmetic, not calculus, to show that there is no integer solution to the equation x 3 + x 2 + x = Solution: mod 3, there are only three possibilities for any integer x: x 0, 1 or 2 (mod 3). Take each case in turn: 1. x 0 (mod 3) x 3 + x 2 + x (mod 3). 2. x 1 (mod 3) x 3 + x 2 + x (mod 3). 3. x 2 (mod 3) x 3 + x 2 + x (mod 3). Thus, for all integers x, x 3 + x 2 + x 1 (mod 3). But (mod 3). So there is no integer solution to the equation x 3 + x 2 + x = (b) [6 marks] Let p be a prime. Prove that if x 2 1 (mod p), then x 1 (mod p) or x 1 (mod p).. Proof: we use the fact that if p is prime and p divides ab, then p divides a or p divides b. x 2 1 (modp) p (x 2 1) = (x 1)(x + 1) p x 1 or p x + 1 x 1 (modp) or x 1 (modp) Give a counter example to show that the statement is not true if p is not prime Counter Example: consider p = 8. Then 1 2 = 1 1 (mod8), and 1 1 (mod8). 3 2 = 9 1 (mod8), but 3 ±1 (mod8). 5 2 = 25 1 (mod8), but 5 ±1 (mod8). 7 2 = 49 1 (mod8), and 7 1 (mod8). So the congruence x 2 1 (mod 8) has four solutions, x = 1, 3, 5, 7, but only two of them satisfy x 1 (mod 8) or x 1 (mod 8). Another Counter Example: consider p = 21 : (mod 21) but 8 ±1 (mod 21).
11 10. [10 marks; avg: 5.1] Find the remainder when is divided by 17. Solution: consider the two expressions, and For the first expression, we can use the fact that 2 4 = 16 1 (mod 17). Since = , it follows that = = (16) ( 1) (mod 17). For the second expression, use 7 2 = 49 2 (mod 17). Then, similar to the above calculation, = = , and so = ( 2) (2 4 ) ( 1) (mod 17). Thus ( ) ( 8 7) 15 2 (mod 17), and the remainder is 2. OR: reduce the second expression as follows: = ( 7) 6593 and observe that 7 10 ( mod 17). Since 6593 = , it follows that = ( 7) (mod 17) (mod 17) (mod 17) ( 2) (mod 17) (mod 17) (mod 17) (2 4 ) (mod 17) ( 1) (mod 17) 1 10 (mod 17) 10 (mod 17), from which, ( ) ( ) (mod 17) 2 (mod 17), as before. OR: use (mod 17) (mod 17) (mod 17)
12 This page is for rough work or for extra space to finish a previous problem. It will not be marked unless you have indicated in a previous question to look at this page.
13 This page is for rough work or for extra space to finish a previous problem. It will not be marked unless you have indicated in a previous question to look at this page.
14 This page is for rough work or for extra space to finish a previous problem. It will not be marked unless you have indicated in a previous question to look at this page.
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 informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationBeautiful Mathematics
Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationFall 2014 CMSC250/250H Midterm II
Fall 2014 CMSC250/250H Midterm II Circle Your Section! 0101 (10am: 3120, Ladan) 0102 (11am: 3120, Ladan) 0103 (Noon: 3120, Peter) 0201 (2pm: 3120, Yi) 0202 (10am: 1121, Vikas) 0203 (11am: 1121, Vikas)
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationWORKSHEET 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 informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationMathematical Induction
Mathematical Induction Representation of integers Mathematical Induction Reading (Epp s textbook) 5.1 5.3 1 Representations of Integers Let b be a positive integer greater than 1. Then if n is a positive
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationDiscrete Math. Instructor: Mike Picollelli. Day 10
Day 10 Fibonacci Redux. Last time, we saw that F n = 1 5 (( 1 + ) n ( 5 2 1 ) n ) 5. 2 What Makes The Fibonacci Numbers So Special? The Fibonacci numbers are a particular type of recurrence relation, a
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationMATH 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 informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationMath 261 Spring 2014 Final Exam May 5, 2014
Math 261 Spring 2014 Final Exam May 5, 2014 1. Give a statement or the definition for ONE of the following in each category. Circle the letter next to the one you want graded. For an extra good final impression,
More informationFermat's Little Theorem
Fermat's Little Theorem CS 2800: Discrete Structures, Spring 2015 Sid Chaudhuri Not to be confused with... Fermat's Last Theorem: x n + y n = z n has no integer solution for n > 2 Recap: Modular Arithmetic
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationComputer Science Foundation Exam
Computer Science Foundation Exam May 6, 2016 Section II A DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question Max Pts Category Passing
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More information1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).
1. Prove that the number 123456782 cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3). Solution: First, note that 123456782 2 mod 3. How did we find out?
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationMath.3336: Discrete Mathematics. Primes and Greatest Common Divisors
Math.3336: Discrete Mathematics Primes and Greatest Common Divisors Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Puzzle: better than nothing Nothing is better than eternal bliss A burger is better than nothing ------------------------------------------------
More informationMath 3000 Section 003 Intro to Abstract Math Homework 6
Math 000 Section 00 Intro to Abstract Math Homework 6 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 01 Solutions April, 01 Please note that these solutions are
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationMath 3012 Applied Combinatorics Lecture 4
August 27, 2015 Math 3012 Applied Combinatorics Lecture 4 William T. Trotter trotter@math.gatech.edu The Principle of Math Induction Postulate If S is a set of positive integers, 1 is in S, and k + 1 is
More information2 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 informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More information3 - Induction and Recursion
November 14, 2017 3 - Induction and Recursion William T. Trotter trotter@math.gatech.edu Using Recurrence Equations (1) Basic Problem How many regions are determined by n lines that intersect in general
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationPUTNAM 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 informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
More informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
More informationNUMBER 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 informationDo not open this exam until you are told to begin. You will have 75 minutes for the exam.
Math 2603 Midterm 1 Spring 2018 Your Name Student ID # Section Do not open this exam until you are told to begin. You will have 75 minutes for the exam. Check that you have a complete exam. There are 5
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationSection 4. Quantitative Aptitude
Section 4 Quantitative Aptitude You will get 35 questions from Quantitative Aptitude in the SBI Clerical 2016 Prelims examination and 50 questions in the Mains examination. One new feature of the 2016
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationProblem Set 2 Solutions Math 311, Spring 2016
Problem Set 2 Solutions Math 311, Spring 2016 Directions: Name: You must complete (at least) a total of 8 problems, some of which have multiple parts. You may complete more than 8 problems, for possible
More informationPart I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS
CS131 Part I, Number Systems CS131 Mathematics for Computer Scientists II Note 1 INTEGERS The set of all integers will be denoted by Z. So Z = {..., 2, 1, 0, 1, 2,...}. The decimal number system uses the
More informationClock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school?
Clock Arithmetic We are going to learn all about clock addition and the relationship to remainders when you divide numbers. 1 Standard Clock Addition 1. If it is 9 o clock and you get out of school in
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More information2301 Assignment 1 Due Friday 19th March, 2 pm
Show all your work. Justify your solutions. Answers without justification will not receive full marks. Only hand in the problems on page 2. Practice Problems Question 1. Prove that if a b and a 3c then
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationFor your quiz in recitation this week, refer to these exercise generators:
Monday, Oct 29 Today we will talk about inverses in modular arithmetic, and the use of inverses to solve linear congruences. For your quiz in recitation this week, refer to these exercise generators: GCD
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest
More informationThe set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }
Integers and Division 1 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom
More information3.7 Non-linear Diophantine Equations
37 Non-linear Diophantine Equations As an example of the use of congruences we can use them to show when some Diophantine equations do not have integer solutions This is quite a negative application -
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationMidterm Exam Solution
Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
More informationIntegers and Division
Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMATH 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 informationn = p 1 p 2 p r = q 1 q 2 q m, then r = m (i.e. the number of primes in any prime decomposition
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Discrete Mathematics Factoring Recall. Fundamental Theorem of Arithmetic. Let n be a positive integer n > 1. Then n can be represented
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationWollongong College Australia
Wollongong College Australia University of Wollongong Diploma in Information Technology WUCT121 Discrete Mathematics Mid-Term Test #2 Autumn Session 2008 SOLUTIONS Time Allowed: 50 minutes DIRECTIONS TO
More informationCSE 20: Discrete Mathematics
Spring 2018 Summary So far: Today: Logic and proofs Divisibility, modular arithmetics Number Systems More logic definitions and proofs Reading: All of Chap. 1 + Chap 4.1, 4.2. Divisibility P = 5 divides
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationLecture 2. The Euclidean Algorithm and Numbers in Other Bases
Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More information