# Just the Factors, Ma am

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a divisor of N and write d N if N/d is a positive integer Thus, for example, 2 6 Denote by D N the set of all positive integer divisors of N For example D 6 = {1, 2, 3, 6} There are four parts to this note In the first part, we count the divisors of a given positive integer N based on its prime factorization In the second part, we construct all the divisors, and in the third part we discuss the geometry of the D N In part four, we discuss applications to contest problems Study the figure above There are two things to work out One is how does the set of dots and segments represent a number, and the other is how do the digit strings just above the digits 1 through 9 represent those digits Take some time now before reading more to figure this out 2 Counting the divisors of N First consider the example N = 72 To find the number of divisors of 72, note that the prime factorization of 72 is given by 72 = Each divisor d of 72 must be of the form d = 2 i 3 j where 0 i 3 and 0 j 2 Otherwise, /d could not be an integer, by the Fundamental Theorem of Arithmetic (the theorem that guarantees the unique factorization into primes of each positive integer) So there Saylor URL : wwwsaylororg/courses/ma111 1 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

2 are 4 choices for the exponent i and 3 choices for j Hence there are 4 3 = 12 divisors of 72 Reasoning similarly, we can see that for any integer the number of divisors is N = p e 1 1 p e 2 2 p e k k, Π k i=1(e i + 1) = (e 1 + 1)(e 2 + 1) (e k + 1) 3 Constructing the divisors of N In part 1 we found the number of members of D N for any positive integer N In this part, we seek the list of divisors themselves Again we start with the prime factorization of N Suppose N = p e 1 1 p e 2 2 p e k k If k = 2 the listing is straightforward In this case, we build a table by first listing the powers of p 1 across the top of the table and the powers of p 2 down the side, thus obtaining an (e 1 + 1) (e 2 + 1) matrix of divisors Again we use N = 72 as an example Notice that each entry in the table is the product of its row label and its column label What do we do when the number of prime factors of N is more than 2? If k = 3 we can construct e matrices of divisors, one for each power of p 3 For example, if N = 360 = , we construct one 3 4 matrix for 5 0 and one for 5 1 The result is a matrix of divisors The two 3 4 matrices are shown below and For larger values of k we can create multiple copies of the matrix associated with the number N = p e 1 1 p e 2 2 p e k 1 k 1 4 The geometry of D N To investigate the geometry of D N, we first explore the relation divides Recall that a b means that a and b are positive integers for which b/a is an integer The relation has several important properties, three of which are crucial to our discussion Saylor URL : wwwsaylororg/courses/ma111 2 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

3 1 Reflexivity For any positive integer a, a a 2 Antisymmetry For any pair of positive integers a, b, if a b and b a, then a = b 3 Transitivity For any three positive integers, a, b, c, if a b and b c, then a c These properties are easy to prove The first says that each integer is a divisor of itself; that is, a/a is an integer The second says that no two different integers can be divisors of one another This is true since a larger integer can never be a divisor of a smaller one The third property follows from the arithmetic b/a c/b = c/a together with the property that the product of two positive integers is a positive integer Any set S with a relation defined on it that satisfies all three of the properties above is called a partially ordered set, or a poset A branch of discrete mathematics studies the properties of posets, (S, ) Each finite poset has a unique directed graph representation This pictorial representation is what we mean by the geometry of D N To construct the directed graph of a poset (S, ), draw a vertex (dot) for each member of S Then connect two vertices a and b with a directed edge (an arrow) if a b Of course, in our case D N this means we connect a to b if a b The case D 6 is easy to draw: Fig 1 The digraph of D 6 The circles at each of the four vertices are called loops They are included as directed edges because each number is a divisor of itself The reader should imagine that all the non-loop edges are upwardly directed The directed edge from 1 to 6 indicates that 1 6 But since we know that the vertices of D 6 satisfy all three properties required of a poset, we can leave off both (a) the loops, which are implied Saylor URL : wwwsaylororg/courses/ma111 3 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

