Some Own Problems In Number Theory

Size: px
Start display at page:

Download "Some Own Problems In Number Theory"

Transcription

1 Some Own Problems In Number Theory Mathmdmb April 16, 2011 Here are some problems proposed by me, and the problems or their solutions have not been approved by someone else. So if any fault occurs, I shall take the whole responsibility. In this case, please inform me. Among the problems,many were posted by me on AoPS fora, so I thank the users who posted replies and solutions there. A notable fact is that I put the problems not in order to difficulty, just randomly - which is, in my opinion, more interesting. 1 Notations N = {1, 2, 3,..., n,...} : the set of positive integers. Z = {1, 2, 3,..., n,...} : the set of integers. N 0 = {0, 1, 2,...} : the set of nonnegative integers. a A : a is an element of the set A. a b : b is divisible by a. a b : b is not divisible by a. a b c : b and c are both divisible by a. gcd(a, b) : the Greatest Common Divisor of a and b. a and b are coprime : gcd(a, b) = 1. ϕ(m) : the number of positive integers x, not exceeding m with the property gcd(x, m) = 1. n i=1 a i = a 1 a 2...a n. x : the largest integer not exceeding x. x : for all x. a is squarefree : there does not exist x N such that x 2 a. a N is a perfect number : sum of positive divisors of a is 2a. 1

2 ord m (a) = x : x is the order of a modulo m. v p (x) = α : α is the greatest positive integer such that p α x W 5 : Which is What We Wanted. W LOG : Without Loss Of Generality. 2

3 2 Problems 1. Prove that there does not exist a pair(n, m) N so that n+3m and n 2 +3m 2 are both perfect cubes. Find all such pairs if (m, n) Z. 2. Find all primes p such that the number 11 p + 10 p is a perfect power of a positive integer. 3. Let F n = 2 2n + 1 be the n th Fermat number. Prove that 2 2m +2 n F Fm 1 n 1, m, n N. 4. Let a > 2 be an integer. Show that a a a is never square-free. 5. Show that there are infinitely many pairs of positive integers (a, b) such that if the number a5 +b 5 a 3 b 3 +1 is an integer, then it is a perfect 5th power. 6. Let p 2 (mod 3) be a prime number. Show that there exists a complete set of residue class of p such that the sum of its elements is divisible by p Prove that n n for all n N Find all positive integers n such that n 2 n! Let p be a prime. Determine all perfect numbers having p factors. 10. Prove that a number which has only one prime factor, can t be a perfect number. 11. Solve in positive integers the equation 12. Find all n N such that a 7 + b 7 = (ac) n 2 27n is a perfect square. 2. n 2 27n is a perfect square 13. Find all (a, b) N 0 such that the number 7 a + 11 b is a perfect square. 14. Consider a complete set of residues modulo p. Show that we can partition this set into two subsets with equal number of elements such that the sum of elements in each set is divisible by p. 15. Let a i, m, and n be positive integers such that a i + m is a prime for all 1 i n. Let N = n i=1 pai i and let S be the number of ways of expressing N as a product of m positive integers. Prove that m n S. 16. Find all integers (a, b, c, d) such that abc d = 1, bcd a = 2 3

4 17. Find all positive integer values that x2 +y 2 +1 xy+1 can take where x and y positive integers. 18. Solve in positive integers : 19. Find all n such that ϕ(n) N. n n n 10 8 =

