Math 261 Spring 2014 Final Exam May 5, 2014
|
|
- Antony Blair
- 5 years ago
- Views:
Transcription
1 Math 261 Spring 2014 Final Exam May 5, 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, you can give the definitions/statements for non-circled answers too! (Watch your time though.) (A) The Well-Ordering Axiom. The Well-Ordering Axiom says that every non-empty set of natural numbers has a least element. (B) The Division Algorithm The Division Algorithm says for natural numbers m and n there exist unique q and r such that m = qn + r and 0 r < n. State either one below (or both, for added impression). Circle the letter of the one you want graded. (A) The definition of a prime number. A prime number is a natural number p that cannot be written as p = a b for values a and b that are less than p. (B) The definition of a composite number. A composite number is a natural number n that can be written as n = a b for values a and b that are less than n. State either one below (or both, for added impression). Circle the letter of the one you want graded. (A) The FTOA (Existence) Include all hypotheses and conclusions. The FTOA (Existence) states that every natural number greater than 1 is either prime or can be written as a product of positive powers of primes. In symbols, n > 1 has a prime factorization where p i is prime and r i > 0 for all i. n = p r1 1 prj j, (B) The FTOA (Uniqueness) Include all hypotheses and conclusions. The FTOA (Uniqueness) states that the prime powers in the prime factorization for a natural number are unique and the primes used in the prime factorization are unique up to the order they are written.
2 State either one below (or both, for added impression). Circle the letter of the one you want graded. (A) The definition of a Complete Residue System Modulo n. A Complete Residue System Modulo n is a set of a values {a 1, a 2,..., a k } such that any integer x is congruent modulo n to one of the values in the set. In symbols, given an integer x we must have x a i (mod n) for some a i in our set. (B) The definition of the Canonical Complete Residue System Modulo n. The Canonical Complete Residue System Modulo n is the set {0, 1, 2,..., n 1}. State either one below (or both, for added impression). Circle the letter of the one you want graded. (A) The definition of ord n (a). For natural numbers a and n with (a, n) = 1, ord n (a) is the smallest natural number k such that a k 1(mod n). (B) The definition of the Euler-φ function φ(n). The Euler-φ function φ(n) counts the number of values less than or equal to n > 0 that are relatively prime to n. State either one below (or both, for added impression). Circle the letter of the one you want graded. (A) State Fermat s Little Theorem (any version). Include all hypotheses and conclusions. Fermat s Little Theorem (Version I) says for p a prime and (a, p) = 1, we have a p 1 1(mod p). Equivalently, Fermat s Little Theorem (Version II) says for p a prime and any integer a, we have a p a(mod p). (B) State Euler s Theorem. Include all hypotheses and conclusions. Euler s Theorem says for n > 0 and (a, n) = 1, we have a φ(n) 1(mod n).
3 2. Make a calculation (with some supporting justification) for ONE of the following in each category. Circle the letter next to the one you want graded. For an extra good final impression, you can make the other calculations too! (Watch your time though.) (A) Find x and y to write 96x + 21y = (96, 21). Begin by using the Euclidean Algorithm to find (96, 21): 96 = = = = So (96, 21) = 3. Then using the 3rd equation we know (96, 21) = 3 = Rewriting the 2nd equation gives 9 = and this combines with the previous equation to give (96, 21) = 12 1 ( ) = Finally, rewriting the 1st equation gives 12 = Combining this with the previous equation (96, 21) = = 2 ( ) 1 21 = So x = 2 and y = 9. (B) Find the number of zeroes at the end of the normal (base ten) representation of 24!. By the FTOA, every factor in 24! can be written as a product of primes. In particular, we are interested in the number of times the primes 2 and 5 appear since a zero at the end of a number corresponds to a factor of 10 = 2 5. Note that every other (even) factor in 24! contributes at least one power of 2, with 4 = 2 2, 8 = 2 3, and 12 = 2 2 3, 16 = 2 4, 20 = and 24 = contributing more. So there are = 2 20 powers of 2 in the prime factorization of 24!. Only every fifth factor in 24! contributes a power of 5, and these come from 5, 10 = 5 2, 15 = 5 3, and 20 = 5 4. So there are = 5 4 powers of 5 in the prime factorization of 24!. Each pair of 2 and 5 (multiplied together) contributes one more zero at the end of 15!. Since there are only four such pairs (because there are only four factors of 5), there must be FOUR zeroes at the end of 24!.
4 Question 2 continued... Calculate either one below (or both, for added impression). Circle the letter of the one you want graded. (A) Find the CCRS value corresponding to 2 67 (mod 31). By Fermat s Little Theorem (Version I), since (2, 31) = 1 we have Since 67 = we must have (mod 31) = = (2 30 ) (mod 31). It is easy to calculate 2 7 = 128. The correct CRS value a is such that 128 a is divisible by 31. Note that 4 31 = 124. So = 124 = 4 31 is divisible by 31. Therefore (mod 31). We could also perform this calculation by noting that ord 31 (2) = 5 since 2 5 1(mod 31). (B) Find any CRS value that is the inverse of 5(mod 57). First note that 57 = 3 19 is a composite number. Since (5, 57) = 1, Euler s Theorem says 5 φ(57) 1(mod 57). From our work in class, φ(57) = φ(3) φ(19) (since 3 and 19 are relatively prime) and it follows that φ(57) = 2 18 = 36. Then (mod 57). Then b = 5 35 is a CRS value that is the inverse since = (mod 57).
5 3. Let a, b, and n be integers with n > 0. The equation ax b(mod n) has a solution if and only if (a, n) b. You may cite only Chapter 1 results without proof. Proof: We will break this proof into two parts corresponding to the if and only if. Suppose ax b(mod n) has a solution. This means there exists a value for x such that n (ax b). By definition of divides, there is an integer z such that nz = ax b. Then ax nz = b. Taking y = z gives integers x and y with ax + ny = b. Now by Chapter 1 results, this equation only has solutions if (a, n) b. Now suppose (a, n) b with b = (a, n) k for some integer k. By Chapter 1 results, aˆx + nŷ = (a, n) for some integers ˆx and ŷ. Then aˆxk + nŷk = (a, n) k = b. Now nŷk = aˆxk b or n (aˆxk b). Then by definition of congruence aˆxk b(mod n) gives a solution to ax b(mod n) where x = ˆxk.
6 4. Prove ONE of the following statements (or both, for added impression). Clearly indicate which proof you are writing. If you write both, put one on the reverse side: (A) Show that there are no two natural numbers a and b such that a2 = 3. (This is a necessary step b2 to prove 3 is irrational, but you don t have to prove this latter statement) Proof: Assume for a contradiction that a2 b 2 = 3. This implies that a2 = 3b 2. By FTOA, both a and b have prime factorizations, say a = p r1 1 prj j by algebra a 2 and b 2 have prime factorizations a 2 = p 2r1 1 p 2rj j and b 2 = q 2s1 1 q 2r k k. and b = q s1 1 qr k k. Then Since each exponent of the primes in the factorization of a 2 is multiplied by 2, every power must be even. Similarly, each exponent of the primes in the factorization of b 2 is multiplied by 2, every power must be even. However, a 2 = 3b 2 implies that the power of 3 in the prime factorization of a 2 must be odd, since 3b 2 gives an odd (even plus one) number of occurrences of 3. This is contradicts that FTOA says prime factorizations are unique, but earlier we saw all powers in the prime factorization of a 2 were even. Therefore, we cannot have two natural numbers a and b such that a2 b 2 = 3. (B) Assume a2 = 3 for some natural numbers a and b. Then consider the set b2 S = {k 3 k and k 3 are natural numbers}. What can you say about this set? Try to use this set to prove 3 is irrational. Proof: Assume a2 = 3 for some natural numbers a and b and consider the set S. b2 Since a2 b 2 = 3 we have a b = 3 and a = b 3. Since a is a natural number, b 3 must be a natural number. This implies that S is a non-empty set of natural numbers. By WOA, S must have a least element, call it l. We can show 3 is irrational by demonstrating our assumptions lead to a contradiction. Consider our least element l. Since l S, there must be some natural number k with l = k 3. It follows that l 3 = k 3 3 = 3k is also a natural number. Now check this out: l 3 l = l( 3 1) = 3k l must also be a natural number. Also ( 3 1) > ( 1 1) = 0 and 1 = ( 4 1) > ( 3 1). But then l( 3 1) is a natural number less than l. Multiplying l( 3 1) by 3 gives 3l 3l which, by supposition, is the natural number 3l 3k. These imply that l( 3 1) is in S, but this contradicts our choice of l as the least element. Therefore, we cannot have natural numbers a and b with a2 b 2 = 3. 6
7 5. Prove ONE of the following statements (or both, for added impression). Clearly indicate which proof you are writing. If you write both, put one on the reverse side: (A) If p and q are distinct primes, then p q 1 + q p 1 = 1(mod p q). Proof: By Fermat s Little Theorem (Version I) p q 1 1(mod q) and q p 1 1(mod p). Note since p 0(mod p) and q 0(mod q) we also have p q 1 0 q 1 (mod p) 0(mod p) and q p 1 0 p 1 (mod q) 0(mod q). Putting together the pieces modulo p and q now gives: p q 1 + q p (mod p) 1(mod p) p q 1 + q p (mod q) 1(mod q) Now by Theorem 4.21 above, we have p q 1 + q p 1 1(mod p q). (B) If p is prime and a is an integer with 1 < a < p then p (a p + (p 1)!a). Proof: We must show that p (a p + (p 1)!a) or that a p + (p 1)!a = k p for some k Z. By Fermat s Little theorem, we know that a p a (mod p). By Wilson s Theorem, (p 1)! 1 (mod p), and it follows (using a Ch. 1 result) that a(p 1)! a (mod p). Then a p + (p 1)!a a + (p 1)!a (mod p) By FLT and Chapter 1 results a + ( a) (mod p) From what follows after Wilson s Theorem 0 (mod p) But this says that a p + (p 1)!a 0 = k p for some k Z. So p (a p + (p 1)!a).
8 6. Show n 5 n is divisible by 5 for every natural number n by writing a proof by induction. If you cannot prove it using induction, prove it another way (for reduced credit). Proof: Begin by considering the base case when n = 1. Since = 0 = 0 5, we see that 5 (1 2 1). Assume, as our induction hypothesis that the result holds up to n. That is, for every value i less than or equal to n we have 5 (i 5 i). In particular 5 (n 5 n) and n 5 n = 5j for some integer j. We now need to consider n + 1. Note that (n + 1) 5 (n + 1) can be written as n 5 + 5n n n 2 + 5n + 1 (n + 1) = n 5 n + 5(n 4 + 2n 3 + 2n 2 + n). By our induction hypothesis, 5 (n 5 n) and n 5 n = 5j. Then n + 1) 5 (n + 1) = 5j + 5(n 4 + 2n 3 + 2n 2 + n) = 5(j + n 4 + 2n 3 + 2n 2 + n). This shows that 5 ((n + 1) 5 (n + 1)) and the desired conclusion follows from proof by induction. Alternate, Reduced-Credit Proof: We know that p = 5 is a prime. Then by Fermat s Little Theorem (Version II) a 5 a(mod 5) for all natural numbers a. By definition of congruence, 5 (a 5 a) for such values of a. If instead we use Fermat s Little Theorem (Version I) then for (a, 5) = 1 we have a 4 1(mod 5). Multiplying this equation by a now gives a 5 a(mod 5) and the result follows as above. For a not relatively prime to 5, we must have 5 a since 5 is a prime. Then a 0(mod 5) and a (mod 5). By Chapter 1 results, a 5 a 0 0(mod 5) 0(mod 5). Then by definition of congruence, this says that 5 (a 5 a 0) or 5 (a 5 a).
Basic 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 informationNumber Theory Math 420 Silverman Exam #1 February 27, 2018
Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer
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 informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
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 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 informationAN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION
AN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION Recall that RSA works as follows. A wants B to communicate with A, but without E understanding the transmitted message. To do so: A broadcasts RSA method,
More informationMath 430 Midterm II Review Packet Spring 2018 SOLUTIONS TO PRACTICE PROBLEMS
Math 40 Midterm II Review Packet Spring 2018 SOLUTIONS TO PRACTICE PROBLEMS WARNING: Remember, it s best to rely as little as possible on my solutions. Therefore, I urge you to try the problems on your
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
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 informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationMAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018
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
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 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 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 informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
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 informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
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 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 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationExam 2 Solutions. In class questions
Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest
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 informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationSolutions 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 informationTheory of Numbers Problems
Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
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 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 informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationChapter 8. Introduction to Number Theory
Chapter 8 Introduction to Number Theory CRYPTOGRAPHY AND NETWORK SECURITY 1 Index 1. Prime Numbers 2. Fermat`s and Euler`s Theorems 3. Testing for Primality 4. Discrete Logarithms 2 Prime Numbers 3 Prime
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 informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
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 informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
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 informationName: Mathematics 1C03
Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam
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 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 information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationEuler s, Fermat s and Wilson s Theorems
Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing
More informationThe Chinese Remainder Theorem
Sacred Heart University piazzan@mail.sacredheart.edu March 29, 2018 Divisibility Divisibility We say a divides b, denoted as a b, if there exists k Z such that ak = b. Example: Consider 2 6. Then k = 3
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationUniversity 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 informationMATH 3240Q Introduction to Number Theory Homework 5
The good Christian should beware of mathematicians, and all those who make empty prophecies. The danger already exists that the mathematicians have made a covenant with the devil to darken the spirit and
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 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 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 informationMath.3336: Discrete Mathematics. Mathematical Induction
Math.3336: Discrete Mathematics Mathematical Induction Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d
10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to
More informationPLEASE DO ANY 6 of the following 8 problems. Work carefully
Ma2201/CS2022 Discrete Mathematics D Term, 2016 FINAL EXAM PRINT NAME NEATLY: SIGN : PLEASE DO ANY 6 of the following 8 problems. Work carefully and neatly. 1. (5 pts) A tech company currently has 5 programmers,
More informationThe Chinese Remainder Theorem
Sacred Heart University DigitalCommons@SHU Academic Festival Apr 20th, 9:30 AM - 10:45 AM The Chinese Remainder Theorem Nancirose Piazza Follow this and additional works at: http://digitalcommons.sacredheart.edu/acadfest
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationUNIT 4 NOTES: PROPERTIES & EXPRESSIONS
UNIT 4 NOTES: PROPERTIES & EXPRESSIONS Vocabulary Mathematics: (from Greek mathema, knowledge, study, learning ) Is the study of quantity, structure, space, and change. Algebra: Is the branch of mathematics
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationCS280, Spring 2004: Prelim Solutions
CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,
More informationCIS 6930/4930 Computer and Network Security. Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography
CIS 6930/4930 Computer and Network Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography 1 Review of Modular Arithmetic 2 Remainders and Congruency For any integer a and any positive
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
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 informationMath 430 Exam 2, Fall 2008
Do not distribute. IIT Dept. Applied Mathematics, February 16, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 2, Fall 2008 These theorems may be cited at any time during the test
More informationMath 5330 Spring Notes Congruences
Math 5330 Spring 2018 Notes Congruences One of the fundamental tools of number theory is the congruence. This idea will be critical to most of what we do the rest of the term. This set of notes partially
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 information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationReview 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 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 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 informationDiscrete Math I Exam II (2/9/12) Page 1
Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression
More informationASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9.
ASSIGNMENT 1 1. Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. 2. (i) If d a and d b, prove that d (a + b). (ii) More generally,
More informationMATH10040: 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 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 informationName: There are 8 questions on 13 pages, including this cover.
Name: There are 8 questions on 13 pages, including this cover. There are several blank pages at the end of your exam which you may as scrap paper or as additional space to continue an answer, if needed.
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 informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
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 informationRecitation 7: Existence Proofs and Mathematical Induction
Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationMath 299 Supplement: Modular Arithmetic Nov 8, 2013
Math 299 Supplement: Modular Arithmetic Nov 8, 2013 Numbers modulo n. We have previously seen examples of clock arithmetic, an algebraic system with only finitely many numbers. In this lecture, we make
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationNumber Theory and Algebra: A Brief Introduction
Number Theory and Algebra: A Brief Introduction Indian Statistical Institute Kolkata May 15, 2017 Elementary Number Theory: Modular Arithmetic Definition Let n be a positive integer and a and b two integers.
More information8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationPMA225 Practice Exam questions and solutions Victor P. Snaith
PMA225 Practice Exam questions and solutions 2005 Victor P. Snaith November 9, 2005 The duration of the PMA225 exam will be 2 HOURS. The rubric for the PMA225 exam will be: Answer any four questions. You
More information3.2 Solving linear congruences. v3
3.2 Solving linear congruences. v3 Solving equations of the form ax b (mod m), where x is an unknown integer. Example (i) Find an integer x for which 56x 1 mod 93. Solution We have already solved this
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 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 informationPart 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 informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationIntroduction 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 informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More information