4 by the reflexive property, and (b) the edges that are implied by the transitivity condition The slimmed down representation, called the Hasse diagram, is much easier to understand It captures all the essential information without cluttering up the scene The Hasse diagram of D 6 is shown below Fig 2, the Hasse diagram of D 6 In general, the Hasse diagram for D N has only those non-loop edges which are not implied by transitivity, that is, those edges from a to b for which b is a prime number multiple of a The Hasse diagrams of D 72, D 30, and D 60 are shown below Fig 3 The Hasse diagram of D 72 Saylor URL : wwwsaylororg/courses/ma111 4 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

5 Notice that each prime divisor of 30 can be considered a direction, multiplication by 2 moves us to the left ( ), by 3 moves us upward ( ) and, by 5 moves us to the right ( ) Also note that if a and b are divisors of 30 then a b if and only if there is a sequence of upwardly directed edges starting at a and ending at b For example, 1 30 and (1, 3), (3, 15), (15, 30) are all directed edges in the digraph of D 30 On the other hand, we say 2 and 15 are incomparable because neither divides the other, and indeed there is no upwardly directed sequence of edges from either one to the other Fig 4 The Hasse diagram of D 30 What would the divisors of 60 look like if we build such a diagram for them? Try to construct it before you look at D Fig 5 The Hasse diagram of D 60 Saylor URL : wwwsaylororg/courses/ma111 5 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

6 Consider the same (lattice/hasse) diagram for the divisors of 210 We can draw this in several ways The first one (Fig 6a) places each divisor of 210 at a level determined by its number of prime divisors The second one (Fig 6b) emphasizes the degrees of freedom These two diagrams are representations of a four dimensional cube, not surprising since the Hasse diagram for D 30 is a three-dimensional cube A mathematical way to say the two digraphs are the same is to say they are isomorphic This means that they have the same number of vertices and the same number of edges and that a correspondence between the vertices also serves as a correspondence between the edges Note that the digraphs in 6a and 6b have the required number of vertices (16) and the required number of edges (32) Can you find an N such that the Hasse diagram of D N is a representation of a five-dimensional cube? Such a digraph must have 2 5 = 32 vertices, and = 80 edges Fig 6a The Hasse diagram of D 210 Saylor URL : wwwsaylororg/courses/ma111 6 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

7 Fig 6b The Hasse diagram of D 210 How can the geometry help us do number theory? One way to use the geometry is in the calculation of the GCF and LCM of two members of D N Note that each element d of D N generates a downward cone of divisors and an upward cone of multiples We can denote these cones by F (d) and M(d) respectively Then the GCF (d, e) = max{f (d) F (e)} and LCM(d, e) = min{m(d) M(e)} Saylor URL : wwwsaylororg/courses/ma111 7 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

8 5 Problems On Divisors Some of the following problems come from MathCounts and the American Mathematics Competitions 1 Find the number of three digit divisors of 3600 Solution: 15 Construct three 3 5 matrices of divisors The first matrix has all the divisors of the form 2 i 3 j, the second all divisors of the form 2 i 3 j 5 1 and the third all the divisors of the form 2 i 3 j 5 2 There is one three digit divisor in the first matrix, 144, five in the second, and nine in the third for a total of = 15 2 How many positive integers less than 50 have an odd number of positive integer divisors? Solution: A number has an odd number of divisors if and only if it is a perfect square Therefore, there are exactly seven such numbers, 1, 4, 9, 16, 25, 36, and 49 3 (The Locker Problem) A high school with 1000 lockers and 1000 students tries the following experiment All lockers are initially closed Then student number 1 opens all the lockers Then student number 2 closes the even numbered lockers Then student number 3 changes the status of all the lockers numbered with multiples of 3 This continues with each student changing the status of all the lockers which are numbered by multiples of his or her number Which lockers are closed after all the 1000 students have done their jobs? Solution: Build a table for the first 20 lockers, and notice that the lockers that end up open are those numbered 1, 4, 9, and 16 This looks like the squares Think about what it takes to make a locker end up open It takes an odd number of changes, which means an odd number of divisors We know how to count the number of divisors of a number N = p e 1 1 p e 2 2 p en n N has D N = (e 1 + 1)(e 2 + 1) (e n + 1) divisors So the issue is how can this last number be odd It s odd if each factor e i + 1 is odd, which means all the e i have to be even This is true precisely when N is a perfect square So the lockers that are closed at the end are just the non-square numbered lockers 4 If N is the cube of a positive integer, which of the following could be the number of positive integer divisors of N? (A) 200 (B) 201 (C) 202 (D) 203 (E) 204 Solution: C The number N must be of the form N = p 3e q 3f So the number of divisors must be of the form D = (3e+1)(3f +1) Such a number Saylor URL : wwwsaylororg/courses/ma111 8 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

