Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS
|
|
- Dulcie McCoy
- 5 years ago
- Views:
Transcription
1 Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: Subject: Mathematics and Modeling Level: Master Course code:5ma11e
2 Abstract In this thesis we study the number of periodic points of congruential monomial dynamical system. By concept of index calculus we are able to calculate the number of solutions for congruential equations. We give formula for the number of r-periodic points over prime power. Then we discuss about calculating the total number of periodic points and cycles of length r for prime power. Keywords: periodic points, monomial dynamical system, index calculus, cycle of length r. 2
3 Acknowledgments We would like to express special gratitude to our supervisor Marcus Nilsson for his invaluable suggestions and thought - provoking discussions during the entire thesis work. He has been enormously supportive in shaping our ideas to carry out this work within the time frame. We owe special thanks to Professor Andrei Khrennikov from which we have learnt a lot. We are deeply and forever indebted to our parents and family for their love, support and encouragement throughout our entire student life. We owe a great many thanks to a great many people who helped and supported us during the writing of this thesis. We also very thankful to Swedish Government for giving golden opportunity to stay and study in Sweden. At last we would like to dedicate our whole thesis work to great mother late Ulfat Bi Bi. 3
4 Contents 1 Introduction 4 2 Index Calculus 5 3 Solution of Equations Modulo a Prime Number Solution of Equation x 2 1 (mod p) Solution of Equation x m 1 (mod 2) Solution of Equation x m 1 (mod p) Solution of Equations Modulo Composite Number Solution of Equation x m 1 (mod p k ) Solution of Equation x m 1 (mod 2 k ) Solution of Equation x m 1 (mod p q) Solution of Equation x m 1 (mod p k q k ) Number of r Periodic Points to Monomial Dynamical System 19 6 Number of Total Periodic Points to Monomial Dynamical System 23 4
5 1 Introduction Carl Friedrich Gauss was a mathematician who published Disquisitiones Arithmeticae in 1801, which was a text book of number theory. Carl Gustav Jacobi published a book of all indices modulo any prime less than equal to 1000 in After creation of the Diffe-Hellman cryptosystem in 1976 index calculus became important[7]. Residue arithmetic has close relation to theory of dynamical systems. Such systems describe time evolution of states of physical, biological and financial system, e.g. the stock exchange, the weather conditions directly depend on time. So we can describe these phenomena with the aid of dynamical system. There are two types of dynamical systems: Continuous and discrete. A discrete system is generated by iteration of a function. By discrete dynamical system we can describe phenomena which are related to certain moments[4], e.g. measurements at certain moments of time. They have many applications in biology and physics[8]. Continuous dynamical systems describe phenomena, which evolve continuously with time [4]. We have studied monomial dynamical system f(x) = x m for the finite set of prime powers. This paper is organized as follows: Section 2 defines some basic definitions and properties of index calculus. Section 3 gives solution of congruential equation for prime numbers and some theorems. We will solve the congruence equation modulo 2. Section 4 we will find the solution for prime power 2 k and also for composite numbers. Section 5 introduces number of cycles to the monomial dynamical system. By using Möbius inversion formula, we have proved a formula for the number of cycles of length r. Section 6 we will derive a formula to calculate total periodic points for prime power. We will state some theorems and examples to understand it. 5
6 2 Index Calculus In this section, we will discuss index calculus. We will also define some basic definitions and state some theorems. For this section, we have taken the material from [1],[2] and [3]. Definition 2.1. Suppose a and b are non zero integers. Then the largest integer d = (a, b) that divides both a and b is called greatest common divisor of a and b. Definition 2.2. The least positive integer x such that a x 1 (mod n) is called the order of modulo n, where (a, n) = 1. The order of a modulo n is denoted by ord n a. Definition 2.3. Suppose n is a positive integer. The Euler phi-function φ(n) is said to be the number of positive integers not greater than n and also relatively prime to n. Definition 2.4. Suppose r and n are relatively prime integers with n > 0. Then r is called a primitive root modulo n if ord n r = φ(n). Definition 2.5. If unique integer x with 1 x φ(n) and a is positive integer with (a, n) = 1, then r x a (mod n) is called index of a to base r modulo n. Where n be a positive integer with primitive root r. Theorem 2.1. Chinese Remainder Theorem. Suppose n 1, n 2... n k are pairwise relatively prime positive integers. Then Congruence system x a 1 (mod n 1 ), x a 2 (mod n 2 ),. x a k (mod n k ), has a unique solution modulo n = n 1 n 2... n k. Theorem 2.2. Let a, b, d and n are integers with n > 0. If d b,then ax b (mod n) has no solution and if d b, then ax b (mod n) has exactly d incongruent solutions modulo n. Where d = (a, n). Theorem 2.3. Let n be a positive integer with primitive root r and a, b be integers relatively prime to n. Then, (i) ind r 1 0 (mod φ(n)), (ii) ind r (ab) ind r a + ind r b (mod φ(n)), (iii) ind r a m m ind r a (mod φ(n)), where m is a positive integer. 6
7 Theorem 2.4. Suppose n is a positive integer with primitive root. Let m is positive integer and a is an integer relatively prime to n. Then congruence x m a (mod n) has exactly d incongruent solution modulo n if and only if 1 (mod n), where d = (m, φ(n)) is a positive integer. a Φ(n) d Proof. Suppose m and n are positive integers. So the congruence equation is x m a (mod n). Let r be a primitive root modulo n. Now taking index on both sides with base r, ind r x m ind r a (mod φ(n)), m ind r x ind r a (mod φ(n)). Let d = (m, φ(n)) and y = ind r x. Then, x r y (mod n). According to Theorem 2.2 If d b, then ax b (mod n) has no solution and if d b, then ax b (mod n) has exactly d incongruent solutions modulo n. Where a, b and n be integers n > 0 and (a, n) = d. So by theorem 2.2.if d ind r a then the linear congruence my ind r a (mod φ(n)) has no solution. If d ind r a then my ind r a (mod φ(n)) has exactly d incongruent solution modulo φ(n). Now d ind r a if and only if (φ(n)/d) ind r a 0 ind r a (φ(n) d) ind r 1 (mod φ(n)), a φ(n) d 1 (mod n). (mod φ(n)), So theorem is true. 3 Solution of Equations Modulo a Prime Number 3.1 Solution of Equation x 2 1 (mod p) Let r be the least positive primitive root modulo p, where p > 2 is a prime number. x 2 1 (mod p). (3.1) Taking index on both sides of above congruence equation to base r modulo p. We obtain a congruence modulo φ (p) = p 1, ind r x 2 ind r 1 (mod p 1). 7
8 By Theorem 2.3 ind r 1 = 0. So, 2 ind r x 0 (mod p 1). According to Theorem 2.4, this equation has d = (2, p 1) = 2 solutions. Since p is odd. ind r x l 1, l 2 (mod p 1), where ind r c = l 1 and ind r g = l 2. So, x c, g (mod p). Hence equation x 2 1 (mod p) has two incongruent solutions x c, g (mod p). Theorem 3.1. Suppose p be a prime. The equation x 2 1 (mod p) has (2, φ(p)) = 2 solutions. Example 3.1. Let p = 3, then equation (3.1) become, x 2 1 (mod 3). We find that 2 is a least positive primitive root of 3 ( (mod 3) ). Now taking index on both sides of the congruence to base 2 modulo 3. We a 1 2 ind 2 a 0 1 Table 1: Indices to the Base 2 Modulo 3 obtain a congruence modulo φ(3) = 2, ind 2 x 2 ind 2 1 (mod 2). By Theorem 2.3 ind 2 1 = 0. So, 2 ind 2 x 0 (mod 2). According to Theorem 2.4 d = (2, 2) = 2. Then, ind 2 x 0, 1 (mod 2), so there are two incongruent solutions x 1, 2 (mod 3). Example 3.2. Let p = 11 then equation (3.1) become, x 2 1 (mod 11). We find that 2 is the least positive primitive root of 11 ( (mod 11) ). We 8
9 a ind 2 a Table 2: Indices to the Base 2 Modulo 11 obtain following table. Taking index on both sides of the congruence to base 2 modulo 11. We obtain a congruence modulo φ(11) = 10, ind 2 x 2 ind 2 1 (mod 10), 2 ind 2 x 0 (mod 10). According to Theorem 2.4 d = (2, φ(11)) = 2, so ind 2 x 0, 5 (mod 10), then there are two incongruent solutions x 1, 10 (mod 11). 3.2 Solution of Equation x m 1 (mod 2) Let m be a positive integer and p = 2. Then by Theorem 2.4 (m, φ(2)) = 1 for every m Z +, so there exixt a unique solution which is x 1 (mod 2). Example 3.3. If p is a prime integer (p = 2) and m Z +. solution of congruence, x m 1 (mod 2). Let m = 3, then equation become, Then find the x 3 1 (mod 2). There are only two possibilities which are x 0 (mod 2) and x 1 (mod 2). But x 0 (mod 2) is not a solution. Again by Theorem 2.4, (3, φ(2)) = 1, so we have a unique solution x 1 (mod 2). 3.3 Solution of Equation x m 1 (mod p) Suppose m be a positive integer and p > 2 be a prime number, x m 1 (mod p). (3.2) Let r is the least positive primitive root modulo p. Taking index on both sides of the congruence to base r modulo p. We obtain a congruence modulo φ (p) = p 1, ind r x m ind r 1 (mod p 1). By Theorem 2.3 ind r 1 = 0. So, m ind r x 0 (mod p 1). 9
10 According to Theorem 2.4 This equation has k = (m, p 1) solutions, so ind r x l 1, l 2... l k (mod p 1), if ind r a 1 = l 1... ind r a k = l k. Then solutions of equation are, x a 1, a 2... a k (mod p). Theorem 3.2. The equation x m 1 (mod p) has (m, φ(p)) incongruent slutions, where m be a positive integer and p is a prime. Example 3.4. Let m = 3 and p = 11, then equation (3.2) become, x 3 1 (mod 11). We find that 2 is the least positive primitive root of 11 ( (mod 11) ). So we obtain following table. a ind 2 a Table 3: Indices to the Base 2 Modulo 11 Taking index on both sides of the congruence to base 2 modulo 11. We get a congruence modulo φ(11) = 10, By Theorem 2.3 ind 2 1 = 0. Then, ind 2 x 3 ind 2 1 (mod 10). 3 ind 2 x 0 (mod 10). According to Theorem 2.4 (3, 10) = 1. We have unique solution, since ind 2 x 0 (mod 10). So there is one incongruent solution x 1 (mod 11) of the equation. 4 Solution of Equations Modulo Composite Number 4.1 Solution of Equation x m 1 (mod p k ) Let m, k be positive integers and p a prime number, x m 1 (mod p k ). (4.1) Theorem 4.1. When p is an odd prime then either r or r + p is the primitive root modulo p 2. Where r is a primitive root. 10
11 Theorem 4.2. Let p be an odd prime. Then p k has a primitive root for all positive integers k. Moreover if r is a primitive root modulo p 2. Then r is a primitive root modulo p k for all integers k. Example 4.1. Let m = 5, p = 7 and k = 2. Then equation (4.1) become. x 5 1 (mod 7 2 ), x 5 1 (mod 49). By Theorem 4.2 r p 1 = (mod 49). It follows that ord 49 3 = 42, hence 3 is also primitive root of p 2 = 49. Taking index on both sides of congruence to base 3 modulo 49. We obtain congruence modulo φ(49) = 42, By Theorem 2.3 ind 3 1 = 0. Then, ind 3 x 5 ind 3 1 (mod 42). 5 ind 3 x 0 (mod 42). According to the Theorem 2.4, (5, 42) = 1. We get unique solution, ind 3 x 0 (mod 42), so there is one solution of the equation which is x 1 (mod 7 2 ). Theorem 4.3. Let m and k are positive integers and p be a prime. Then the number of incongruent solutions of the congruence x m 1 (mod p k ) is (m, φ(p k )). 4.2 Solution of Equation x m 1 (mod 2 k ) Suppose m and k are positive integers, x m 1 (mod 2 k ). (4.2) Theorem 4.4. (i) Every odd integer x satisfies this congruence x 2β 2 1 (mod 2 3 ), (4.3) where β 3. (ii) 5 has order 2 β 2 of equation (4.3), when β 3. (iii) The numbers ±5, ±5 2, ±5 3,..., ±5 2β 2 form a reduced residue system modulo 2 β, where β 3. 11
12 Theorem 4.5. Consider the congruence, x q a (mod 2 α ). (4.4) Where a, m be an odd prime and q = 2m. The exponent α 3. Then the equation (4.4) has four incongruent solutions if a 1 (mod 8) otherwise it has no solution. Proof. If α 3, we use theorem (4.4) and get following equations, a ( 1) h 5 k (mod 2 α ). (4.5) x ( 1) µ 5 y (mod 2 α ). (4.6) Where h, k, µ and y are integers 0. We have given q = 2m, m is odd and α 3. Then by using (4.4),(4.5) and (4.6) we get, 5 2my ( 1) h 5 k (mod 2 α ). Hence k is even, thus a 1 (mod 4). So 2my k (mod 2 α 2 ). That means k 0 (mod 2) and a 1 (mod 8). When this condition is fulfilled, then we get two incongruent solutions y modulo 2 α 2. Finally four incongruent solutions x modulo 2 α. Definition 4.1. Universal exponent U of the positive integer n such that a U 1 (mod n), where (a, n) = 1. Example 4.2. Let m = 2 and k = 3, then equation (4.2) become, x 2 1 (mod 8). (4.7) Every element of U 8 has unique expression of the form ±5 i. If x = ±5 i then, If x = 5 i, then from equation (4.7), (mod 8), so (mod 8) and (mod 8). x ±5 i (mod 8). (4.8) (5 i ) 2 1 (mod 8), 5 2i 1 (mod 8), 5 2i 5 2 (mod 8). Where φ(8) 2 = 2, because it is the order of 2 β 2. Then, 2i 2 (mod 2), 12
13 i 0, 1 (mod 2). If x = 5 i, then from equation (4.7), ( 5 i ) 2 1 (mod 8), 5 2i 1 (mod 8), 5 2i 5 2 (mod 8). Then, 2i 2 (mod 2), i 0, 1 (mod 2). From equation (4.8), x 5 i (mod 8). Put the values of i = 0, 1 then we get, x 1, 5 (mod 8). Again from equation (4.8), x 5 i (mod 8). Put the values of i = 0, 1 then we get, x 3, 7 (mod 8). So final solutions are x 1, 3, 5, 7 (mod 8). Example 4.3. Let m = 2 and k = 4, then equation (4.2) become, x 2 1 (mod 16). (4.9) Every element of U 16 has unique expression of the form ±5i, (mod 16), so, (mod 16) and (mod 16). If x = ±5 i then, x ±5 i (mod 16). (4.10) If x = 5 i, then from equation (4.9), (5 i ) 2 1 (mod 16), 5 2i 1 (mod 16), 5 2i 5 0 (mod 16). 13
14 Where φ(16) 2 = 4, because it is the order of 2 β 2. Then, If x = 5 i, then from equation (4.9), Then, From equation (4.10), Put the values of i = 0, 2 then we get, Again from equation (4.10), Put the values of i = 0, 2 then we get, 2i 0 (mod 4), i 0, 2 (mod 4). ( 5 i ) 2 1 (mod 16), 5 2i 1 (mod 16), 5 2i 5 0 (mod 16). 2i 0 (mod 4), i 0, 2 (mod 4). x 5 i (mod 16). x 1, 9 (mod 16). x 5 i (mod 16). x 7, 15 (mod 16). So we get final solutions x 1, 7, 9, 15 (mod 2 4 ). 4.3 Solution of Equation x m 1 (mod p q) Let m is a positive integer and q, p be the distinct prime numbers, x m 1 (mod p.q). (4.11) Example 4.4. Let m = 2,p = 3 and q = 5. Where p and q are distinct prime numbers. Then equation (4.11) become, x 2 1 (mod 15), x 2 1 (mod 3 5). We can write above equation into two equations. Then, x 2 1 (mod 3). (4.12) 14
15 a 1 2 ind 2 a 0 1 Table 4: Indices to the Base 2 Modulo 3 x 2 1 (mod 5). (4.13) First we solve equation(4.12). We find that 2 is the least positive primitive root of 3 (2 2 1 (mod 3)). Now, x 2 1 (mod 3). Taking index on both sides of congruence to base 2 modulo 3. We obtain a congruence modulo φ(3) = 2, By Theorem 2.3 ind 2 1 = 0. So, ind 2 x 2 ind 2 1 (mod 2). 2 ind 2 x 0 (mod 2). According to Theorem 2.4 (2, φ(3)) = 2, ind 2 x 0, 1 (mod 2), x 1, 2 (mod 3). Now we solve equation (4.13). We find that 2 is the least positive primitive root of 5(2 4 1 (mod 5)). Then, a ind 2 a Table 5: Indices to the Base 2 Modulo 5 x 2 1 (mod 5). Taking index on both sides of congruence to base 2 modulo 5. We obtain a congruence modulo φ(5) = 4, By Theorem 2.3 ind 2 1 = 0. So, ind 2 x 2 ind 2 1 (mod 4). 2 ind 2 x 0 (mod 4). According to Theorem 2.4 (2, φ(5)) = 2, ind 2 x 0, 2 (mod 4), x 1, 4 (mod 5). 15
16 By solving equations (4.12) and (4.13). We get following equations, x 1 (mod 3) (4.14) x 2 (mod 3) (4.15) x 1 (mod 5) (4.16) x 4 (mod 5) (4.17) Now we apply Theorem 2.1 on equation (4.14),(4.15),(4.16) and (4.17) to find the required result. x 1 (mod 3), x = 1 + 3k. (4.18) Put the value of x = 1 + 3k in equation (4.16). Then we get, 1 + 3k 1 (mod 5), 1 + 3k = 1 + 5l, 3k = 5l, k = 5. Put the value of k = 5 in equation (4.18), x = l, x 1 (mod 15). Put the value of x = 1 + 3k from equation (4.18) in equation (4.17), 1 + 3k 4 (mod 5), 3k 3 (mod 5), k 1 (mod 5), k = 1 + 5l 1. Now put the value of k = 1 + 5l 1 in equation (4.18), Now use equation (4.15), x = 1 + 3(1 + 5l 1 ), x = l 1, x = 4 (mod 15). x 2 (mod 3), x = 2 + 3k 1. (4.19) Put the value of x = 2 + 3k 1 from (4.19) in equation (4.16), 2 + 3k 1 1 (mod 5), 3k 1 1 (mod 5), k 1 3 (mod 5), k 1 = 3 + 5l 2. 16
17 Put the value of k 1 = 3 + 5l 2 in equation (4.19), x = 2 + 3(3 + 5l 2 ), x = l 2, x 11 (mod 15). Put the value of x = 2 + 3k 1 from equation (4.19) in equation (4.17), 2 + 3k 1 4 (mod 5), 3k 1 2 (mod 5), k 1 4 (mod 5), k 1 = 4 + 5l 3. Put the value of k 1 = 4 + 5l 3 in equation (4.19). Then we get, Now we get the required result, x = 2 + 3(4 + 5l 3 ), x = l 3, x 14 (mod 15). x 1, 4, 11, 14 (mod 15). Theorem 4.6. Suppose m be a positive integer and n = p 1 p 2 p k. Then equation x m 1 (mod pq) has (m 1, φ(p 1 ))(m 2, φ(p 2 )) (m k, φ(p k )) number of solutions. 4.4 Solution of Equation x m 1 (mod p k q k ) Let m, k are positive integers and q, p be the distinct prime numbers, x m 1 (mod p k q k ). (4.20) Example 4.5. Let m = 2, p = 3, q = 5 and k = 2. Then equation (4.20) become, x 2 1 (mod ). We can write above equation into two equations. Then, x 2 1 (mod 9). (4.21) x 2 1 (mod 25). (4.22) First we solve equation(4.21). We find that 2 is the least positive primitive root of 3 (2 2 1 (mod 3)). So by Theorem 4.2 it is also primitive root of 9. Taking index on both sides of congruence to base 2 modulo 9 of equation(4.21). We obtain congruence modulo φ(9) = 6, ind 2 x 2 ind 2 1 (mod 6). 17
18 a ind 2 a Table 6: Indices to the Base 2 Modulo 9 By Theorem 2.3 ind 2 1 = 0. So, 2 ind 2 x 0 (mod 6). According to Theorem 2.4 (2, φ(7)) = 2. Then, ind 2 x 0, 3 (mod 6), x 1, 8 (mod 9). Now we solve the equation(4.22). We find that 2 is the least positive primitive root of 5. So by Theorem 4.2 it is also primitive root of 25. a ind 2 a a ind 2 a Table 7: Indices to the Base 2 Modulo 25 Taking index on both sides of congruence to base 2 modulo 25 of equation (4.22). We obtain congruence modulo φ(25) = 20, By Theorem 2.3 ind 2 1 = 0. So, ind 2 x 2 ind 2 1 (mod 20). 2 ind 2 x 0 (mod 20). According to Theorem 2.4 (2, φ(25)) = 2, ind 2 x 0, 10 (mod 20), x 1, 24 (mod 25). By solving equations (4.21) and (4.22), we get following equations, x 1 (mod 9). (4.23) x 8 (mod 9). (4.24) x 1 (mod 25). (4.25) 18
19 x 24 (mod 25). (4.26) Now we apply Theorem 2.1 on equation (4.23),(4.24),(4.25) and (4.26) to find the required result. First we use equation (4.23), x 1 (mod 9), x = 1 + 9k. (4.27) Put the value of x = 1 + 9k in equation (4.25). Then we get, 1 + 9k 1 (mod 25), 1 + 9k = l, 9k = 25l, k = 25l. Put the value of k = 25l in equation (4.27), x = l, x 1 (mod ). Put the value of x = 1 + 9k from equation (4.27) in equation (4.26), 1 + 9k 24 (mod 25), 9k 23 (mod 25), k 22 (mod 25), k = l 1. Now put the value of k = l 1 in equation (4.27), Now use equation (4.24), x = ( l 1 ), x = l 1, x = 199 (mod ). x 8 (mod 9), x = 8 + 9k 1. (4.28) Put the value of x = 8 + 9k 1 from (4.28) in equation (4.25), 8 + 9k 1 1 (mod 25), 9k 1 7 (mod 25), k 1 2 (mod 25), k 1 = l 2. 19
20 Put the value of k 1 = l 2 in equation (4.28), x = 8 + 9(2 + 25l 2 ), x = l 2, x 26 (mod ). Put the value of x = 8 + 9k 1 from equation (4.28) in equation (4.26), 8 + 9k 1 24 (mod 25), 9k 1 16 (mod 25), k 1 24 (mod 25), k 1 = l 3. Put the value of k 1 = l 3 in equation (4.28). Then we get, Now we get the required result, x = 8 + 9( l 3 ), x = l 3, x 224 (mod ). x 1, 26, 199, 224 (mod ). Theorem 4.7. Let m be a positive integer and n = p 1 l1 p 2 l2 p k l k. Then equation x m 1 (mod n) has (m 1, φ(p 1 l 1 ))(m 2, φ(p 2 l 2 )) (m k, φ(p k l k )) number of solutions. 5 Number of r Periodic Points to Monomial Dynamical System In this section, we will discuss about number of cycles to monomial dynamical system x x m (mod q), where q = p k and p is prime. We have derived a formula for r periodic points. The basic material for this section has been taken from [4] and [5]. Definition 5.1. Let r be a positive integer. The set γ = {x o, x 1... x r 1 } of periodic points of period r is said to be a cycle of f is x o = f(x r 1 ) and x j = f(x j 1 ) for 1 j r 1. The length of the cycle is the number of elements in γ. Definition 5.2. Let x r = f r (x o ). If x r = x o for some positive integer r, then x o is said to be a periodic point of f. If r is the least natural number with this property, then we call r the period of x o and x o an r-periodic point. A periodic point of period 1 is called a fixed point of f. 20
21 Definition 5.3. Let q = p k, where k Z +. Denote q (m) by the number which is the largest divisor of φ(q) and relatively prime to m. Möbius Inversion Formula: Suppose F and f be an arithmetic functions defined for each n Z +. Then, F (n) = d n f(d), if and only if, f(n) = d n µ(d)f (n d). See for more details [4]. Theorem 5.1. If q = p k, where p > 2 and k Z + then the number r-periodic points of dynamical system f(x) = x m is P r (x m, q) = ( ) µ(d) m r/d 1, φ(q), d r and the number of cycles of the length r of f(x) = x m is C r (x m, q) = P r(x m, q) r = 1 µ(d) r d r ( m r/d 1, φ(q) Proof. Suppose f(x) = x m (mod q) monomial dynamical system has r-periodic points. Then, x mr x (mod q), x mr x 0 x(x mr 1 1) 0 (mod q), (mod q). This above equation has (m r 1, φ(q)) solutions, they are d-periodic points for some d r. So (m r 1, φ(q)) = d r P d(x m, q). Now we follow Möbius inversion formula, P r (x m, q) = ( ) µ(d) m r/d 1, φ(q). d r ). Example 5.1. How to calculate the number of cycle for f(x) = x 2 (mod 5 2 ). We know, C r (x m, q) = 1 ( ) µ(d) m r/d 1, φ(q). r Assume r = 4, C 4 (x 2, q) = 1 { } µ(1)(2 4/1 1, 20) + µ(2)(2 4/2 1, 20), 4 C 4 (x 2, q) = 1. d r 21
22 f(x) = x 2 (mod 5 2 ) has one cycle of length 4 and two fixed points, which we can see by Figure 1. x f(x) = x x f(x) = x Table 8: f(x) = x 2 (mod 5 2 ) Figure 1: f(x) = x 2 (mod 5 2 ) 22
23 Example 5.2. How to calculate the number of cycle (of length r). Let us consider a monomial dynamical system f(x) = x 2 (mod 11). We know the formula, C r (x m, q) = 1 ( ) µ(d) m r/d 1, φ(q). r Suppose r = 4, d r C 4 (x 2, q) = 1 { } µ(1)(2 4/1 1, 10) + µ(2)(2 4/2 1, 10), 4 C 4 (x 2, q) = 1. Infact the monomial dynamical system f(x) = x 2 has one cycle of length 4 and two fixed points, we can also see from Figure 2. x f(x) = x Table 9: f(x) = x 2 (mod 11) Figure 2: f(x) = x 2 (mod 11) 23
24 Example 5.3. Second way to find the periodic points of f(x) = x 2 (mod 11) by using x o = x mr o. If x o is an r periodic point of f(x) = x m then x o = f r (x o ). x mr x mr o = x o, o x o = 0, { } x o x mr 1 o 1 = 0, { } x o x 24 1 o 1 = 0, x o { x 15 o 1 } = 0. x 0 (mod 11). (5.1) x 15 1 (mod 11). (5.2) By using the index calculus method we find the following solution. Hence the final solutions are, x 1, 3, 4, 5, 9 (mod 11). x 0, 1, 3, 4, 5, 9 (mod 11). 6 Number of Total Periodic Points to Monomial Dynamical System In this section, we will discuss formula for total number of periodic points for monomial dynamical system. We state some theorems and example to understand it. The material for this section has been taken from [1],[4],[5] and [6]. Definition 6.1. The r(m) is the order of least integer such that m r(m) 1 (mod q (m)) and r(m) φ(q (m)) Theorem 6.1. Let p > 2 be a fixed prime number and m 2 be a natural number. If R r(m). Then, For more detail see [4] R P r (x m, p) = p (m) + 1. r=1 Lemma 6.2. Iff (m r 1) (m g 1) then r g. Proof. If r g then we have to prove (m r 1) (m g 1). Here r g, there q Z such that g = rq. Now m g 1 = (m r ) q 1 = (m r 1)(m r(q 1) +m r(q 2) +m r +1), so (m r 1) (m g 1). Conversely, (m r 1) (m g 1) then we have to prove r g. Here (m r 1) (m g 1), then m g 1 = s(m r 1), where s is an integer. It follows m g
25 (mod m r 1). By division algorithm g = qr + c, where 0 c < r. Now m qr+c 1 0 (mod m r 1). Then (m r ) q m c 1 0 (mod m r 1) where (m r ) q 1 (mod m r 1). So m c 1 0 (mod m r 1) therefore (m r 1) (m c 1). Since c < r so c = 0, when m c 1 < m r 1. Hence g = q r and r g. Lemma 6.3. Let q = p k for some prime p > 2. Then for each r N, (m r 1, φ(q)) = (m r 1, q (m)). Proof. We know m r 1 1 (mod v 1 ), where v 1 m. Then we can remove the prime factors from φ(q), which divides m. Because they would not change the value of (m r 1, φ(q)). Lemma 6.4. We have (m r 1, q (m)) = q (m)). Proof. Since (m, q (m)) = 1, then from Euler theorem we have m φ(q (m)) 1 (mod q (m)). There exist a smallest r(m) integer such that m r(m) 1 (mod q (m)) and r(m) φ(q (m)). Infact r(m) φ(q (m)). Theorem 6.5. Let q = p k be a prime and m 2 be a natural number. If r r(m). Then, R P r (x m, q) = P r (x m, q) = q (m) + 1. r=1 r r(m) Proof. We are finding the r periodic points of the monomial dynamical system by using the equation, First we solve, x(x mr 1 1) 0 x mr x (mod q), (mod q). x mr 1 1 (mod q). (6.1) The equation (6.1) has (m r 1, q (m)) solutions from Lemma 6.3 Let u be a primitive root of q = p k. For all x that are relatively prime to q, x = u i where i {0, 1, φ(q)}. Now use x = u i in equation (6.1). Then it becomes, u i(mr 1) 1 0 (mod q), this is equivalent to i(m r 1) 0 (mod φ(q)). There are (m r 1, φ(q)) solutions to the above equation. From Lemma 6.3 it is (m r 1, q (m)) solutions. There are q (m) possible values of i. When r = r from Lemma 6.4 we have exactly q (m) solutions. The solutions are among the elements u l1, u l2 u l q (m). All the solutions we get 25
26 from x mr 1 1 (mod q) are either r periodic points or r periodic points for some r r. Assume r > r and a be an r periodic point. Then a mr 1 1 (mod q). But a must belong to set of solutions of x m r 1 1 (mod q (m)), which is impossible because r > r. If r r then r r. So, if r r then there are no periodic points. Here x 0, if p x, then p x mr 1 1. So we have q (m)+1 periodic points. Theorem 6.6. If w = p k and v = q l are relatively prime numbers. Then, P (x m, wv) = P (x m, w)p (x m, v), = (1 + w (m))(1 + v (m)). Where w (m),v (m) are the largest divisors of φ(w) and φ(v) respectively and both relatively prime to m. Proof. Let w and v are relatively prime. Now we suppose a dynamical system f(x) = x m (mod n), where n is composite number with n = wv. We have to prove P (x m, wv) = P (x m, w)p (x m, v). Here P (x m, wv) are the periodic points of f(x) = x m (mod n). But P (x m, w), P (x m, v) are the periodic points of f(x) = x m (mod w), and f(x) = x m (mod v) respectively. We consider f(x) = x m (mod w). If x is an r periodic points of f(x) = x m (mod w) then x(x m r 1 1) 0 (mod w). By solving x a 1, a 2, a 3 a k1 (mod w) = R 1 (total number of periodic points for w). Again, for f(x) = x m (mod v), we get x b 1, b 2, b 3 b k2 (mod v) = R 2 (total number of periodic points for v). Now using Theorem 2.1 on R 1 and R 2 and we get x c 1, c 2, c 3 c k3 (mod wv) = R 3 (total number of periodic points for wv) then R 3 = R 1 R 2. But, for f(x) = x m (mod n), we obtain x c 1, c 2, c 3 c k3 (mod n) = R 3 (total number of periodic points for n). So we can write R 3 = R 1 R 2. Then, By using Theorem 6.5 we get, P (x m, wv) = P (x m, w)p (x m, v). P (x m, wv) = (1 + w (m))(1 + v (m)). Example 6.1. Find the r-periodic point of a monomial dynamical system f(x) = x 3 (mod 15). f(x) = x 3 (mod 3 5). Now we split it into two parts, f(x) = x 3 (mod 3). (6.2) f(x) = x 3 (mod 5). (6.3) First solve equation (6.2). According to definition 5.3 f(x) = x 3 (mod 3) has w (3) = 2 periodic points and by this (mod 2), we get r = 1. 26
27 Now we solve (6.3), by the definition 5.3 f(x) = x 3 (mod 5) has v (3) = 4 periodic points and by (mod 4), r = 2. We use formula to find the r-periodic points for dynamical system f(x) = x 3 (mod 15). P (x 3, 3 5) = P (x 3, 3) P (x 3, 5), P (x 3, 3 5) = (1 + w (3))(1 + v (5)). Put the values of w (3) = 2 and v (3) = 4, P (x 3, 3 5) = (1 + 2))(1 + 4), P (x 3, 3 5) = 15. Hence monomial dynamical system f(x) = x 3 (mod 15) has 15 periodic points. Example 6.2. Second way to find the r-periodic points of f(x) = x 3 (mod 15). x f(x) = x Table 10: f(x) = x 3 (mod 5) Where φ(15) = 8, p (3) = 8 and by (mod 8), we get r = 2. If x is an r periodic point of f(x) = x 3 (mod 15). Then, Now, x(x ) = 0 (mod 15), x(x 8 1) = 0 (mod 3 5). x 0 (mod 3). (6.4) x 8 1 (mod 5). (6.5) x 0 (mod 5). (6.6) x 8 1 (mod 3). (6.7) After solving the equation (6.5) by index calculus method, we get following solutions x 1, 2, 3, 4 (mod 5). Now solve the equation (6.7) by index calculus method and we get following solutions x 1, 2 (mod 3). So we find the solutions, x 0, 1, 2 (mod 3). (6.8) x 0, 1, 2, 3, 4 (mod 5). (6.9) Applying Theorem 2.1 on equation (6.8), (6.9) and we get the final solutions, We can also see by Figure 3. x 0, 1, 2..., 14 (mod 15). 27
28 Figure 3: f(x) = x 3 (mod 15) Example 6.3. Find the periodic point of dynamical system f(x) = x 2 (mod ). Now we split this equation into two parts, f(x) = x 2 (mod 2 2 ). f(x) = x 2 (mod 3 2 ). First we solve equation f(x) = x 2 (mod 2 2 ). By definition 5.3 f(x) = x 2 (mod 2 2 ) has w (2) = 1 periodic points and r = 1 by (mod 1). Now we solve the equation f(x) = x 2 (mod 3 2 ). According to definition (5.3) f(x) = x 2 (mod 3 2 ) has v (2) = 3 periodic points and r = 2 by (mod 3). We use formula to find the r-periodic points for dynamical system f(x) = x 2 (mod ). P (x 2, ) = P (x 2, 2 2 ) P (x 2, 3 2 ), P (x 2, ) = (1 + w (2))(1 + v (2)). Put the values of w (2) = 1 and v (2) = 3 in above formula, P (x 2, ) = (1 + 1))(1 + 3), P (x 2, ) = 8. So monomial dynamical system f(x) = x 2 (mod ) has 8 periodic points, which we can see from Figure 4. 28
29 x f(x) = x x f(x) = x x f(x) = x Table 11: f(x) = x 2 (mod ) References Figure 4: f(x) = x 2 (mod ) [1] Kenneth H. Rosen,Elementary Numbers Theory and Its Application,5th edition,greg Tobin,Boston Sun Francisco New York in year [2] T.Nagell,Introduction To Numbers Theory Almqvist and Wiksells Boktryckeri AB,Uppsala in year [3] Gareth A. Jones and J. Mary Jones, Elementary Number Theory, Printed in Great Britain, Spriner-Verlag London Limited [4] Marcus Nilsson, Monomial Dynamical Systems in the Field of p adic Numbers and Their Finite Extensions, Printed by: Intellecta Docusys, Gőteborg [5] Andrei Yu. Khrennikov and Marcus Nilsson, P-adic Deterministic and Random Dynamics Published by Kluwer Academic Publisher, P.O.Box 17, 3300 AA Dordrecht, The Netherlands
30 [6] Min Sha and Su Hu,15 August 2011, [7] W.Diffe and M.E.Heilman,New Direction in Cryptography, IEEE Trans.Info, Theory,IT-22, [8] A. Yu. Khrennikov, Non-archimedean analysis: Quantum paradoxes, dynamical systems and bilogical models, Kluwer, Dordrecht, 1997.
31 SE Växjö / SE Kalmar Tel dfm@lnu.se Lnu.se 31
SOLUTIONS 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 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 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 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 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 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 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 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 informationSolutions 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 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 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 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 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 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 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 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 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 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 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005
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
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 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 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 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 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 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 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 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 informationEE 418: Network Security and Cryptography
EE 418: Network Security and Cryptography Homework 3 Solutions Assigned: Wednesday, November 2, 2016, Due: Thursday, November 10, 2016 Instructor: Tamara Bonaci Department of Electrical Engineering University
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 and Public Key Cryptography Kathryn Sommers
Page!1 Math 409H Fall 2016 Texas A&M University Professor: David Larson Introduction Number Theory and Public Key Cryptography Kathryn Sommers Number theory is a very broad and encompassing subject. At
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 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 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 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 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 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 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 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 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 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 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 informationby Michael Filaseta University of South Carolina
by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every
More informationL29&30 - RSA Cryptography
L29&30 - RSA Cryptography CSci/Math 2112 20&22 July 2015 1 / 13 Notation We write a mod n for the integer b such that 0 b < n and a b (mod n). 2 / 13 Calculating Large Powers Modulo n Example 1 What is
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 informationNumber Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory
- Divisibility - Congruences June 23, 2014 Primes - Divisibility - Congruences Definition A positive integer p is prime if p 2 and its only positive factors are itself and 1. Otherwise, if p 2, then p
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 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 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 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 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 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 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 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 informationDiscrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography
Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete
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 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 informationDiffie-Hellman key-exchange protocol
Diffie-Hellman key-exchange protocol This protocol allows two users to choose a common secret key, for DES or AES, say, while communicating over an insecure channel (with eavesdroppers). The two users
More informationDistribution of Primes
Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we
More informationLECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI
LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining
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 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 informationON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey
ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem
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 informationORDER AND CHAOS. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
ORDER AND CHAOS Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
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 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 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 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 informationCryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017
Name: Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name legibly at the top of this page. No calculators
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 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 informationLinear Congruences. The solutions to a linear congruence ax b (mod m) are all integers x that satisfy the congruence.
Section 4.4 Linear Congruences Definition: A congruence of the form ax b (mod m), where m is a positive integer, a and b are integers, and x is a variable, is called a linear congruence. The solutions
More informationCongruence properties of the binary partition function
Congruence properties of the binary partition function 1. Introduction. We denote by b(n) the number of binary partitions of n, that is the number of partitions of n as the sum of powers of 2. As usual,
More informationArithmetic of Remainders (Congruences)
Arithmetic of Remainders (Congruences) Donald Rideout, Memorial University of Newfoundland 1 Divisibility is a fundamental concept of number theory and is one of the concepts that sets it apart from other
More informationCongruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.4.3 Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah
More informationThe covering congruences of Paul Erdős. Carl Pomerance Dartmouth College
The covering congruences of Paul Erdős Carl Pomerance Dartmouth College Conjecture (Erdős, 1950): For each number B, one can cover Z with finitely many congruences to distinct moduli all > B. Erdős (1995):
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 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 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 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 informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the
More informationON SPLITTING UP PILES OF STONES
ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first
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 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 informationCryptography CS 555. Topic 20: Other Public Key Encryption Schemes. CS555 Topic 20 1
Cryptography CS 555 Topic 20: Other Public Key Encryption Schemes Topic 20 1 Outline and Readings Outline Quadratic Residue Rabin encryption Goldwasser-Micali Commutative encryption Homomorphic encryption
More informationEE 418 Network Security and Cryptography Lecture #3
EE 418 Network Security and Cryptography Lecture #3 October 6, 2016 Classical cryptosystems. Lecture notes prepared by Professor Radha Poovendran. Tamara Bonaci Department of Electrical Engineering University
More informationPublic-Key Cryptosystem Based on Composite Degree Residuosity Classes. Paillier Cryptosystem. Harmeet Singh
Public-Key Cryptosystem Based on Composite Degree Residuosity Classes aka Paillier Cryptosystem Harmeet Singh Harmeet Singh Winter 2018 1 / 26 Background s Background Foundation of public-key encryption
More informationChapter 4 Cyclotomic Cosets, the Mattson Solomon Polynomial, Idempotents and Cyclic Codes
Chapter 4 Cyclotomic Cosets, the Mattson Solomon Polynomial, Idempotents and Cyclic Codes 4.1 Introduction Much of the pioneering research on cyclic codes was carried out by Prange [5]inthe 1950s and considerably
More informationMAT 302: ALGEBRAIC CRYPTOGRAPHY. Department of Mathematical and Computational Sciences University of Toronto, Mississauga.
MAT 302: ALGEBRAIC CRYPTOGRAPHY Department of Mathematical and Computational Sciences University of Toronto, Mississauga February 27, 2013 Mid-term Exam INSTRUCTIONS: The duration of the exam is 100 minutes.
More informationMA/CSSE 473 Day 9. The algorithm (modified) N 1
MA/CSSE 473 Day 9 Primality Testing Encryption Intro The algorithm (modified) To test N for primality Pick positive integers a 1, a 2,, a k < N at random For each a i, check for a N 1 i 1 (mod N) Use the
More informationThe number theory behind cryptography
The University of Vermont May 16, 2017 What is cryptography? Cryptography is the practice and study of techniques for secure communication in the presence of adverse third parties. What is cryptography?
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 informationSelf-Inverse Interleavers for Turbo Codes
Department of Mathematics and Computer Science Amirkabir University of Technology amin@math.carleton.ca [Joint work with D. Panario, M. R. Sadeghi and N. Eshghi] Finite Fields Workshop, July 2010 Turbo
More informationRamanujan-type Congruences for Overpartitions Modulo 5. Nankai University, Tianjin , P. R. China
Ramanujan-type Congruences for Overpartitions Modulo 5 William Y.C. Chen a,b, Lisa H. Sun a,, Rong-Hua Wang a and Li Zhang a a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
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 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 informationA4M33PAL, ZS , FEL ČVUT
Pseudorandom numbers John von Neumann: Any one who considers arithmetical methods of producing random digits is, of course, in a state of sin. For, as has been pointed out several times, there is no such
More informationArithmetic Properties of Combinatorial Quantities
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; August 4, 2010 Arithmetic Properties of Combinatorial Quantities Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China
More information