5 3 Solutions 1. If n + 3m, n 2 + 3m 2 both are cubes,then their product too. Then (n + 3m)(n 2 + 3m 2 ) = a 3 = n 3 + 3m 2 n + 3mn 2 + 9m 3 = a 3 = (m + n) 3 + (2m) 3 = a 3 By Fermat s Last Theorem, the last equation has no solution. If (m, n) Z, then we have two cases: 1. m+n = 0 Then we get n+3m = 2m is a perfect cube which gives m = 2x 3. Also n 2 + 3m 2 = 4m 2 From this we conclude that m = 4t 3, n = 4t m = 0 or m = 0 In this case, n + m = n = u 3 and n 2 + 3m 2 = n 2 = (u 2 ) 3 Thus, (m, n) = (4t 3, 4t 3 ), (0, u 3 ) are only solutions. 2. First Solution : First look at p = 2,which is not a solution. Now p odd, so 11 p + 10 p is divisible by = 21.So 3, 7 11 p + 10 p According to the Lifting The Exponent Lemma(LTE), we get that p + 10 p or p + 10 p if p = 3 or p = 7.Checking, we easily get p 3, 7. So, it can t be a perfect power. Second Solution : Again p 2.So 11 p + 10 p 0 (mod 9) The latter implies 2 p 1 (mod 9), since 2 6n+3 1 (mod 9) it follows that 3 p, p = 3. But, = = 2331 is not a perfect power. Third Solution : First check with p = 2, 3 manually which don t work. So let p 5. We know that every prime greater than 3 is of the form 6k ± 1. So, two cases: 1. p = 6k + 1,then 11 p + 10 p 2 p + 1 (2 6 ) k (mod 9).But any integer of the form 9m + 3 = 3(3m + 1) is not a perfect power because 9 does not divide it. 2. p = 6k +5, then 2 p (mod 9) Since it is of the form 9m 3, a similar logic works here too. Therefore, no solution exists. 5