9 must be one greater than a multiple of 3 The number N = (2 67 ) 3 = has exactly 202 divisors 5 Let N = How many positive integers are factors of N? (A) 3 (B) 5 (C) 69 (D) 125 (E) 216 Solution: The expression given is the binomial expansion of N = (69 + 1) 5 = 70 5 = So N has (5 + 1)(5 + 1)(5 + 1) = 216 divisors 6 A teacher rolls four dice and announces both the sum S and the product P Students then try to determine the four dice values a, b, c, and d Find an ordered pair (S, P ) for which there is more than one set of possible values Solution: If (S, P ) = (12, 48), then {a, b, c, d} could be either {1, 3, 4, 4} or {2, 2, 2, 6} Note: strictly speaking, these are not sets, but multisets because multiple membership is allowed 7 How many of the positive integer divisors of N = have exactly 12 positive integer divisors? Solution: Let n be a divisor of N with 12 divisors Then n = p 3 q 2 where p and q belong to {2, 3, 5, 7, 11} or n = p 2 qr where p, q, r {2, 3, 5, 7, 11} There are 5 4 = 20 of the former and 5 (4) 2 = 30 of the later So the answer is = 50 8 How many ordered pairs (x, y) of positive integers satisfy xy + x + y = 199? Solution: Add one to both sides and factor to get (x+1)(y+1) = 200 = which has 4 3 factors, one of which is 1 Neither x + 1 not y + 1 can be 1, so there are 10 good choices for x + 1 Saylor URL : wwwsaylororg/courses/ma111 9 Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

10 9 How many positive integers less than 400 have exactly 6 positive integer divisors? Solution: Having exactly 6 divisors means that the number N is of the form p 5 or p 2 q where p and q are different prime numbers Only 2 5 = 32 and 3 5 = 243 are of the first type If p = 2, then q could be any prime in the range 3, 5, 97 of which there are 24 primes If p = 3, then q could be 2 or any prime in the range 5, 43 and there are 13 of these If p = 5, then q could be 2 or 3 or any prime in the range 7, 13 If p = 7 then q = 2, 3, or 5 There are two values of q for p = 11 and one value of q for p = 13 Tally these to get = The product of four distinct positive integers, a, b, c, and d is 8! The numbers also satisfy What is d? Solution: Add 1 to both sides and factor to get Build a factor table for 392 ab + a + b = 391 (1) bc + b + c = 199 (2) (a + 1)(b + 1) = 392 = (3) (b + 1)(c + 1) = 200 = (4) Thus it follows that (a+1, b+1) is one of the following pairs: (1, 392), (2, 196), (4, 98), (8, 49), (7, 56), (14, 28), (392, 1), (196, 2), (98, 4), (49, 8), (56, 7), (28, 14) Each of these lead to dead ends except (49, 8) and (8, 49) For example, a+1 = 7, b + 1 = 56 leads to a = 6 and b = 55 = 5 11, which is not a factor of 8! Next note that b = 48 cannot work because b + 1 = 49 is not a factor of 200 Therefore a = 48 and b = 7 This implies that c + 1 = 200/(b + 1) = 25 and c = 24 Finally, d = 5 Thus, a = 48, b = 7, c = 24 and d = 5 11 How many multiples of 30 have exactly 30 divisors? Solution: I am grateful to Howard Groves (Uniter Kingdom) for this problem A number N = 2 i 3 j 5 k M is a multiple of 30 if each of i, j, k are at least 1 Saylor URL : wwwsaylororg/courses/ma Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

