PMA225 Practice Exam questions and solutions Victor P. Snaith
|
|
- Jerome Warren
- 5 years ago
- Views:
Transcription
1 PMA225 Practice Exam questions and solutions 2005 Victor P. Snaith November 9, 2005
2 The duration of the PMA225 exam will be 2 HOURS. The rubric for the PMA225 exam will be: Answer any four questions. You are advised not to answer more than four; if you do, only your best four will be counted. THE FOLLOWING ARE A SELECTION OF TYPICAL PMA225 EXAM QUESTIONS, BEARING IN MIND THAT 2005 IS THE FIRST YEAR OF THE COURSE 1. (i) You publish (n, e) = (205, 9) in the RSA directory and receive the number 19. Decode it. 10 marks (ii) Solve the congruence 20x 2 + x (modulo 205). 7 marks (iii) Find the remainder when 397! is divided by marks Solution to question 1: (i) 205 = 41 5 in prime factors. To decode we want d such that 9d 1 (modulo LCM(40, 4) so d = 9 will do. Then (modulo 5) 19 9 ( 1) while (modulo 41) ( 8) ( 4) It suffices to find an integer in the sequence 6, 47, 88, 129,... which is congruence to 4 (modulo 5). So the decoding is 129. (ii) By the Chinese Remainder Theorem we must solve 20x 2 +x+4 x 1 (modulo 5) and 20x 2 + x (modulo 41). Hence x 1 (modulo 5). Also multiplying by 2, 40x 2 + 2x (modulo 41) or equivalently (x 4)(x + 2) x 2 2x 8 0 (modulo 41). Hence x 4 (modulo 41) or x 2 (modulo 41). The simultaneous solutions of this are [86] 205 and [121] 205. (iii) In prime factors 2005 = By Wilson s Theorem 400! 1 (modulo 401) so that 397! or 397! ( 3) ( 2) ( 1) 1 so 6 397! 1 (modulo 401). Since 6 67 = 402 we have 397! 67 (modulo 401). Also 397! 0 (modulo 5). Now look for a multiple of 5 in the sequence 67, 468, 869, 1270,... so that 397! 1270 (modulo 2005) by the CRT. 1
3 2. (i) State the Law of Quadratic Reciprocity. 1 mark (ii) Determine whether the congruence 24x 2 + 7x (modulo 419) has a solution. 12 marks (iii) Let p > 3 be a prime. Show that the congruence x 4 + 7x (modulo p) does not have a solution if and only if p 11 (modulo 12). Find all the solutions in the cases p = 13, 29, marks Solution to question 2: (i) For p, q > 2 distinct primes ( ( ) q p) p (p 1)(q 1) q = ( 1) 4. (ii) 419 is prime. b 2 4ac = = We can solve the quadratic if this is a square (modulo 419). However ( ) ( ) = = ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) = = ( 1)( )( ) = ( 1 7 ) 1 11 = ( 1) = 1. So a solution exists. (iii) (x 2 +3)(x 2 +4) = x 4 +7x (modulo p) so the congruence does not have a solution if and only if ( ) ( ) ( ) ( ) ( ) 3 p = 1 = 4 p. Now 3 p = 1 3 p p = ( 1) ( ) (p 1)/2 (p 1)(3 1) p 3 ( 1) 4 =( p 3) = 1 if and only if p 2 (modulo 3). Also ( ) ( ) 4 p = 1 p = 1 if and only if p 3 (modulo 4). The only simultaneous solutions to these congruences are p 11 (modulo 12). For the other values we have: p = 13, x ±6, ±3 (modulo 13), p = 29, x ±5 (modulo 29), p = 43, x ±13 (modulo 43). 2
4 3. A positive integer n is said to be (a) abundant (b) deficient (c) perfect if the sum of its proper divisors is (a) great than n (b) less than n (c) equal to n, respectively. (i) If p is a positive integer such that 2 p 1 is prime show that 2 p 1 (2 p 1)is perfect. 6 marks (ii) For each of 496, 945, 1155 determine whether it is abundant, deficient or perfect. 9 marks (iii) Show that every multiple of an abundant number is abundant. 4 marks (iv) Show that a power of a prime is deficient. 6 marks Solution to question 3: (i) Using the σ function from 5.2: σ(2 p 1 (2 p 1)) = σ(2 p 1 )σ((2 p 1)) = ( p 1 )(1 + 2 p 1) = 2 2 p 1 (2 p 1) so the proper divisors sum to 2 p 1 (2 p 1). (ii) 496 = 2 4 (2 5 1) by (i) is perfect. σ(945) = σ( ) = ( ) 6 8 = > so it is abundant. σ(1155) = σ( ) = < so it is deficient. (iii) Let n be abundant with proper positive divisors n 1,..., n r. So n n r > n. For a positive integer k we have kn kn r > kn but the kn i are some of the proper positive divisors of kn, so the sum of proper positive divisors of kn is strictly larger than kn. (iv) Let p be a prime then the proper positive divisors of p n are 1, p, p 2,..., p n 1 whose sum is (p n 1)/(p 1) < p n so it is deficient. 3
5 4(i) Find all the primitive Pythagorean triples which include the number marks (ii) You publish (n, e) = (1147, 11) in the RSA directory and receive the number 21. Decode it. 14 marks (iii) Determine the remainder when 99! is divided by marks Solution to question 4: (i) 2st = 2004 if and only if st = 1002 = in prime factors. Here are the triples: s t 2st s 2 t 2 s 2 + t (ii) 1147 = so we need d such that 11d 1 (modulo LCM(30, 36)) so 11d 1 (modulo 180). Using the Chinese Remainder Theorem or experimentation yields d = 131 because (11 131) 1 = 1440 = To decode we need (modulo 31) (21 30 ) 4 ( 10) = and (modulo 37) ( 3) ( 10) ( 11) 3 4. To solve x 4 (modulo 37) and x 12 (modulo 31) simultaneously use the CRT or search among x = 37k+4 12 for an integer divisible by 31. Either way one finds x 818 (modulo 1147) since 818 = 4+(37 22) = 12+(31 26). (iii) 103 is prime so 102! 1 (modulo 103) by Wilson s theorem. Hence 99! ( 1) ( 2) () 1 (modulo 103). Hence 99! is the solution to 6x 1 (modulo 103). By the Euclidean algorithm for LCM(6, 103) = 1 or experimentation one finds 6 86 = 516 = (5 103)
6 5(i). State Fermat s Little Theorem. 1 mark 5(ii) What day of the week will it be in days from today? 5 mark (iii) Find the remainder when is divided by marks (iv) Prove that a 561 a (modulo 561) for all integers a. 6 marks (v) The integer n > 1 is such that a n a (modulo n) for all integers a. Must n be prime? 2 marks (vi) The integer n > 1 is such that a n 1 1 (modulo n) for all positive integers a smaller than n. Prove that n must be prime. 5 marks Solution to question 5: (i) If p is a prime and a is an integer such that GCD(p, a) = 1 then a p 1 1 (modulo p). (ii) (modulo 7) so (modulo 7) so it is four days after today in the week. (iii) 561 = in prime factors we may use the CRT. Now (modulo 3), (3 10 ) 56 1 (modulo 11) and (3 16 ) 35 1 (modulo 17), Solve these three simultaneous congruences by the CRT algorithm or by experimentation to find that x 375 (modulo 561) is the solution. (iv) The smallest Carmichael number is n = 561 = Consider a 561 a (modulo 17), which is obvious if 17 a and otherwise we have a 561 = a (a 16 ) 35 a (modulo 17). If a 0 (modulo 3) then a 561 a (a 2 ) 280 a (modulo 3) and if a 0 (modulo 11) then a 561 a (a 10 ) 56 a (modulo 11), as required. (v) No - since 561 of (iv) is a counterexample. (vi) Suppose n is not prime. Then m n for some 1 < m < n. Therefore m n 1 1 (modulo n) and so 0 m n 1 1 (modulo m), which is a contradiction. 5
7 6(i) For each of the following numbers, find a prime number which divides it: , and marks (ii) Let p > 5 be a prime. Show that the congruence x 4 2x (modulo p) has no solutions if and only if p 2 or (modulo 15). 9 marks (iii) Solve the congruence of (ii) in the cases p = 29, 31, marks Solution to question 6: (i) 3 ( ) because (modulo 3) ( 1) ( ) because (modulo 17) ( ( 1) is a prime so, by Euler s criterion, 2 83 ( ) (modulo 167), since (modulo 8) or because (modulo 167). (ii) x 4 2x 2 15 = (x 2 5)(x 2 +3) so x is a solution of the congruence if and only if x 2 3 (modulo p) or x 2 5 (modulo p). Hence there is no solution if and only if ( ) ( ) ( ) ( ) 3 p = 1 = 5 p. This is equivalent to p 3 = 1 = p 5, by Quadratic Reciprocity and ( ) 1 p = ( 1) (p 1)/2. This happens if and only if p 2 (modulo 3) and p 2 or 3 (modulo 5), which happens if and only if p 2 or (modulo 15). (iii) p = 29 : By (ii) there is no solution to x (modulo 29) but x = ±11 (modulo 29) is a solution to x p = 31 : By (ii) there are 4 solutions and these are x ±11, ±6 (modulo 31). p = 37 : By (ii) x 2 5 has no solution but x = ±16 (modulo 37) satisfies x
8 7.(i) Define a perfect number. 1 mark Calculate and Let n be a perfect number. State the value of d n 1 where the sum is over all the positive d divisors of n. 3 marks Deduce that no proper divisor of a perfect number is perfect and no proper multiple of a perfect number is perfect. 5 marks (ii) Two positive integers are said to be amicable numbers if each is the sum of the proper divisors of the other. The prime numbers p, q, r are such that p = (3 2 n ) 1, q = (3 2 n 1 ) 1 and r = (9 2 2n 1 ) 1 for some integer n > 1. Use the result that σ(ab) = σ(a)σ(b) if GCD(a, b) = 1 to prove that σ(2 n pq) = σ(2 n r) = 2 n pq + 2 n r. 10 marks Deduce that 2 n pq and 2 n r are amicable. 4 marks Illustrate with an example 2 marks Solution to question 7: (i) A perfect number is a positive integer equal to the sum of its proper 1 positive divisors = 2 and = 2. If n is perfect d n 1 = 2. d Let n be perfect and m n with 1 < m < n and let r > 1 then d m 1 < d d n 1 = 2 and d d rn 1 > d d n 1 = 2 so m and rn are not perfect. d (ii) σ(2 n pq) = σ(2 n )σ(p)σ(q) = ( n ) 3 2 n 3 2 n 1 = (2 n+1 1) 9 2 2n 1 and σ(2 n r) = (2 n+1 1) 9 2 2n 1, as required. Also 2 n pq + 2 n r = 2 n ((3 2 n ) 1)((3 2 n 1 ) 1) + ((9 2 2n 1 ) 1)) = 2 n ( n n 1 (2 + 1)) = (2 n+1 1) 9 2 2n 1. The sum of the positive proper divisors of 2 n pq is σ(2 n pq) 2 n pq = 2 n r and the sum of the positive proper divisors of 2 n r is σ(2 n r) 2 n r = 2 n pq so 2 n pq and 2 n r are amicable. Putting n = 2, p = 11, q = 5, r = 71 we see that 2 n pq = 220 and 2 n r = 284 are amicable. 7
MATH 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 informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
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 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 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 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 informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
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 informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
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 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 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 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 informationIterated Encryption and Wiener s attack on RSA
Iterated Encryption Euler s function Euler s function: φ(n) = {1 x n : gcd(x, n) = 1} Theorem (Euler) If n is a positive integer and m is a positive integer coprime to n then m φ(n) mod n = 1. Iterated
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 informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationMathematics 4: Number Theory Problem Sheet 3. Workshop 26 Oct 2012
Mathematics 4: Number Theory Problem Sheet 3 Workshop 26 Oct 2012 The aim of this workshop is to show that Carmichael numbers are squarefree and have at least 3 distinct prime factors (1) (Warm-up question)
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 informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
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 informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
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 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 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 informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
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 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 informationNumber Tree LCM HCF Divisibility Rules Power cycle Remainder Theorem Remainder of powers a n b n Last and Second last digit Power of Exponents Euler s
Vedic Numbers Number Tree LCM HCF Divisibility Rules Power cycle Remainder Theorem Remainder of powers a n b n Last and Second last digit Power of Exponents Euler s Theorem Fermet s Theory Wilson Theorem
More informationTHE TRIANGULAR THEOREM OF THE PRIMES : BINARY QUADRATIC FORMS AND PRIMITIVE PYTHAGOREAN TRIPLES
THE TRIANGULAR THEOREM OF THE PRIMES : BINARY QUADRATIC FORMS AND PRIMITIVE PYTHAGOREAN TRIPLES Abstract. This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles
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 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 informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationSenior Math Circles Cryptography and Number Theory Week 2
Senior Math Circles Cryptography and Number Theory Week 2 Dale Brydon Feb. 9, 2014 1 Divisibility and Inverses At the end of last time, we saw that not all numbers have inverses mod n, but some do. We
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
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 informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationThe number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.
The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class
More information1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
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 informationChapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives
More informationMath 4400 First Midterm Examination September 21, 2012 ANSWER KEY. Please indicate your reasoning and show all work on this exam paper.
Name: Math 4400 First Midterm Examination September 21, 2012 ANSWER KEY Please indicate your reasoning and show all work on this exam paper. Relax and good luck! Problem Points Score 1 20 20 2 20 20 3
More informationSelected Chapters from Number Theory and Algebra
Selected Chapters from Number Theory and Algebra A project under construction Franz Rothe Department of Mathematics University of North Carolina at Charlotte Charlotte, NC 83 frothe@uncc.edu December 8,
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 informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving 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 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 informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
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 informationThis is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
More informationMath 314 Course Notes: Brief description
Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be
More informationIntroduction to Information Security
Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility
More informationNumber Theory. Henry Liu, 6 July 2007
Number Theory Henry Liu, 6 July 007 1. Introduction In one sentence, number theory is the area of mathematics which studies the properties of integers. Some of the most studied subareas are the theories
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 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 informationHOMEWORK 11 MATH 4753
HOMEWORK 11 MATH 4753 Recall that R = Z[x]/(x N 1) where N > 1. For p > 1 any modulus (not necessarily prime), R p = (Z/pZ)[x]/(x N 1). We do not assume p, q are prime below unless otherwise stated. Question
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 informationNumbers. Çetin Kaya Koç Winter / 18
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 18 Number Systems and Sets We represent the set of integers as Z = {..., 3, 2, 1,0,1,2,3,...} We denote the set of positive integers modulo n as
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 informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More 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 informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
More information4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...
PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers
More information[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives
[Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime
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 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 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 information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
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 informationMathematics of Cryptography
Modulo arithmetic Fermat's Little Theorem If p is prime and 0 < a < p, then a p 1 = 1 mod p Ex: 3 (5 1) = 81 = 1 mod 5 36 (29 1) = 37711171281396032013366321198900157303750656 = 1 mod 29 (see http://gauss.ececs.uc.edu/courses/c472/java/fermat/fermat.html)
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationNumber Theory Course notes for MA 341, Spring 2018
Number Theory Course notes for MA 341, Spring 2018 Jared Weinstein May 2, 2018 Contents 1 Basic properties of the integers 3 1.1 Definitions: Z and Q....................... 3 1.2 The well-ordering principle...................
More informationMTH 346: The Chinese Remainder Theorem
MTH 346: The Chinese Remainder Theorem March 3, 2014 1 Introduction In this lab we are studying the Chinese Remainder Theorem. We are going to study how to solve two congruences, find what conditions are
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 informationThe security of RSA (part 1) The security of RSA (part 1)
The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 i.e. q = (n φ(n) + 1)
More informationCryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press
AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis
More informationPerfect Power Riesel Numbers
Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA 24450 b Department of Mathematics, Shippensburg University, Shippensburg,
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 information4 Number Theory and Cryptography
4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
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 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 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 informationElliptic Curves over Finite Fields
Elliptic Curves over Finite Fields Katherine E. Stange Stanford University Boise REU, June 14th, 2011 Consider a cubic curve of the form E : y 2 + a 1 xy + a 3 y = x 3 + a 2 x 2 + a 4 x + a 6 If you intersect
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
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 informationApplied Cryptography and Computer Security CSE 664 Spring 2018
Applied Cryptography and Computer Security Lecture 12: Introduction to Number Theory II Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline This time we ll finish the
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationLecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 8 1 The following are equivalent (TFAE) 2 Inverses 3 More on Multiplicative Inverses 4 Linear Congruence Theorem 2 [LCT2] 5 Fermat
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationChinese Remainder Theorem explained with rotations
Chinese Remainder Theorem explained with rotations Reference: Antonella Perucca, The Chinese Remainder Clock, The College Mathematics Journal, 2017, Vol. 48, No. 2, pp. 82-89. 2 One step-wise rotation
More information