6 3. First Solution : From LTE, if v 2 ( a2 b 2 2 ) = α, v 2 (n) = β,then v 2 (a n b n ) = α + β Applying this,we get that,v 2 (Fm r 1) = v 2 (F m 1) + v 2 (r) Since v 2 (F m 1) = 2 m, v 2 (F n 1) = 2 n, now it follows that Then,2 2m +2 n F Fn 1 m 1 v 2 (F Fn 1 m 1) = 2 m + 2 n Second Solution : In this solution, we use the repeated use of the identity a 2 1 = (a + 1)(a 1). Then, a 2k 1 = (a 2k 1 + 1)(a 2k 1 ) = (a 2k 1 + 1)(a 2k 2 + 1)((a 2k 2 1) = (a 2k 1 + 1)(a 2k 2 + 1)...(a + 1)(a 1) This equation says that v 2 (a 2k 1) = v 2 (a 1) + v 2 (2 k ) = v 2 (a 1) + k. Applying the result,it easily follows that v 2 (Fm Fn 1 1) = v 2 (F m 1)+v 2 (2 2n ) = 2 m + 2 n. Note. Not only 2 2m +2 n Fm Fn 1 1, also 2 2m +2 n mostly divides Fm Fn 1 1. Also 2 2m +2 n Fn Fm a a a = a(a a 1 1) and we claim that a a 1 1 must have a square factor. Let s eliminate the trivial case a = 3 first, since then = 2 3 So a > 3.If a 1 has no odd prime factor, then a 1 must be a power of 2.Since a > 3, a and thus it has a square factor. Assume to the contrary that, a 1 has an odd prime factor, say p. Then from the LTE, we find that v p (a a 1 1) is at least 2, implying that p 2 a a 1 1, as desired. 5. This seems to be like the famous IMO-1988,6 which stated that if a2 +b 2 ab+1 is an integer, then it is a perfect square.but this is not that hard at all. See, we are asked to prove the existence of such an infinite couple,not to prove that,if a 5 +b 5 a 3 b 3 +1 is an integer,then it is a perfect 5th power. This suggests us to find a suitable parameter for a, b such that the condition satisfies. Let s recall the parameters of IMO-1988,6 where, we could find an infinite couples of a, b with a = c, b = c 3. Then, our intution says to choose a = b k The problem is reduced to find k such that b 5k = b 3k which gives k = 4. Indeed, a 5 + b 5 a 3 b = b5 Thus, (a, b) = (c 4, c), (c, c 4 ) gives such an infinite couple. W 5 6

7 6. First we prove the following fact. Lemma : If a 2 + ab + b 2 is divisible by p 2 mod 3, then p a, p b Proof : Let p = 3k + 2. So, a 2 + ab + b 2 0 mod p = a 3 b 3 (mod p) Now from Fermat s Little Theorem a p 1 b p 1 (mod p) It is well-known that if a m b m (mod p) and a n b n (mod p) then, a gcd(m,n) b gcd(m,n) (mod p) = a gcd(3,p 1) b gcd(3,p 1) (mod p) = a gcd(3,3k+1) b gcd(3,3k+1) (mod p) = a b (mod p) = p a b From this, we see that p a 2 2ab + b 2, a 2 + ab + b 2 and we can say p a 2 + ab + b 2 (a 2 2ab + b 2 ) = 3ab Since gcd(p, 3) = 1, p ab implying that p a, p b. Now back to the original problem. Let s consider the complete residue class 1, 2,..., p 1.Then according to the lemma, 1 3, 2 3,..., (p 1) 3 is also a complete residue class of p.if two of its elements were congruent modulo p. Let i 3 j 3 mod p = (i j)(i 2 +ij+j 2 ) 0 mod p. Because i j < p, gcd(i j, p) = 1 and so i 2 + ij + j 2 0 mod p which would imply p i, j which is clearly absurd. Hence, any two terms are incongruent modulo p and it forms a complete residue class. And the sum of them is p2 (p 1) 2 4, it is obviously divisible by p First Solution : We use induction on n. The base case n 0 = 0 is true since = 0 Let it be true for some n.then we require to prove that n+2 9n n+2 9n 19 = 10(10 n n) + 81(n + 1) This is now obviously divisible by 81. Second Solution : This is solution is more elegant than the previous one. Consider the sum, S = upto n th terms containing n 1 s. Let s try to find a closed formula for S. 9S = = = 10( ) n = 10( 10n 1 9 ) n So, S = 10n n 81. Since, S is a positive integer, 81 must divide 10 n n. 7

8 8. Firstly, n odd. Now, 2 ϕ(n) 1 (mod n) since gcd(n, 2) = 1. But, ϕ(n) < n, so n! must contain ϕ(n) as a factor since n! is the product of integers from 1 to n. Thus, ϕ(n) n!. 2 n! 1 mod n,so true for all n odd. 9. We claim that, if N has p factors, then N must be a perfect power of only one prime. This is because if N = p r 1p s 2 with p 1, p 2 distinct primes, then the number of divisors of N is (r + 1)(s + 1) can t be a prime unless r = 0 or s = 0. Because, otherwise the number of divisors of N = (r + 1)(s + 1) which is not a prime. So, our claim is true. If the sum of proper divisors is equal to N,say N = q p 1.Thus, 1 + q + q q p 2 = N = qp 1 1 q 1 But, it is not possible as qp 1 1 q 1 < q p 1. This proves the desired fact. = q p This problem is actually a special case of the previous one. Note. In fact, we can say more specifically that the sum of some divisors of a prime power or a number having a prime number of divisors. 11. This is an equation involving very high exponents. So, it can t have many solutions. In fact, we shall prove that it has no positive integer solution. First Solution : At first note that and the consequence is obvious,we need to search for Fermat s Last Theorem. So, we need to express as a perfect 7 th power. Let s try a bit. The given number is not divisible by 3 because the sum of its digits 29 is not divisible by 3.So see if it is divisible by the next prime 7. A number is divisible by 7 iff the number obtained by the subtraction of the three digit number formed by its last three digit and the number that is left. Example is divisible by 7.See that, = 399.Since,399 is divisible by 7,the original number is divisible by 7. Now, let s check whether is divisible by 7 or not = 280 which is divisible by 7. This leads us to factorize Note that = Again, = 532 = 7 76.Thus, = = = = 7 7 The initial equation becomes a 7 + b 7 = (7a 285 c 285 ) 7 having no solution in positive integers. 8

9 Second Solution : This is an easier and more elementary,elegant one. Again,since a 7 a 1995, a 7 b 7. Let b = ak. Th equation stands k = (7a 284 c 285)7 But, no two perfect 7 th powers don t differ by First Solution : We shall use two very useful fact in solving this problem. It is a widely known tactic. There is no positive integer between two consecutive positive integers. So there is no perfect square which lies between two consecutive perfect squares. The product of two consecutive integers is not a perfect square. 1. Just note that n 2 27n = (n 13)(n 14). Since n 13 and n 14 does not share any common factor,n 13 and n 14 both must be squares. But then the difference of two squares is 1,contradiction! 2. Again, n 2 27n = (n 13)(n 14) + 1. Let n 14 = m giving us m(m + 1)) + 1 = x 2 If m is a positive integer,. If m is a negative integer, m 2 < m 2 + m + 1 < m 2 + 2m + 1 = (m + 1) 2 m 2 > m 2 + m + 1 > m 2 + 2m + 1 Thus, n 2 27n+183 can t be a perfect square except 1 yielding n = 14, 13. Second Solution : This time we shall use discriminant of a quadratic equation. 1. Let, n 2 27n = z 2. Then, its discriminant is (182 z 2 ) = 4z is a perfect square. But (2z) is a square only for z = 0. Then n = 13, 14. 9