11 Since 30 has exactly three different prime factors, it follows that M = 1, and that (i + 1)(j + 1)(k + 1) = 30 Thus, {i, j, k} = {1, 2, 4}, and there are exactly 6 ways to assign the values to the exponents The numbers are 720, 1200, 7500, 1620, 4050, and Find the number of odd divisors of 13! Solution: The prime factorization of 13! is Each odd factor of 13! is a product of odd prime factors, and there are = 144 ways to choose the five exponents 13 Find the smallest positive integer with exactly 60 divisors 14 (2008 Purple Comet) Find the smallest positive integer the product of whose digits is 9! 15 (1996 AHSME) If n is a positive integer such that 2n has 28 positive divisors and 3n has 30 positive divisors, then how many positive divisors does 6n have? Solution: 35 Let 2 e 1 3 e 2 5 e3 be the prime factorization of n Then the number of positive divisors of n is (e 1 + 1)(e 2 + 1)(e 3 + 1) In view of the given information, we have and 28 = (e 1 + 2)(e 2 + 1)P 30 = (e 1 + 1)(e 2 + 2)P, where P = (e 3 +1)(e 4 +1) Subtracting the first equation from the second, we obtain 2 = (e 1 e 2 )P, so either e 1 e 2 = 1 and P = 2, or e 1 e 2 = 2 and P = 1 The first case yields 14 = (e 1 + 2)e 1 and (e 1 + 1) 2 = 15; since e 1 is a nonnegative integer, this is impossible In the second case, e 2 = e 1 2 and 30 = (e 1 + 1)e 1, from which we find e 1 = 5 and e 2 = 3 Thus n = , so 6n = has (6 + 1)(4 + 1) = 35 positive divisors 16 Find the sum of all the divisors of N = Solution: Consider the product ( )( )( ) Notice that each divisor of N appears exactly once in this expanded product This sum can be thought of as the volume of a ( ) ( ) ( ) box The volume of the box is = (2010 Mathcounts Competition, Target 7) Find the product P of all the divisors of 6 3, and express your answer in the form 6 t, for some integer t Saylor URL : wwwsaylororg/courses/ma Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

12 Solution: Build the 4 4 matrix of divisors of 6 3, and notice that they can be paired up so that each has 6 3 as their product There are 8 such pairs, so P = (6 3 ) 8 = 6 24 So t = Find the largest 10-digit number with distinct digits that is divisible by 11 Solution: We want to keep the digits in decreasing order as much as possible Trying 98765xyuvw works because we can arrange for y + v = 28, while x + u + w = 17 works More later 19 (This was problem 25 on the Sprint Round of the National MATHCOUNTS competition in 2011) Each number in the set {5, 9, 10, 13, 14, 18, 20, 21, 25, 29} was obtained by adding two number from the set {a, b, c, d, e} where a < b < c < d < e What is the value of c? Solution: c = 7 The sum of all 10 numbers is 4 times the sum a+b+c+d+e Why? Now a + b = 5 and d + e = 29, so c = (164 4) 29 5 = = 7 20 (This was problem 8 on the Target Round of the National MATHCOUNTS competition in 2011) How many positive integers less than 2011 cannot be expressed as the difference of the squares of two positive integers? Solution: The answer is 505 If n = a 2 b 2 = (a b)(a + b), then a b and a + b have the same parity, so n is either odd or a multiple of 4 So we want to count all the numbers of the form 4k + 1, k = 0, 1,, 502 together with two values 2 and 4, for a total of Consider the number N = = (a) How many divisors does N have? Solution: Use the formula developed here: τ = (3 + 1)(2 + 1)(3 + 1)(1 + 1) = 96 divisors (b) How many single digit divisors does N have? (c) How many two-digit divisors does N have? (d) How many three-digit divisors does N have? (e) How many four-digit divisors does N have? (f) How many five-digit divisors does N have? Solution: The answers are respectively 9, 25, 33, 23 and 6 You can get these numbers by building the six 4 4 matrices of divisors Use the basic matrix Saylor URL : wwwsaylororg/courses/ma Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

