MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005
|
|
- Jennifer Belinda Atkins
- 5 years ago
- Views:
Transcription
1 MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers x and y such that 314x + 159y = 1. Solution: Using the Euclidean algorithm to find the greatest common divisor of a = 314 and b = 159, we have and the last nonzero remainder is (314, 159) = 1. Working from the bottom u, we have 1 = = = = = = = 4 ( ) = = 39 ( ) 155 = = ( ) = ( 40) and therefore, 1 = ( 40) , and one solution is x = 40, y = 79. Question 2. Let n be a comosite ositive integer and let be the smallest rime divisor of n. Show that if > n 1/3, then n/ is rime. Solution: Suose > n 1/3 and that n/ is comosite, so that n = a b, where 1 < a, b < n. Let q and r be any rime divisors of a and b, resectively, then q and r are also rime divisors of n, so that q and r. This imlies that 3 q r a b = n, that is, n 1/3, which is a contradiction. Therefore, n/ is rime.
2 Question 3. Find all ositive solutions in integers to the system of linear equations x + y + z = 31 2x + 2y + 3z = 41. Solution: Solving the first equation, we get the two-arameter family of solutions x = 31 t, y = t s, z = s for s, t Z. Since this must also be a solution of the second equation, we must have 2(31 t) + 2(t s) + 3s = 41, that is, s = 21. Therefore, there are no ositive solutions to the given system. Question 4. Prove or disrove that if a 2 b 2 (mod m), then a b (mod m) or a b (mod m). Solution: The statement is false, as can be seen by taking m = 24, a = 8 and b = 4, then a b 2 (mod 24), but 8 4 (mod 24). Question 5. Find all ositive integers m such that (mod m). Solution: We only need find all ositive divisors of = 710, and these are 1, 2, 5, 10, 71, 142, 355, 710. Question 6. Show that the difference of two consecutive cubes is never divisible by 5. Solution: For any integer n, we have (n + 1) 3 n 3 = 3n(n + 1) + 1, and it is easily seen that n(n + 1) is congruent to 0, 1, or 2 modulo 5, so that (n + 1) 3 n 3 can only be congruent to 1, 2, or 4 modulo 5. Question 7. Find the smallest odd integer n, with n > 3, such that 3 n, 5 n + 2, and 7 n + 4. Solution: We have to solve the simultaneous congruences n 3 (mod 3) n 3 (mod 5) n 3 (mod 7) and since 3, 5, and 7 are airwise relatively rime, their smallest common multile is = 105, and we may take n = = 108.
3 Question 8. (a) Find a ositive integer n such that 3 2 n, 4 2 n + 1, and 5 2 n + 2. (b) Can you find a ositive integer n such that 2 2 n, 3 2 n + 1, and 4 2 n + 2. Solution: (a) We solve the following simultaneous congruences using the Chinese remainder theorem: n 0 (mod 9) n 1 15 (mod 16) n 2 23 (mod 25). Here a 1 = 0, a 2 = 15, a 3 = 23 m 1 = 9, m 2 = 16, m 3 = 25, and M 1 = = 400, M 2 = 9 25 = 225, M 3 = 9 16 = 144. Also, solving the congrences M 1 y 1 1 (mod m 1 ) M 2 y 2 1 (mod m 2 ) M 3 y 3 1 (mod m 3 ) for the inverses y 1, y 2, and y 3, we have y 1 7 (mod 9), y 2 1 (mod 16), y 3 4 (mod 25), and the unique solution modulo is given by n = a 1 M 1 y 1 + a 2 M 2 y 2 + a 3 M 3 y 3 = = = (b) There does not exist a ositive integer n such that 2 2 n, 3 2 n + 1, and 4 2 n + 2, since if such an n existed, then we would have 4 n and 16 n + 2, however, this imlies that 4 n + 2 n = 2, which is a contradiction.
4 Question 9. What is the last digit of 7 355? Solution: We have (mod 10) (mod 10) (mod 10) and 355 = , so that ( 7 4) (mod 10), and the last digit of is a 3. Question 10. What is the remainder when is divided by 165? Solution: We have the following rime ower decomositions: and the following congruences: 314 = and 165 = (mod 3) (mod 5) (mod 11) so that , , and , and since the integers 3, 5, and 11 are airwise relatively rime, then also, that is, (mod 165). We also have the congruences: (mod 3) (mod 5) (mod 11) and again, since , , and , and the integers 3, 5, and 11 are airwise relatively rime, then also, that is, (mod 165). Therefore, (mod 165) and (mod 165), so that (mod 165), and since 162 = , then ( ) (mod 165).
5 Question 11. Prove that a n b n is divisible by the rime n + 1 if neither a nor b is. Solution: Note that if is a rime and (a, ) = 1 and (b, ) = 1, then from Fermat s theorem we have a 1 1 (mod ) and b 1 1 (mod ), so that a 1 b 1 0 (mod ). Now, if n + 1 a rime and (a, n + 1) = (b, n + 1) = 1, then from the above we have a n b n 0 (mod n + 1), that is, n + 1 a n b n. Question 12. Suose that is an odd rime. (a) Show that ( 1) 1 1 (mod ). (b) Show that ( 1) 0 (mod ). Solution: (a) Since is an odd rime and (k, ) = 1 for 1 k 1, then Fermat s theorem imlies that for 1 k 1, and therefore k 1 1 (mod ) ( 1) }{{} 1 times (b) Again, from Fermat s theorem we have k k (mod ) 1 1 (mod ). for 1 k 1, and therefore ( ) ( 1) (mod ) since 1 2 Question 13. Z +. Show that σ(n) is odd if n is a ower of 2. Solution: If n = 2 α, then σ (2 α ) = d 2 α d = α = 2α = 2 α+1 1, and σ (2 α ) = 2 α+1 1 is odd for all integers α 0.
6 Question 14. For which n is σ(n) odd? Solution: We have seen that if n = 2 α, then σ(n) is odd. Suose now that is an odd rime and that α is a ositive integer, then σ ( α ) = α = α+1 1 1, and σ ( α ) is odd if and only if the sum contains an odd number of terms, that is, if and only if α is an even integer. Therefore, σ(n) is odd if and only if in the rime ower decomosition of n, every odd rime occurs to an even ower, that is, if and only if n is erfect square or n is 2 times a erfect square. Question 15. Find a formula for σ 2 (n) = d n d 2. Solution: If is a rime and α is a ositive integer, then σ 2 ( α ) = d α d 2 = α = ( 2 ) α = 2α , and if the rime ower decomosition of n is given by where the k s are distinct rimes, then n = σ 2 (n) = r k=1 r k=1 α k k, 2α k k 1. Question 16. It was long thought that even erfect numbers ended alternately in 6 and 8. Show that this is not the case by verifying that the erfect numbers corresonding to the rimes both end in and Solution: Note that (mod 10) and 6 k 6 (mod 10) for all k 1. Now, if k 1 (mod 4), then k = 1 + 4m for some integer m 1, and 2 k m 2 (2 4) m 2 6 m (mod 10), so that 2 k 1 1 (mod 10) for all k 1, k 1 (mod 4). Also, if k = 1 + 4m, then k 1 = 4m and for all k 5, k 1 (mod 4), and therefore 2 k 1 ( 2 4) m 6 m 6 (mod 10) 2 k 1 ( 2 k 1 ) (mod 10) for all k 5, k 1 (mod 4). The result now follows since both 13 and 17 are congruent to 1 modulo 4.
7 Question 17. Show that all even erfect numbers end in 6 or 8. Solution: We have seen that any even erfect number n has the form n = 2 k 1 ( 2 k 1 ) where 2 k 1 is rime (and hence k is also rime). If k 1 (mod 4), then we saw in the revious roblem that the last digit of n is a 6. Suose now that k 3 (mod 4), then k = 3 + 4m for some integer m 0, so that 2 k 2 3 (2 4) m 23 6 m (mod 10) and 2 k 1 7 (mod 10). Also, so that for all k 3 (mod 4). 2 k ( 2 4) m (mod 10), n = 2 k 1 ( 2 k 1 ) (mod 10) Question 18. If n is an even erfect number, with n > 6, show that the sum of its digits is congruent to 1 modulo 9. Solution: Since 10 k 1 (mod 9) for all k 0, then any ositive integer n is congruent modulo 9 to the sum of it digits, so we only need to show that if n = 2 k 1 ( 2 k 1 ), k 3 is an even erfect number, then n is congruent to 1 modulo 9. Let n = 2 ( k 1 2 k 1 ) be an even erfect number, n > 6, then 2 k 1 and k are both odd rimes. Note that (mod 9), (mod 9), (mod 9). Also, since k is rime, then k ±1 (mod 6). If k 1 (mod 6), then k = 1 + 6m for some m 1, so that 2 k 2 (2 6) m 2 (mod 9), and Also, so that if k 1 (mod 6). 2 k (mod 9). 2 k 1 ( 2 6) m 1 (mod 9), n = 2 k 1 ( 2 k 1 ) 1 (mod 9)
8 If k 1 (mod 6), then k = 5 + 6m for some m 0, so that 2 k 2 5 (2 6) m 5 (mod 9), and Also, so that if k 1 (mod 6). 2 k (mod 9). 2 k ( 2 6) m 7 (mod 9), n = 2 k 1 ( 2 k 1 ) (mod 9) Question 19. Show that if n is odd, then φ(4n) = 2φ(n). Solution: If n is odd, then (4, n) = 1, so that φ(4n) = φ(4) φ(n) = 2φ(n). Question 20. Perfect numbers satisfy σ(n) = 2n. Which n satisfy φ(n) = 2n? Solution: If n is a ositive integer and φ(n) = 2n, then since φ(n) n 1, this imlies that 2n n 1, that is, n 1, which is a contradiction. Therefore, there are no ositive integers n for which φ(n) = 2n. Question 21. Note that = 3 2 φ(3) = 4 2 φ(4) = 5 2 φ(5) = 6 2 φ(6) = 7 2 φ(7) Guess a theorem! = 8 2 φ(8) Solution: The theorem was one that we roved in class, namely, n k=1 (k,n)=1 k = n 2 φ(n).
9 Question 22. Find all solutions of φ(n) = 4, and rove that there are no more. Solution: If the rime ower decomosition of the ositive integer n is given by where the i s are distinct odd rimes, then n = 2 α α1 1 α2 2 α k k, φ(n) = 2 α 1 α1 1 1 α2 1 2 α k 1 k ( 1 1)( 2 1) ( k 1), and it is clear that if φ(n) = 4 then n can have no more than 2 odd rime factors and these must occur to the first ower. It is also clear that the exonent of the ower of 2 must be less than or equal to 3. Thus, if φ(n) = 4, then n must have one of the forms n = 2 α for α 3, n = 2 α n = 2 α q for α 2, an odd rime for α 1,, q odd rimes In the first case, if n = 2 α, then φ(n) = 2 α 1 = 4 if and only if α 1 = 2, that is, α = 3, so n = 8 is one solution to φ(n) = 4. In the second case, if n = 2 α, where is an odd rime, then φ(n) = 2 α 1 ( 1), and φ(n) = 4 if and only if either α 1 = 1 and 1 = 2, or α 1 = 0 and 1 = 4, or α = 0 and 1 = 4. Thus, n is a solution to φ(n) = 4 if and only if n = 4 3 = 12 or n = 2 5 = 10, or n = 1 5 = 5. In the third case, if n = 2 α q, where and q are distinct odd rimes, then φ(n) = 2 α 1 ( 1)(q 1), and since both 1 and q 1 are even, then we must have α = 0. Also, since and q are distinct odd rimes, then ( 1)(q 1) = 4 imlies that one of 1 or q 1 equals 1 and the other equals 4, which is a contradiction. Thus, in this case φ(n) 4, and there are no solutions. Therefore, the only solutions to φ(n) = 4 are 5, 8, 10, and 12. Question 23. Show that if (m, n) = 2, then φ(m n) = 2 φ(m) φ(n). Solution: Let m = 2 r M and n = 2 s N where M and N are odd and one of r or s is 1, then (M, N) = 1 so that φ(m n) = 2 r+s 1 φ(m) φ(n), and and therefore φ(m) φ(n) = 2 r 1 φ(m) 2 s 1 φ(n) = 2 r+s 2 φ(m) φ(n), 2 φ(m) φ(n) = 2 r+s 1 φ(m) φ(n) = φ(m n).
10 Question 24. Show that if n 1 and n + 1 are both rimes, with n > 4, then φ(n) n 3. Solution: Since n > 4, then n 1 > 3, and since one of the consecutive integers n 1, n, and n + 1 is divisible by 3 and n 1 and n + 1 are rimes greater than 3, then 3 n. Also, n must be even, since n 1 and n + 1 are odd rimes, so that 2 n. Since (2, 3) = 1, and n is a common multile of 2 and 3, then 6 = 2 3 = [2, 3] also divides n, and we can write n = 2 a 3 b N where a 1 and b 1, and (2, N) = (3, N) = 1. Therefore, Question 25. φ(n) = 2 a 3 b 1 φ(n) 2 a 3 b 1 N = n 3. One of the rimitive roots of 19 is 2. Find all of the others. Solution: Since φ(19) = 18, and φ(18) = 6, then there are 6 incongruent rimitive roots of 19, and they are 2 u, 1 u 18, with (u, 18) = 1, that is, the incongruent rimitive roots of 19 are 2, 2 5, 2 7, 2 11, 2 13, Question 26. Suose that is a rime and a has order 4 modulo. What is the least ositive residue of (a + 1) 4 modulo? Solution: Since a 4 1 (mod ), then 5, and since a 4 1 = (a 2 1)(a 2 + 1), and is rime with a 2 1 (mod ), then a 2 + 1, that is, a 2 1 (mod ). Therefore, (a + 1) 4 a 4 + 4a 3 + 6a 2 + 4a a 6 + 4a (mod ), and (a + 1) 4 ( 4) (mod ), so the least ositive residue of (a + 1) 4 modulo is 4. Question 27. If r is a rimitive root of the rime, show that two consecutive owers of r have consecutive least ositive residues modulo, that is, show that there exists an integer k 1 such that r k+1 r k + 1 (mod ). Solution: The set {1, r, r 2,..., r 1 } forms reduced residue system modulo. Therefore, since the φ() = 1 integers {r 2 r, r 3 r 2, r 4 r 3,..., r r 1 } are all incongruent modulo, they also form a reduced residue system modulo, and there must be an integer k, with 1 k 1, such that r k+1 r k 1 (mod ).
11 Question 28. Show that if is an odd rime and a is a quadratic residue modulo, and a b 1 (mod ), then b is also a quadratic residue modulo. Solution: There exists an integer x such that x 2 and b is also a quadratic residue modulo. Question 29. a (mod ), so that (x b) 2 x 2 b 2 a b 2 (a b) b 1 b b (mod ), Suose that = q + 4a where and q are odd rimes. Show that ( ) a = ( ) a. q Solution: Suose first that a = 2, then q (mod 8), so that ( ) 2 = ( 1) = ( 1) q2 1 8 = ( ) 2. q Now suose that a is an odd rime, then = q + 4a imlies that q (mod a), so that and since q (mod 4), then 1 2 q 1 2 ( = a) ( q a), (mod 2), so that ( ) a ( = ( 1) a) 1 2 a 1 ( q 2 = ( 1) a) q 1 2 a 1 2 = ( ) a. q In the general case, if the rime ower decomosition of a is given by a = α0 0 α1 1 α2 2 α k k, where 0 = 2 and for 1 i k, the i s are distinct odd rimes, then ( α i ) i = ( ) i and since the Legendre symbol is multilicative, we have ( ) a = k i=0 α i odd ( ) i = α i odd 1 α i even k i=0 α i odd ( ) i = q ( ) a. q
12 Question 30. Show that 3 is a quadratic nonresidue of all rimes of the form 4 n + 1. Solution: If = 4 n + 1 is rime, where n 1, then 1 (mod 4), and from the law of quadratic recirocity, we have ( ) 3 ( =, 3) and since 4 n (mod 3), then ( ) 3 ( = = 3) ( ) 2 = ( 1) = 1. 3 Therefore, 3 is a quadratic nonresidue of any rime of the form 4 n + 1. Question 31. (a) Show that if 7 (mod 8) is rime, then (b) Find a factor of Solution: (a) If = 7 + 8k is a rime, then = k + 8k 2, and ( ) 2 = ( 1) = 1, and 2 is a quadratic residue modulo. From Euler s criteria, since (, 2) = 1, we have ( ) 2 (mod ), that is, (mod ), so that (b) If we let 1 2 = 83, then = = 167 is rime, and = From art (a), we know that so that = 167 is a factor of ,
Solutions to Exam 1. Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively rime ositive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). c) Find the remainder of 1 008
More informationExam 1 7 = = 49 2 ( ) = = 7 ( ) =
Exam 1 Problem 1. a) Define gcd(a, b). Using Euclid s algorithm comute gcd(889, 168). Then find x, y Z such that gcd(889, 168) = x 889 + y 168 (check your answer!). b) Let a be an integer. Prove that gcd(3a
More informationMath 124 Homework 5 Solutions
Math 12 Homework 5 Solutions by Luke Gustafson Fall 2003 1. 163 1 2 (mod 2 gives = 2 the smallest rime. 2a. First, consider = 2. We know 2 is not a uadratic residue if and only if 3, 5 (mod 8. By Dirichlet
More informationMTH 3527 Number Theory Quiz 10 (Some problems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that:
MTH 7 Number Theory Quiz 10 (Some roblems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that: (a) φ(n) = Solution: n = 4,, 6 since φ( ) = ( 1) =, φ() =
More informationQuadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).
Quadratic Residues 4--015 a is a quadratic residue mod m if x = a (mod m). Otherwise, a is a quadratic nonresidue. Quadratic Recirocity relates the solvability of the congruence x = (mod q) to the solvability
More informationIs 1 a Square Modulo p? Is 2?
Chater 21 Is 1 a Square Modulo? Is 2? In the revious chater we took various rimes and looked at the a s that were quadratic residues and the a s that were nonresidues. For examle, we made a table of squares
More informationb) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). Solution: a) Fermat s Little
More information6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method
Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.
More informationUNIVERSITY OF MANITOBA DATE: December 7, FINAL EXAMINATION TITLE PAGE TIME: 3 hours EXAMINER: M. Davidson
TITLE PAGE FAMILY NAME: (Print in ink) GIVEN NAME(S): (Print in ink) STUDENT NUMBER: SEAT NUMBER: SIGNATURE: (in ink) (I understand that cheating is a serious offense) INSTRUCTIONS TO STUDENTS: This is
More informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationDiscrete Square Root. Çetin Kaya Koç Winter / 11
Discrete Square Root Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2017 1 / 11 Discrete Square Root Problem The discrete square root problem is defined as the computation
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationOn the Fibonacci Sequence. By: Syrous Marivani LSUA. Mathematics Department. Alexandria, LA 71302
On the Fibonacci Sequence By: Syrous Marivani LSUA Mathematics Deartment Alexandria, LA 70 The so-called Fibonacci sequence {(n)} n 0 given by: (n) = (n ) + (n ), () where (0) = 0, and () =. The ollowing
More informationSolutions for the Practice Final
Solutions for the Practice Final 1. Ian and Nai play the game of todo, where at each stage one of them flips a coin and then rolls a die. The person who played gets as many points as the number rolled
More informationSolutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00
18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?
More informationCollection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02
Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Public Polynomial congruences come up constantly, even when one is dealing with much deeper problems
More informationUniversity of British Columbia. Math 312, Midterm, 6th of June 2017
University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.
More informationMT 430 Intro to Number Theory MIDTERM 2 PRACTICE
MT 40 Intro to Number Theory MIDTERM 2 PRACTICE Material covered Midterm 2 is comrehensive but will focus on the material of all the lectures from February 9 u to Aril 4 Please review the following toics
More informationIntroduction to Number Theory 2. c Eli Biham - November 5, Introduction to Number Theory 2 (12)
Introduction to Number Theory c Eli Biham - November 5, 006 345 Introduction to Number Theory (1) Quadratic Residues Definition: The numbers 0, 1,,...,(n 1) mod n, are called uadratic residues modulo n.
More information30 HWASIN PARK, JOONGSOO PARK AND DAEYEOUL KIM Lemma 1.1. Let =2 k q +1, k 2 Z +. Then the set of rimitive roots modulo is the set of quadratic non-re
J. KSIAM Vol.4, No.1, 29-38, 2000 A CRITERION ON PRIMITIVE ROOTS MODULO Hwasin Park, Joongsoo Park and Daeyeoul Kim Abstract. In this aer, we consider a criterion on rimitive roots modulo where is the
More informationCalculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.
Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating
More informationPractice Midterm 2 Solutions
Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s
More informationAssignment 2. Due: Monday Oct. 15, :59pm
Introduction To Discrete Math Due: Monday Oct. 15, 2012. 11:59pm Assignment 2 Instructor: Mohamed Omar Math 6a For all problems on assignments, you are allowed to use the textbook, class notes, and other
More informationLECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY
LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd
More informationSolutions for the Practice Questions
Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions
More informationSIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT
SIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT RICHARD J. MATHAR Abstract. The ositive integers corime to some integer m generate the abelian grou (Z/nZ) of multilication modulo m. Admitting
More informationx 8 (mod 15) x 8 3 (mod 5) eli 2 2y 6 (mod 10) y 3 (mod 5) 6x 9 (mod 11) y 3 (mod 11) So y = 3z + 3u + 3w (mod 990) z = (990/9) (990/9) 1
Exercise help set 6/2011 Number Theory 1. x 2 0 (mod 2) x 2 (mod 6) x 2 (mod 3) a) x 5 (mod 7) x 5 (mod 7) x 8 (mod 15) x 8 3 (mod 5) (x 8 2 (mod 3)) So x 0y + 2z + 5w + 8u (mod 210). y is not needed.
More informationSolutions for the 2nd Practice Midterm
Solutions for the 2nd Practice Midterm 1. (a) Use the Euclidean Algorithm to find the greatest common divisor of 44 and 17. The Euclidean Algorithm yields: 44 = 2 17 + 10 17 = 1 10 + 7 10 = 1 7 + 3 7 =
More informationMAT Modular arithmetic and number theory. Modular arithmetic
Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 10 1 of 17 The order of a number (mod n) Definition
More informationPublic Key Encryption
Math 210 Jerry L. Kazdan Public Key Encryption The essence of this procedure is that as far as we currently know, it is difficult to factor a number that is the product of two primes each having many,
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Theorem. Let n 1,..., n r be r positive integers relatively prime in pairs. (That is, gcd(n i, n j ) = 1 whenever 1 i < j r.) Let a 1,..., a r be any r integers. Then the
More informationImplementation / Programming: Random Number Generation
Introduction to Modeling and Simulation Implementation / Programming: Random Number Generation OSMAN BALCI Professor Department of Computer Science Virginia Polytechnic Institute and State University (Virginia
More informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem 8-3-2014 The Chinese Remainder Theorem gives solutions to systems of congruences with relatively prime moduli The solution to a system of congruences with relatively prime
More informationMath 412: Number Theory Lecture 6: congruence system and
Math 412: Number Theory Lecture 6: congruence system and classes Gexin Yu gyu@wm.edu College of William and Mary Chinese Remainder Theorem Chinese Remainder Theorem: let m 1, m 2,..., m k be pairwise coprimes.
More informationWilson s Theorem and Fermat s Theorem
Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson
More informationSheet 1: Introduction to prime numbers.
Option A Hand in at least one question from at least three sheets Sheet 1: Introduction to prime numbers. [provisional date for handing in: class 2.] 1. Use Sieve of Eratosthenes to find all prime numbers
More informationModular Arithmetic. claserken. July 2016
Modular Arithmetic claserken July 2016 Contents 1 Introduction 2 2 Modular Arithmetic 2 2.1 Modular Arithmetic Terminology.................. 2 2.2 Properties of Modular Arithmetic.................. 2 2.3
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationIntroduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.
THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT Introduction The rst Chinese problem in indeterminate analysis is encountered in a book written by the Chinese mathematician Sun Tzi. The problem
More informationMathematics Explorers Club Fall 2012 Number Theory and Cryptography
Mathematics Explorers Club Fall 2012 Number Theory and Cryptography Chapter 0: Introduction Number Theory enjoys a very long history in short, number theory is a study of integers. Mathematicians over
More informationNumber Theory. Konkreetne Matemaatika
ITT9131 Number Theory Konkreetne Matemaatika Chapter Four Divisibility Primes Prime examples Factorial Factors Relative primality `MOD': the Congruence Relation Independent Residues Additional Applications
More informationAn elementary study of Goldbach Conjecture
An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we
More informationDegree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS
Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: 2012-06-15 Subject: Mathematics and Modeling Level:
More informationMATH 118 PROBLEM SET 6
MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the
More informationALGEBRA: Chapter I: QUESTION BANK
1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationDiscrete Math Class 4 ( )
Discrete Math 37110 - Class 4 (2016-10-06) 41 Division vs congruences Instructor: László Babai Notes taken by Jacob Burroughs Revised by instructor DO 41 If m ab and gcd(a, m) = 1, then m b DO 42 If gcd(a,
More informationGoldbach Conjecture (7 th june 1742)
Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More informationTwo congruences involving 4-cores
Two congruences involving 4-cores ABSTRACT. The goal of this paper is to prove two new congruences involving 4- cores using elementary techniques; namely, if a 4 (n) denotes the number of 4-cores of n,
More informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
More informationData security (Cryptography) exercise book
University of Debrecen Faculty of Informatics Data security (Cryptography) exercise book 1 Contents 1 RSA 4 1.1 RSA in general.................................. 4 1.2 RSA background.................................
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationZhanjiang , People s Republic of China
Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,
More informationAlgorithmic Number Theory and Cryptography (CS 303)
Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic Jeremy R. Johnson 1 Introduction Objective: To become familiar with modular arithmetic and some key algorithmic constructions that
More informationLUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS
LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS DANIEL BACZKOWSKI, OLAOLU FASORANTI, AND CARRIE E. FINCH Abstract. In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of
More informationp 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.
Great Theoretical Ideas In Computer Science Steven Rudich CS - Spring Lecture Feb, Carnegie Mellon University Modular Arithmetic and the RSA Cryptosystem p- p MAX(a,b) + MIN(a,b) = a+b n m means that m
More informationTHE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LXI, 2015, f.2 THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m BY FLORIAN LUCA and AUGUSTINE O.
More informationMultiples and Divisibility
Multiples and Divisibility A multiple of a number is a product of that number and an integer. Divisibility: A number b is said to be divisible by another number a if b is a multiple of a. 45 is divisible
More informationCHAPTER 2. Modular Arithmetic
CHAPTER 2 Modular Arithmetic In studying the integers we have seen that is useful to write a = qb + r. Often we can solve problems by considering only the remainder, r. This throws away some of the information,
More informationON THE EQUATION a x x (mod b) Jam Germain
ON THE EQUATION a (mod b) Jam Germain Abstract. Recently Jimenez and Yebra [3] constructed, for any given a and b, solutions to the title equation. Moreover they showed how these can be lifted to higher
More informationMATH 135 Algebra, Solutions to Assignment 7
MATH 135 Algebra, Solutions to Assignment 7 1: (a Find the smallest non-negative integer x such that x 41 (mod 9. Solution: The smallest such x is the remainder when 41 is divided by 9. We have 41 = 9
More informationMATH 13150: Freshman Seminar Unit 15
MATH 1310: Freshman Seminar Unit 1 1. Powers in mod m arithmetic In this chapter, we ll learn an analogous result to Fermat s theorem. Fermat s theorem told us that if p is prime and p does not divide
More informationConjectures and Results on Super Congruences
Conjectures and Results on Suer Congruences Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn htt://math.nju.edu.cn/ zwsun Feb. 8, 2010 Part A. Previous Wor by Others What are
More informationPublic Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014
7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Theorem. Let m and n be two relatively prime positive integers. Let a and b be any two integers. Then the two congruences x a (mod m) x b (mod n) have common solutions. Any
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
More informationNumbers (8A) Young Won Lim 6/21/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationNumbers (8A) Young Won Lim 5/24/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationFermat s little theorem. RSA.
.. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:
More informationELEMENTS OF NUMBER THEORY & CONGRUENCES. Lagrange, Legendre and Gauss. Mth Mathematicst
ELEMENTS OF NUMBER THEORY & CONGRUENCES Lagrange, Legendre and Gauss ELEMENTS OF NUMBER THEORY & CONGRUENCES 1) If a 0, b 0 Z and a/b, b/a then 1) a=b 2) a=1 3) b=1 4) a=±b Ans : is 4 known result. If
More informationNumber Theory/Cryptography (part 1 of CSC 282)
Number Theory/Cryptography (part 1 of CSC 282) http://www.cs.rochester.edu/~stefanko/teaching/11cs282 1 Schedule The homework is due Sep 8 Graded homework will be available at noon Sep 9, noon. EXAM #1
More informationA REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.
#A40 INTEGERS 11 (2011) A REMARK ON A PAPER OF LUCA AND WALSH 1 Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China Min Tang 2 Department of Mathematics, Anhui Normal University,
More informationFinal exam. Question Points Score. Total: 150
MATH 11200/20 Final exam DECEMBER 9, 2016 ALAN CHANG Please present your solutions clearly and in an organized way Answer the questions in the space provided on the question sheets If you run out of room
More informationMath 319 Problem Set #7 Solution 18 April 2002
Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).
More informationMath 255 Spring 2017 Solving x 2 a (mod n)
Math 255 Spring 2017 Solving x 2 a (mod n) Contents 1 Lifting 1 2 Solving x 2 a (mod p k ) for p odd 3 3 Solving x 2 a (mod 2 k ) 5 4 Solving x 2 a (mod n) for general n 9 1 Lifting Definition 1.1. Let
More informationPRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania
#A52 INTEGERS 17 (2017) PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Lawrence Somer Department of
More informationDUBLIN CITY UNIVERSITY
DUBLIN CITY UNIVERSITY SEMESTER ONE EXAMINATIONS 2013 MODULE: (Title & Code) CA642 Cryptography and Number Theory COURSE: M.Sc. in Security and Forensic Computing YEAR: 1 EXAMINERS: (Including Telephone
More informationCaltech Harvey Mudd Mathematics Competition February 20, 2010
Mixer Round Solutions Caltech Harvey Mudd Mathematics Competition February 0, 00. (Ying-Ying Tran) Compute x such that 009 00 x (mod 0) and 0 x < 0. Solution: We can chec that 0 is prime. By Fermat s Little
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse
More information#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick
#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS Thomas A. Plick tomplick@gmail.com Received: 10/5/14, Revised: 9/17/16, Accepted: 1/23/17, Published: 2/13/17 Abstract We show that out of the
More informationIntroduction to Modular Arithmetic
1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian
More informationNumbers (8A) Young Won Lim 5/22/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationModular arithmetic Math 2320
Modular arithmetic Math 220 Fix an integer m 2, called the modulus. For any other integer a, we can use the division algorithm to write a = qm + r. The reduction of a modulo m is the remainder r resulting
More informationPrimitive Roots. Chapter Orders and Primitive Roots
Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are therefore generators in that sense,
More informationExample Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext
Cryptography Codes Lecture 3: The Times Cipher, Factors, Zero Divisors, and Multiplicative Inverses Spring 2015 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler New Cipher Times Enemy
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationLecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclid s GCD Algorithm
Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclid s GCD Algorithm Clock Math If it is 1:00 now. What time is it in 5 hours?
More informationMODULAR ARITHMETIC II: CONGRUENCES AND DIVISION
MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION MATH CIRCLE (BEGINNERS) 02/05/2012 Modular arithmetic. Two whole numbers a and b are said to be congruent modulo n, often written a b (mod n), if they give
More informationModular Arithmetic and Doomsday
Modular Arithmetic and Doomsday Blake Thornton Much of this is due directly to Joshua Zucker and Paul Zeitz. 1. Subtraction Magic Trick. While blindfolded, a magician asks a member from the audience to
More informationAlgorithmic Number Theory and Cryptography (CS 303)
Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic and the RSA Public Key Cryptosystem Jeremy R. Johnson 1 Introduction Objective: To understand what a public key cryptosystem is and
More information12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,...
12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,..., a (ra - 1)} a complete residue system modulo m? Prove your conjecture. (Try m
More informationCongruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)
Congruence Solving linear congruences A linear congruence is an expression in the form ax b (modm) a, b integers, m a positive integer, x an integer variable. x is a solution if it makes the congruence
More informationClass 8: Factors and Multiples (Lecture Notes)
Class 8: Factors and Multiples (Lecture Notes) If a number a divides another number b exactly, then we say that a is a factor of b and b is a multiple of a. Factor: A factor of a number is an exact divisor
More information