10 2. The discriminant of n 2 27n = z 2 is 729 4(183 z 2 ) = 4z 2 3. Let, 4z 2 3 = x 2 = (2z + x)(2z x) = 3 = 2z + x = 3, 2z x = 1 = z = x = 1 which gives us n = 13, Let 7 a + 11 b = x 2. Let s make several cases : Case 1 : a = 0, b > 0. Then, the equation is reduced to 11 b = (x + 1)(x 1) which means that 11 x + 1 x 1 = 11 2 Contradiction! Case 2 : b = 0, a > 0. This is similar to the preceeding one. Case 3 : a, b > 0. Then 7 a + 11 b must be even. So 7 a + 11 b 0 (mod 4). Take modulo 4 in the equation. So, x 2 0 (mod 4) = 7 a + 11 b 0 (mod 4) = ( 1) a + ( 1) b 0 (mod 4) From the latter,we may conclude that a and b are of different pairity. Otherwise x 2 2 (mod 4) which is not true. Again, take modulo 3. If y even, 7 a + 11 b 2 (mod 3) but no square gives remainder 2 upon division by 3. This makes b odd and a even. Let a = 2k. Thus, 11 b = (x + 7 k )(x 7 k ) = 11 x + 7 k x 7 k = k Contradiction! The only case left is b = 1 which does not produce any solution. Therefore, no such a, b exists. 14. Lemma : If p > 3 a prime, then 24 p 2 1. Proof : Since p > 3, obviously p odd and not divisible by 3. Thus p ±1 (mod 3) and p ±1 (mod 2). Combining theses two p ±1 (mod 6). Let, p = 6k ± 1 = p 2 = 36k 2 ± 12k + 1 = 12k(3k + 1) = p

11 k and 3k + 1 are of opposite pairity since their difference is not divisible by 2. So, one of them must be even and thus, 12 2 = 24 p 2 1. The complete residue class is {1, 2,..., p 1} Now, recall that there are exactly p 1 2 quadratic residues mod p. The sum of the residues is p(p 1) 2 which is divisible by p. So, we seek for only a set with p 1 2 elements, since then the sum of the elements of the other set will be divisible by p automatically. And consider the quadratic residues 1 2, 2 2,..., ( p 1 2 )2. Note that, their sum is Now, we are done if 24 p 2 1 W ( p 1 2 )2 = p(p2 1) Lemma 1 : For p prime and a positive integer r < p, r ( p 1 r 1). Proof : Note the identity : ( ) p = p ( ) p 1 r r r 1 Here, gcd(r, p) = 1 but ( ) ( p r is a positive integer. So r must divide p 1 r 1). Lemma 2 : If N = n i=1 pai i and the number of ways to write N as a product of m positive integers, then n ( ) ai + m 1 S = m 1 Proof : Take any a i. Thus, there are n i=1 i=1 From the balls in urns principle, there are ( a i+m 1) m 1 ways. ( ai+m 1) n ( m 1 ways and S = ai+m 1) i=1 m 1. Let, a i + m = q i where q i are primes. Then, from lemma 1 above, m ( q i 1 m 1) for all q i. Multiplying them together we get, m n n ( ) ai + m 1 = S m 1 i=1 16. From the equations, abcd = d 2 + d and abcd = a 2 + 2a implying that d 2 + d + 1 = (a + 1) 2 If d N, d 2 + d + 1 is not a perfect square from problem 12. So, we have 1 d 0. If d = 0, a = 2 and abc = 1 = 2bc = 1, no solution. 11