13 of divisors of 1000 a model The other five matrices are obtained from this one by multiplying by 3, by 9, by 7, by 21, and by The integer N has both 12 and 15 as divisors Also, N has exactly 16 divisors What is N? Solution: In order to have both 12 and 15 as divisors, N must be of the form d for some positive integer d Since the number of divisors of N is 16, d must be even But has exactly 16 divisors, so d = 2 and N = How many multiples of 30 have exactly 3 prime factors and exactly 60 factors Solution: This requires some casework We re considering numbers of the form N = 2 i 3 j 5 k which satisfy (i + 1)(j + 1)(k + 1) = 60, i, j, k 1 There are 21 such numbers 24 How many whole numbers n satisfying 100 n 1000 have the same number of odd divisors as even divisors? Solution: Such a number is even but not a multiple of 4, so it follows that we want all the numbers that are congruent to 2 modulo 4, and there are 900/4 = 225 of them 25 What is the sum of the digits in the decimal representation of N = ? Solution: The number is N = = = , the sum of whose digits is What is the fewest number of factors in the product 27! that have to be removed so that the product of the remaining numbers is a perfect square? Solution: Factor 27! to get 27! = The largest square divisor of 27! is , so each of the primes 2, 3, 7, 17, 19, 23 must be removed It takes five factors to do this We must remove each of 17, 19, 23, and then we have 2, 3, 7 to remove We cannot do this with just one factor, so it takes two, either 6 and 7 or 21 and 2 Saylor URL : wwwsaylororg/courses/ma Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

14 27 Euclid asks his friends to guess the value of a positive integer n that he has chosen Archimedes guesses that n is a multiple of 10 Euler guesses that n is a multiple of 12 Fermat guesses that n is a multiple of 15 Gauss guesses that n is a multiple of 18 Hilbert guesses that n is a multiple of 30 Exactly two of the guesses are correct Which persons guessed correctly? Solution: Hilbert must be wrong because if 30 n then so do 10 and 15, which would mean that three of them were right Now 2 n because all but on of the numbers are multiples of 2, and 3 n for the same reason But 5 does not divide n because, if it did, then 30 n which contradicts our first observation Thus Euler and Gauss are the two correct mathematicians Saylor URL : wwwsaylororg/courses/ma Saylororg This material may be copied, stored and distributed for non-commercial purposes only Any commercial use of this material is strictly forbidden

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### 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

### We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Primes. Name Period Number Theory

Primes Name Period A Prime Number is a whole number whose only factors are 1 and itself. To find all of the prime numbers between 1 and 100, complete the following exercise: 1. Cross out 1 by Shading in

### Equivalence Relations

Equivalence Relations Definition An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity}

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### 4. How many integers between 2004 and 4002 are perfect squares?

5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started

### Notes on Matrix Multiplication and the Transitive Closure

ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

### EXPONENTS. To the applicant: KEY WORDS AND CONVERTING WORDS TO EQUATIONS

To the applicant: The following information will help you review math that is included in the Paraprofessional written examination for the Conejo Valley Unified School District. The Education Code requires

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### Squares and Square Roots

SQUARES AND SQUARE ROOTS 89 Squares and Square Roots CHAPTER 6 6.1 Introduction You know that the area of a square = side side (where side means the length of a side ). Study the following table. Side

### 10 k + pm pm. 10 n p q = 2n 5 n p 2 a 5 b q = p

Week 7 Summary Lecture 13 Suppose that p and q are integers with gcd(p, q) = 1 (so that the fraction p/q is in its lowest terms) and 0 < p < q (so that 0 < p/q < 1), and suppose that q is not divisible

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### Fun Number Theory Meeting (Computation, Factors, Exponent Patterns, Factorials, Perfect Squares and Cubes)

Fun Number Theory Meeting (Computation, Factors, Exponent Patterns, Factorials, Perfect Squares and Cubes) Topic This meeting s topics fall in the category of number theory. Students will apply their knowledge

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

### TYPES OF NUMBERS. Example 2. Example 1. Problems. Answers