12 If d = 1, abc = 0 and bc = (a + 2). Now, a(a + 2) = d(d + 1) = 0 giving a = 0 or a = 2. If a = 0, bc = 2 = (b, c) = (1, 2), ( 1, 2), ( 2, 1), (2, 1) 17. We can use the famous Vietta Jumping to solve this problem. We claim that (x, y) = (c, c+1) is the only pair for which the fraction x2 +y 2 +1 xy+1 is a positive integer and thus the only integer value it can assume is 2. Let x 2 + y xy + 1 = k and the smallest solution of be (x, y). Since is symmetric over x, y we can assume W LOG x y. Note that x = y yields x x x = x < 2 x 2 + 1, contradiction!! Therefore, x > y. x 2 kxy + y k = 0 Fix in y, k and consider all values of (x, y). will be quadratic in x and let the other root of be x 1. From Vietta s formula, Thus x + x 1 = ky xx 1 = y k x 1 = y2 + 1 k x < y2 x < y2 y = y But then (x, x 1 ) < (x, y) would be a smaller solution than the smallest solution. Contradiction! 18. From Fermat s little theorem, a 11 1 = a 10 0 or 1 (mod 11). n n n , 1, 2, 3, 4, 5, 6, 7, 8 (mod 11) But (mod 11) which isn t possible by any combination of the above. 19. Let, the canonical prime factorization of N is, N = p a1 1...pan n well known that ϕ(n) = p a p an 1 n.(p 1 1)...(p n 1) Then it is. Therefore, ϕ(n) N implies (p 1 1)...(p n 1) p 1...p n. So, one of the primes, say p 1 = 2. Moreover, N can t have more than two prime factors, otherwise 2p 2...p n would be divisible by 4, but p 2,..., p n are distinct odd prime factors. This yields a contradiction! Now we have N = 2 a p b. Then p 1 2p. Since Gcd(p 1, p) = 1, they can not share any common factor. So, p 1 2 and because p odd, we conclude that 12

13 p = 3. Thus, we found an infinite numbers satisfying this property with N = 2 a 3 b. Note that a is necessarily positive integer. Note. We can re-state the problem as : Find all N such that there are N k positive numbers less than N and co-prime to N. Then the value of k would be 3. 13

14 References [1] AoPS topic #393335, Lifting The Exponent Lemma (Containing PDF file), posted by Amir Hossein Parvardi (amparvardi on AoPS). [2] Santiago Cuellar, Jose Alejandro Samper, A nice and tricky lemma (lifting the exponent), Mathematical Reflections [3] AoPS topic #356847, n+3 perfect cube (Problem 1 in this article), posted by mathmdmb. [4] AoPS topic #36224, perfect power (Problem 2 in this article), posted by mathmdmb. [5] AoPS topic #393335,Lifting The Exponent Lemma (Problem 5 in this article), posted by amparvardi. [6] AoPS blog #85314,The Law Of Nature-Number Theory (Problem 8 in this article), posted by mathmdmb. [7] AoPS topic #356079, Find all n (Problem 16 in this article), posted by mathmdmb. [8] AoPS topic #304361, Problem 202 in Number Theory Marathon (problem 17 in this article), posted by mathmdmb. [9] AoPS topic #365172, Solve equation (problem in this article), posted by mathmdmb. [9] AoPS topic #362222, equation (problem in this article),posted by mathmdmb. 14

Lifting The Exponent Lemma (LTE)

Lifting The Exponent Lemma (LTE) Lifting The Exponent Lemma (LTE) Version 6 - Amir Hossein Parvardi April 7, 011 Lifting The Exponent Lemma is a powerful method for solving exponential Diophantine equations. It is pretty well-known in

More information

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

More information

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

PUTNAM 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 information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture 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 information

Winter Camp 2009 Number Theory Tips and Tricks

Winter Camp 2009 Number Theory Tips and Tricks Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine

More information

PRACTICE PROBLEMS: SET 1

PRACTICE PROBLEMS: SET 1 PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if

More information

A SURVEY OF PRIMALITY TESTS

A 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 information

Olympiad Number Theory Through Challenging Problems

Olympiad Number Theory Through Challenging Problems Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents

More information

Basic elements of number theory

Basic 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 information

Basic elements of number theory

Basic 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 information

SOLUTIONS 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 = 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 information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 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 information

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

CS 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 information

Algorithms (II) Yu Yu. Shanghai Jiaotong University

Algorithms (II) Yu Yu. Shanghai Jiaotong University Algorithms (II) Yu Yu Shanghai Jiaotong University Chapter 1. Algorithms with Numbers Two seemingly similar problems Factoring: Given a number N, express it as a product of its prime factors. Primality:

More information

Lecture 4: Number theory

Lecture 4: Number theory Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of

More information

Number Theory Solutions Packet

Number 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 information

Numbers and their divisors

Numbers and their divisors Chapter 1 Numbers and their divisors 1.1 Some number theoretic functions Theorem 1.1 (Fundamental Theorem of Arithmetic). Every positive integer > 1 is uniquely the product of distinct prime powers: n

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 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 information

Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.

Math 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 information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An 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 information

I Foundations Of Divisibility And Congruence 1

I Foundations Of Divisibility And Congruence 1 Contents I Foundations Of Divisibility And Congruence 1 1 Divisibility 3 1.1 Definitions............................. 3 1.2 Properties Of Divisibility..................... 5 1.3 Some Basic Combinatorial

More information

M381 Number Theory 2004 Page 1

M381 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 information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

More information

Corollary 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

Corollary 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 information

Beautiful Mathematics

Beautiful Mathematics Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a

More information

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

More information

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 = 2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented

More information

MATH 145 Algebra, Solutions to Assignment 4

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 information

CSC 474 Network Security. Outline. GCD and Euclid s Algorithm. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms

CSC 474 Network Security. Outline. GCD and Euclid s Algorithm. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms Computer Science CSC 474 Network Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography CSC 474 Dr. Peng Ning 1 Outline GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation

More information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.

This 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 information

Euler s, Fermat s and Wilson s Theorems

Euler 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 information

Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn

Homework 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 information

Elementary Properties of Cyclotomic Polynomials

Elementary Properties of Cyclotomic Polynomials Elementary Properties of Cyclotomic Polynomials Yimin Ge Abstract Elementary properties of cyclotomic polynomials is a topic that has become very popular in Olympiad mathematics. The purpose of this article

More information

Instructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test

Instructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 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 information

Chuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice

Chuck 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 information

Outline. Some Review: Divisors. Common Divisors. Primes and Factors. b divides a (or b is a divisor of a) if a = mb for some m

Outline. Some Review: Divisors. Common Divisors. Primes and Factors. b divides a (or b is a divisor of a) if a = mb for some m Outline GCD and Euclid s Algorithm AIT 682: Network and Systems Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography Modulo Arithmetic Modular Exponentiation Discrete Logarithms

More information

Outline. AIT 682: Network and Systems Security. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms

Outline. AIT 682: Network and Systems Security. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms AIT 682: Network and Systems Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography Instructor: Dr. Kun Sun Outline GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation

More information

Introduction to Information Security

Introduction 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 information

Theory of Numbers Problems

Theory 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 information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

More information

ECEN 5022 Cryptography

ECEN 5022 Cryptography Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,

More information

Fermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.

Fermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them. Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

3 The fundamentals: Algorithms, the integers, and matrices

3 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 information

UNC Charlotte 2004 Algebra with solutions

UNC Charlotte 2004 Algebra with solutions with solutions March 8, 2004 1. Let z denote the real number solution to of the digits of z? (A) 13 (B) 14 (C) 15 (D) 16 (E) 17 3 + x 1 = 5. What is the sum Solution: E. Square both sides twice to get

More information

4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups 4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

More information

On the Prime Divisors of Odd Perfect Numbers

On the Prime Divisors of Odd Perfect Numbers On the Prime Divisors of Odd Perfect Numbers Justin Sweeney Department of Mathematics Trinity College Hartford, CT justin.sweeney@trincoll.edu April 27, 2009 1 Contents 1 History of Perfect Numbers 5 2

More information

4 Number Theory and Cryptography

4 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 information

AN EXTENSION OF A THEOREM OF EULER. 1. Introduction