TYPES OF NUMBERS When two or more integers are multiplied together, each number is a factor of the product. Nonnegative integers that have exactly two factors, namely, one and itself, are called prime

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Coach Monks s MathCounts Playbook! Secret facts that every Mathlete should know in order to win!

Coach Monks s MathCounts Playbook! Secret facts that every Mathlete should know in order to win! Learn the items marked with a first. Then once you have mastered them try to learn the other topics.. Squares

### Axiom A.1. Lines, planes and space are sets of points. Space contains all points.

73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach

### Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Felix Lazebnik This collection of problems is for those who wish to learn about arithmetic and geometric sequences, or to those who wish to improve their understanding

### MATH 10034 Fundamental Mathematics IV

MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.

### Euler s Totient Theorem

Euler s Totient Theorem Misha Lavrov ARML Practice 11/11/2012 Example We want to be able to solve the following type of problem: Problem (VTRMC 2012/4.).. 3 What are the last two digits of 3 33. }{{} 2012

### Applications 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

### 1. By how much does 1 3 of 5 2 exceed 1 2 of 1 3? 2. What fraction of the area of a circle of radius 5 lies between radius 3 and radius 4? 3.

1 By how much does 1 3 of 5 exceed 1 of 1 3? What fraction of the area of a circle of radius 5 lies between radius 3 and radius 4? 3 A ticket fee was \$10, but then it was reduced The number of customers

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### 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.

### There are 8000 registered voters in Brownsville, and 3 8. of these voters live in

Politics and the political process affect everyone in some way. In local, state or national elections, registered voters make decisions about who will represent them and make choices about various ballot

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### Prime Time: Homework Examples from ACE

Prime Time: Homework Examples from ACE Investigation 1: Building on Factors and Multiples, ACE #8, 28 Investigation 2: Common Multiples and Common Factors, ACE #11, 16, 17, 28 Investigation 3: Factorizations:

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Some practice problems for midterm 2

Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography

V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### The Teacher s Circle Number Theory, Part 1 Joshua Zucker, August 14, 2006

The Teacher s Circle Number Theory, Part 1 Joshua Zucker, August 14, 2006 joshua.zucker@stanfordalumni.org [A few words about MathCounts and its web site http://mathcounts.org at some point.] Number theory

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### Category 3 Number Theory Meet #1, October, 2000

Category 3 Meet #1, October, 2000 1. For how many positive integral values of n will 168 n be a whole number? 2. What is the greatest integer that will always divide the product of four consecutive integers?

### EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

### Problem Set 5. AABB = 11k = (10 + 1)k = (10 + 1)XY Z = XY Z0 + XY Z XYZ0 + XYZ AABB

Problem Set 5 1. (a) Four-digit number S = aabb is a square. Find it; (hint: 11 is a factor of S) (b) If n is a sum of two square, so is 2n. (Frank) Solution: (a) Since (A + B) (A + B) = 0, and 11 0, 11

### Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### PEN A Problems. a 2 +b 2 ab+1. 0 < a 2 +b 2 abc c, x 2 +y 2 +1 xy

Divisibility Theory 1 Show that if x,y,z are positive integers, then (xy + 1)(yz + 1)(zx + 1) is a perfect square if and only if xy +1, yz +1, zx+1 are all perfect squares. 2 Find infinitely many triples

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### 1 Introduction. 2 Basic Principles. 2.1 Multiplication Rule. [Ch 9] Counting Methods. 400 lecture note #9

400 lecture note #9 [Ch 9] Counting Methods 1 Introduction In many discrete problems, we are confronted with the problem of counting. Here we develop tools which help us counting. Examples: o [9.1.2 (p.

### 6.1 The Greatest Common Factor; Factoring by Grouping

386 CHAPTER 6 Factoring and Applications 6.1 The Greatest Common Factor; Factoring by Grouping OBJECTIVES 1 Find the greatest common factor of a list of terms. 2 Factor out the greatest common factor.

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Chapter 6. Number Theory. 6.1 The Division Algorithm

Chapter 6 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,

### STRAND B: Number Theory. UNIT B2 Number Classification and Bases: Text * * * * * Contents. Section. B2.1 Number Classification. B2.

STRAND B: Number Theory B2 Number Classification and Bases Text Contents * * * * * Section B2. Number Classification B2.2 Binary Numbers B2.3 Adding and Subtracting Binary Numbers B2.4 Multiplying Binary

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### Solutions to Problems for Mathematics 2.5 DV Date: April 14,

Solutions to Problems for Mathematics 25 DV Date: April 14, 2010 1 Solution to Problem 1 The equation is 75 = 12 6 + 3 Solution to Problem 2 The remainder is 1 This is because 11 evenly divides the first

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### Number Sense and Operations

Number Sense and Operations representing as they: 6.N.1 6.N.2 6.N.3 6.N.4 6.N.5 6.N.6 6.N.7 6.N.8 6.N.9 6.N.10 6.N.11 6.N.12 6.N.13. 6.N.14 6.N.15 Demonstrate an understanding of positive integer exponents

### Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

### Session 6 Number Theory

Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### A permutation can also be represented by describing its cycles. What do you suppose is meant by this?

Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Grade 7/8 Math Circles Greek Constructions - Solutions October 6/7, 2015

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Greek Constructions - Solutions October 6/7, 2015 Mathematics Without Numbers The

### 1 Number System. Introduction. Face Value and Place Value of a Digit. Categories of Numbers

RMAT Success Master 3 1 Number System Introduction In the decimal number system, numbers are expressed by means of symbols 0, 1,, 3, 4, 5, 6, 7, 8, 9, called digits. Here, 0 is called an insignificant

### 4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?

1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### 1.16 Factors, Multiples, Prime Numbers and Divisibility

1.16 Factors, Multiples, Prime Numbers and Divisibility Factor an integer that goes into another integer exactly without any remainder. Need to be able to find them all for a particular integer it s usually

### Square Roots. Learning Objectives. Pre-Activity

Section 1. Pre-Activity Preparation Square Roots Our number system has two important sets of numbers: rational and irrational. The most common irrational numbers result from taking the square root of non-perfect

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### UK Junior Mathematical Olympiad 2016

UK Junior Mathematical Olympiad 206 Organised by The United Kingdom Mathematics Trust Tuesday 4th June 206 RULES AND GUIDELINES : READ THESE INSTRUCTIONS CAREFULLY BEFORE STARTING. Time allowed: 2 hours.

### If a question asks you to find all or list all and you think there are none, write None.

If a question asks you to find all or list all and you think there are none, write None 1 Simplify 1/( 1 3 1 4 ) 2 The price of an item increases by 10% and then by another 10% What is the overall price

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### An Introduction to Number Theory Prime Numbers and Their Applications.

East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 8-2006 An Introduction to Number Theory Prime Numbers and Their Applications. Crystal

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### Playing with Numbers

PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### By reversing the rules for multiplication of binomials from Section 4.6, we get rules for factoring polynomials in certain forms.

SECTION 5.4 Special Factoring Techniques 317 5.4 Special Factoring Techniques OBJECTIVES 1 Factor a difference of squares. 2 Factor a perfect square trinomial. 3 Factor a difference of cubes. 4 Factor

### SQUARE-SQUARE ROOT AND CUBE-CUBE ROOT

UNIT 3 SQUAREQUARE AND CUBEUBE (A) Main Concepts and Results A natural number is called a perfect square if it is the square of some natural number. i.e., if m = n 2, then m is a perfect square where m

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### Chapter 3: Elementary Number Theory and Methods of Proof. January 31, 2010

Chapter 3: Elementary Number Theory and Methods of Proof January 31, 2010 3.4 - Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Quotient-Remainder Theorem Given

### STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS

STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS The intermediate algebra skills illustrated here will be used extensively and regularly throughout the semester Thus, mastering these skills is an

### Why Vedic Mathematics?

Why Vedic Mathematics? Many Indian Secondary School students consider Mathematics a very difficult subject. Some students encounter difficulty with basic arithmetical operations. Some students feel it