AN EXTENSION OF A THEOREM OF EULER. 1. Introduction AN EXTENSION OF A THEOREM OF EULER NORIKO HIRATA-KOHNO, SHANTA LAISHRAM, T. N. SHOREY, AND R. TIJDEMAN Abstract. It is proved that equation (1 with 4 109 does not hold. The paper contains analogous result

More information

Notes on Primitive Roots Dan Klain

Notes on Primitive Roots Dan Klain Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed

More information

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

MATH 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 information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

THE 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 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 information

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.

MATH 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 information

Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2

Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is

More information

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Chapter 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 information

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 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 information

Chapter 5. Number Theory. 5.1 Base b representations

Chapter 5. Number Theory. 5.1 Base b representations Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

More information

34 th United States of America Mathematical Olympiad

34 th United States of America Mathematical Olympiad 34 th United States of America Mathematical Olympiad 1. Determine all composite positive integers n for which it is possible to arrange all divisors of n that are greater than 1 in a circle so that no

More information

Partial Sums of Powers of Prime Factors

Partial Sums of Powers of Prime Factors 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec

More information

CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3. Congruences. Congruence: definitions and properties CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

More information

Number Theory Homework.

Number 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 information

Number Theory. Zachary Friggstad. Programming Club Meeting

Number Theory. Zachary Friggstad. Programming Club Meeting Number Theory Zachary Friggstad Programming Club Meeting Outline Factoring Sieve Multiplicative Functions Greatest Common Divisors Applications Chinese Remainder Theorem Throughout, problems to try are

More information

Number Theory and Graph Theory. Prime numbers and congruences.

Number Theory and Graph Theory. Prime numbers and congruences. 1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes

More information

Chapter 3 Basic Number Theory

Chapter 3 Basic Number Theory Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

Algebraic Number Theory and Representation Theory

Algebraic Number Theory and Representation Theory Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number

More information

Writing Assignment 2 Student Sample Questions

Writing Assignment 2 Student Sample Questions Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.

More information

A Readable Introduction to Real Mathematics

A Readable Introduction to Real Mathematics Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest

More information

Integers and Division

Integers 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 information

x y z 2x y 2y z 2z x n

x y z 2x y 2y z 2z x n Integer Solutions, Rational solutions of the equations 4 4 4 x y z x y y z z x n 4 4 and x y z xy xz y z n; And Crux Mathematicorum Contest Corner problem CC4 Konstantine Zelator P.O. Box 480 Pittsburgh,

More information

A Few Primality Testing Algorithms

A Few Primality Testing Algorithms A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others

More information

Contest Number Theory

Contest Number Theory Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,

More information

RMT 2013 Power Round Solutions February 2, 2013

RMT 2013 Power Round Solutions February 2, 2013 RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated

More information

Mathematics 4: Number Theory Problem Sheet 3. Workshop 26 Oct 2012

Mathematics 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 information

Factoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors.

Factoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Factoring Algorithms Pollard s p 1 Method This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Input: n (to factor) and a limit B Output: a proper factor of

More information

ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS

ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,

More information

Solutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00

Solutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 Solutions to 18.781 Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 1. (Niven 2.3.3) Solve the congruences x 1 (mod 4), x 0 (mod 3), x 5 (mod 7). First we note that 4, 3, and 7 are pairwise relatively

More information

Outline. Number Theory and Modular Arithmetic. p-1. Definition: Modular equivalence a b [mod n] (a mod n) = (b mod n) n (a-b)

Outline. Number Theory and Modular Arithmetic. p-1. Definition: Modular equivalence a b [mod n] (a mod n) = (b mod n) n (a-b) Great Theoretical Ideas In CS Victor Adamchik CS - Lecture Carnegie Mellon University Outline Number Theory and Modular Arithmetic p- p Working modulo integer n Definitions of Z n, Z n Fundamental lemmas

More information

Exercises 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. 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 information

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.

More information

18 Divisibility. and 0 r < d. Lemma Let n,d Z with d 0. If n = qd+r = q d+r with 0 r,r < d, then q = q and r = r.

18 Divisibility. and 0 r < d. Lemma Let n,d Z with d 0. If n = qd+r = q d+r with 0 r,r < d, then q = q and r = r. 118 18. DIVISIBILITY 18 Divisibility Chapter V Theory of the Integers One of the oldest surviving mathematical texts is Euclid s Elements, a collection of 13 books. This book, dating back to several hundred

More information

Introduction to Number Theory

Introduction to Number Theory Introduction to Number Theory Paul Yiu Department of Mathematics Florida Atlantic University Spring 017 March 7, 017 Contents 10 Pythagorean and Heron triangles 57 10.1 Construction of Pythagorean triangles....................

More information

Introduction to Number Theory 1. c Eli Biham - December 13, Introduction to Number Theory 1

Introduction to Number Theory 1. c Eli Biham - December 13, Introduction to Number Theory 1 Introduction to Number Theory 1 c Eli Biham - December 13, 2012 206 Introduction to Number Theory 1 Division Definition: Let a and b be integers. We say that a divides b, or a b if d s.t. b = ad. If b

More information

Congruences and Residue Class Rings

Congruences and Residue Class Rings Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences

More information

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z. Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

MATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1

MATH 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 information

Solutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00

Solutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00 Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d

More information

Number Theory Proof Portfolio

Number 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 information