Consider = 19, and consider the remainders when these numbers are divided by 7.
|
|
- Alicia Owen
- 7 years ago
- Views:
Transcription
1 Congruences Note: I have attempted to restore as much of the fonts as I could, unfortunately I do not have the original document, so there could be some minor mistakes. It all started a long time ago when someone noticed that when you add two integers, the remainders get added too. He probably ran and told this to a friend who asked him " Hey, what about multiplication?" They found it worked for multiplication too. Think of two integers and add them up. Now consider the remainders left by these integers when divided by another integer. Consider = 19, and consider the remainders when these numbers are divided by = 5. Now try multiplication 9 * 10 = 90, and the remainders, 2 * 3 = 6. It seems that in those times, the Greeks, Indians and Chinese talked to each other a lot about these things, and developed quite a bit of knowledge about this kind of things. The Indians and Chinese particularly enjoyed creating and solving a variety of interesting problems ( most of which had very little to do with everyday life! ), the solutions of which involved thinking about remainders. It was tough though, because they did not even have the algebraic notation that we take for granted today. Even after the advent of Algebra, it took a couple of hundred years before Gauss in Europe, came up with the notation we use today for congruences. This notation probably opened the floodgates, for in the next couple of hundred years we saw a major outpouring of discoveries, conjectures, and theorems dealing with integers that formalized and rigorized those ideas. Gauss came up with the congruence notation to indicate the relationship between all integers that leave the same remainder when divided by a particular integer. This particular integer is called the modulus, and the arithmetic we do with this type of relationships is called the Modular Arithmetic. For example, the integers 2, 9, 16, all leave the same remainder when divided by 7. The special relationship between the numbers 2, 9, 16 with respect to the number 7 is indicated by saying these numbers are congruent to each other modulo 7, and writing, ( mod7). Thus the intuitive idea behind the congruency concept is as follows.
2 Intuitive idea : If two numbers a and b leave the same remainder when divided by a third number m, then we say "a is congruent to b modulo m", and write a b ( mod m ). The following definition formalizes this concept. Defintion: a b ( mod m ) if and only if m (a - b). Using the definition of "divides", m (a - b) can be translated to a - b = km for some integer k. Although some books give this as a lemma or theorem, it is always best to think of this as an immediate extension of the definition of the congruency using the definition of the divides. Also note that the intuitive idea we mentioned at the outset can be easily derived from the formal definition above. Some texts may give this too as a theorem or lemma. The conclusion in the next paragraph however, has far reaching implications, and for this reason we list it as our first Theorem. Though this theorem seems obvious, it needs an important theorem from Divisibility for its proof. Theorem 1: Every integer is congruent ( mod m) to exactly one of the numbers in the list :- 0, 1, 2,. (m - 2), (m -1). Proof: From a theorem in Divisibility, sometimes called Division Algorithm, for every integer a, there exist unique integers q and r such that a = qm + r, with 0 r < m. This shows a - r = qm or m (a - r). Hence a r ( mod m ). Since r is a unique integer, and 0 r < m, it follows that r is only one of the integers on the list. In the above proof, we could have jumped from a = qm + r to a r ( mod m ) using the intuitive idea. You can always do this in your proofs with a sentence like "since a = qm +
3 r we have a r ( mod m )". This is perfectly fine, because as I mentioned earlier many texts give the intuitive idea as a lemma. The number r in the proof is called the least residue of the number a modulo m. Exercise 1: Find the least residue of 100 (a) mod 3, (b) mod 30, (c) mod 98, and (d) mod 103. Congruences act like equalities in many ways. The following theorem is a collection of the properties that are similar to equalities. All of these easily follow directly from the definition of congruence. Pay particular attention to the last two, as we will be using them quite often. Theorem 2: For any integers a, b, c, and d (a) a a ( mod m ) (b) If a b ( mod m ), then b a ( mod m ). (c) If a b ( mod m ) and b c ( mod m ), then a c ( mod m ). (d) If a b ( mod m ) and c d ( mod m ), then a ± c b ± d ( mod m ). (e) If a b ( mod m ) and c d ( mod m ), then ac bd ( mod m ). Exercise 2: Verify parts (d) and (e) of the theorem in the following way. Write down two separate congruences with the same modulus that we know are true, such as 9 2 ( mod 7 ) and 17 3 ( mod 7 ). Now add and multiply these congruences to get two new congruences. Check if the new congruences are true. Exercise 3: Prove the following statement. "If a b ( mod m ), then a 2 b 2 ( mod m )". Hint: Do not fall back on the definition. Use the theorem above instead! You have probably guessed that the statement in Exercise 3 can be generalized to say, If a b ( mod m ), then a k b k ( mod m ), where k is any integer.
4 This statement is indeed true and very useful. We will be raising a congruence to the power of an integer of our choice quite often. Note this statement can be proven easily by the repeated application of the method you used in Exercise 3, or more precisely, by using Induction. Have you ever wondered what is the use of "lame" properties like (a) in the last theorem? Well, read on. The last two properties ( (d) and (e) ) in the theorem basically say that we can add or multiply congruences. But how about adding an equation to a congruency or multiplying a congruency by an equation? Note that "adding an equation to a congruency" is a fancy way of saying adding the same integer to both sides of a congruency. Similarly the other fancy phrase means multiplying both sides of a congruency by the same number. Intuition tells us that these two operations must be permissible. In fact, not only they are allowed, but also we will be using them quite often. Let's state them as a theorem and prove it. Theorem 3: For any integers a, b, and c (a) If a b ( mod m ), then a + c b + c ( mod m ). (b) If a b ( mod m ), then ca cb ( mod m ). Proof: Let's prove (b). Proof for (a) is very similar. From Theorem 2 part (a), c c ( mod m ). It is given that a b ( mod m ). Then by Theorem 2 part (e), we have ca cb ( mod m ). Even before you had a look at the proof above, you probably guessed that the "lame" properties are there for a very good reason. The proof above gives us a glimpse of this "reason". Exercise 4: Start with a congruency that we know is true, like 9 2 ( mod 7 ). Now think of an integer and multiply both sides of the congruency by that integer. Check if the congruency still holds. Repeat with another integer. Now repeat the whole process, starting with a fresh congruency, this time with a non-prime modulus.
5 Conspicuously missing from all the properties sated so far is the division of a congruence. Can we divide one congruency by another or by an integer? Unfortunately, the answer in general, is no. However, not all is lost. We are allowed to divide a congruency by some special numbers. But we will postpone this until the end of this chapter, as this operation is more useful when dealing with the area of the next chapter, which are linear congruences. Now we will look at some examples to appreciate the usefulness of the congruences. Example 1: Find the remainder when is divided by 3. We observe that 25 1 ( mod 3 ) and 11-1 ( mod 3 ). Raising these to the approopriate powers, ( mod 3 ) and (-1) 500 ( mod 3 ). That is, ( mod 3 ) and ( mod 3 ). Adding these congruecies, we get ( mod 3 ). Thus the remainder is 2. Example 2: What is the remainder when is divided by 80? We notice that 3 4 = 81 1 ( mod 80 ). That is, we have ( mod 80 ) (1) We also know that 5555 when divided by 4, gives a quotient of 1388 and the remainder 3. Hence, = (3 4 ) Now raising congruence (1) to the power of 1388, we have (3 4 ) (mod80). Multiplying this by 3 3 we get (3 4 ) ( mod 80 ). Which means, ( mod 80 ). Thus the required remainder is 27. Unfortunately you cannot verify this by using your pocket calculator! Exercise 5: Find the remainder when is divided by 126.
6 Example 3: Show that is divisible by 28. We know that 3 3 = 27-1 ( mod 28 ). Further, 1000 = Now, (3 3 ) 333 (-1) ( mod 28 ) = (3 3 ) (( mod 28 ). We also know that 3 3 ( mod 28 ). Adding the last two congruences, ( mod 28 ). Thus 28 divides The problem in the following example needs a little more ingenuity to solve. It is a marvelous example of the power of congruences! Example 4: Prove that 2 5n n + 2 is divisible by 27 for any positive integer n. Note that 2 5n + 1 = n, and 5 n + 2 = n. Now 2 5 = 32 5 ( mod 27 ) and hence (2 5 ) n 5 n ( mod 27 ), and 2. (2 5 ) n 2. 5 n ( mod 27 ). Therefore 2 5n n n n ( mod 27 ) n ( mod 27 ) 0 ( mod 27 ). Which shows 27 divides the given expression. Now try the next exercise without looking back at Example 4. Exercise 6: Prove that 2 n n + 2 is divisible by 25 for any positive integer n. Example 5: Prove that in the base 8 system, a number is congruent to the sum of its "digits" modulo 7.
7 Suppose that N is written as a k a k-1.. a 1 a 0 in the base 8 system. Then N = a k.8 k + a k-1.8 k a a 0.1 Now 8 1 ( mod 7 ) and raising the power, we have 8 n 1 ( mod 7 ) for all integer n. Thus we have a k.8 k a k ( mod 7 ), a k-1.8 k-1 a k-1 ( mod 7 ),... a a 1 ( mod 7 ), a 0.1 a 0 ( mod 7 ). Adding, we get N = a k.8 k + a k-1.8 k a a 0.1 a k + a k a 1 + a 0 ( mod 7 ) Dividing a Congruence Finally we are going to see if we can divide a congruence. Consider a simple congruency, that we know is true, for example, 14 4 ( mod 10 ). If we divide both sides by 2, we get 7 2 ( mod 10 ), which clearly is not true. On the other hand, the true congruence 33 3 ( mod 10 ), upon division by 3 gives 11 1 ( mod 10 ) which is also true. The following theorem tells us when and with what can we divide a congruence. Essentially, it says that we can divide by a number that is relatively prime to the modulus. Theorem 3: ca cb ( mod m ) implies a b ( mod m ) if and only if (c, m) = 1. Proof: Note that we already know that a b ( mod m ) implies ca cb ( mod m ), from Theorem 2. We will prove the other direction, which is what is new, and that allows us to divide. That is, if (c, m) = 1, then ca cb ( mod m ) implies a b ( mod m ). ca cb ( mod m ) implies m ( ca - cb ). That is, m c(a - b). Since (c, m) =1, a theorem from divisibility tells us that m ( a- b). Hence a b ( mod m ).
8 Exercise 7: Consider the following congruences, where x is an integer. State which of these can be simplified by division, and if so, state the biggest number by which you are allowed to divide. 4x 2 ( mod 2 ) 4x 2 ( mod 3 ) 42x 21 ( mod 12 ) 400x 200 ( mod 201 ) 400x 200 ( mod 205 ) 64x 48 ( mod 101 ) 48x 42 ( mod 10 ) Congruences 1. Say "n is odd" in three other ways. 2. Write down a complete residue system modulo 6 consisting only of negative numbers. 3. List all integers x in the range 1 x 100 that satisfy x 7 ( mod 17 ). 4. Find the least residue of 1492 ( mod 4), ( mod 10 ), and ( mod 101). No tricks here! Just divide!! 5. What is the greatest negative number that is congruent to m - 2 ( mod m ). 6. Does 33x 12 ( mod 6 ) imply 11x 4 ( mod 6 )? Why? 7. Does 28x 14 ( mod 12 ) imply 4x 2 ( mod 12)? Why? Does the later congruence imply 2x 1 ( mod 12 )? Why? 8. If p is a prime, does p! 2p ( mod p) imply (p - 1)! 2 ( mod p )? 9. If p is a prime, does (p - 1)! 2p - 2 ( mod p) imply (p - 2)! 2 ( mod p )? 10. Write a single congruence that is equivalent to the pair of congruencies x 1 ( mod 4 ), x 2 ( mod 3 ). 12. Prove that 10 k 1 ( mod 9 ) for every positive integer k. 13. If k 1 ( mod 4 ), then what is 6k +5 congruent to ( mod 4)? 14. Find the missing digit in the multiplication = 2910? Show that every prime greater than 3 is congruent to 1 or 5 ( mod 6). 16. If p is an odd prime and p 1 (mod 3), prove p 1 (mod 6).
9 17. Prove that every integer is congruent ( mod 9) to the sum of its digits. 18. Prove or disprove that if a b ( mod m ), then a 2 b 2 ( mod m). 19. Prove an integer is congruent ( mod 10 ) to its units digit ( last digit ). Use this to prove that the fourth power of an integer must have 0,1, 5, or 6 for its units digit. 20. Show that if n 4 ( mod 9 ), then n cannot be written as the sum of three cubes. 21. Show that no square number has as its last digit, 2, 3, 7, or Find the least positive integer x such that 13 ( x 2 + 1). 23. Prove that 2 5n n + 2 is divisible by 27. Fermat's and Wilson's Theorems 1. What is the remainder when is divided by 163? 2. What is the remainder when is divided by 101? 3. What is the least residue of 5 10 ( mod 11), 5 12 ( mod 11 ), ( mod 11)? 3. What is the remainder when is divided by 7? 4. Prove that n 6-1 is divisible by 7 if (n, 7) = Prove that n 12-1 is divisible by 7 if (n, 7) = Prove that n 7 - n is divisible by 42 for any integer n. 7. What is the remainder when 10! is divided by 11? 8. Show that 28! ( mod 29 ). 9. Find the least positive residue of modulo Show that if p is an odd prime, then 2(p - 3)! -1 (mod p). Divisibility, GCD and Primes
10 1. Show that if a 4n +3 and a 2n +1, then a = ± If a m and b n, prove that ab mn. 3. Does 6 11n imply that 6 n? Justify. Does 6 34n imply 6 n? Justify. 4. If p is a prime, prove that (p, a) = 1 or (p, a) = p. 5. If a is a positive integer, what is (a, 2a)? What is (a, a 2 )?, (a, a + 1)?, and (a, a + 2)? 6. Show that the difference of two consecutive cubes is never divisible by Show that if (a, b) = 1, then (a + b, a - b) = 1 or Prove that square of an integer is either a multiple of 4 or one more than a multiple of Show that if a and b are positive integers and a 3 b 2, then a b. 10. Prove that 3, 7, 11 is the only set of three consecutive primes of the form p, p + 4, p Prove that there are infinitely many primes of the form 4n + 3. Well - Ordering Principle 1. Prove 2 is irrational using the well-ordering principle. 2. Prove n = n(n+1)/2, using the well -ordering principle. 3 Prove directly from the well-ordering principle, that every integer greater than 1 has a prime divisor. 4. Prove that the well-ordering principle implies the Archimedean Axiom: " if a and b are positive integers, there exists an integer N such that an b". Extra 1. Show that no integer of the form 8n + 7 is the sum of three squares.
11 2. What is the last digit of What is the remainder when is divided by 165? ( Watch out is not a prime!). 4 What is the remainder when is divided by 26? 5. If a c and b c and (a, b) = 1, prove that ab c. Give an example to show that the assumption (a, b) = 1 is needed. 6. Show that ( mod 100 ). 7. Prove that 1 + 1/2 + 1/ /2 n < years 1. Prove if ( a, b) = 1 and c b, then (a, c) =1. 2. Prove if (a, c) = 1, then ( a, b) = (a, bc). 3. Prove if (a, b) = 1 and (a, c) = 1, then (a, bc) = Prove if a c, b c, and (a, b) = 1, then ab c. 5. Prove or disprove:- If (a, b) = 1 and (b, c) = 1, then (a, c) =1. 6. Prove if a and b are relatively prime, then so are a k and b n, where k and n are positive integers. 7. We know that if p is a prime and a is a positive number then a p only if a = 1 or a = p. What can you conclude about a, if a p n. 8. Prove or disprove:- If (a, m) = 1 and a b ( mod m ), then (b, m) = In the following, p, p 1, p 2 are primes and a, b are positive integers. We know that p ab only if p a or p b. Suppose a p 1.p 2. What can you say about a? 10. Prove if C is a complete residue system modulo m and (a, m) = 1, then the set C 1 = { ax + b x ε C } is a complete residue system modulo m.
12 11. Prove if R is a reduced residue system modulo m and (a, m) = 1, then the set R 1 = { ax x ε C } is a reduced residue system modulo m. 12. Write down a reduced residue system for mod 6, mod 7, mod 8, mod 10, mod 11, mod 12, mod 15 and mod How many positive integers are there that are less than or equal to, and relatively prime to the following numbers:- 7, 8, 10, 29, How many positive integers are there that are less than or equal to, and relatively prime to the following numbers:- 3.5, 5.11, How many positive integers are there that are less than or equal to, and relatively prime to the following numbers:- 3 4, 5 3, 13 4, How many positive integers are there that are less than or equal to, and relatively prime to the following numbers:- 55, 45, 24, 100, Write down a reduced recidue system modulo 2 m, where m is a positive integer. 18. Find the remainder when is divided by 35; when is divided by 60.
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
More informationHomework 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
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information8 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 informationMath 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
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationV55.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
More informationNumber Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures
Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationOn the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCS 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
More informationk, 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 informationMath 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,
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationStupid Divisibility Tricks
Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013
More informationSECTION 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
More informationSettling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
More informationChapter 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
More informationSUM 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
More informationComputing exponents modulo a number: Repeated squaring
Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method
More informationThe 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
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More information= 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
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationRevised 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.
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationEvery 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
More informationDiscrete Mathematics, Chapter 4: Number Theory and Cryptography
Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationTheorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive
Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime
More informationChapter 3. if 2 a i then location: = i. Page 40
Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)
More informationDIVISIBILITY AND GREATEST COMMON DIVISORS
DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will
More informationClock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More information15 Prime and Composite Numbers
15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such
More informationLectures on Number Theory. Lars-Åke Lindahl
Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder
More informationDiscrete 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
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
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
More information3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.
SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid
More informationSYSTEMS 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
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationThe Euclidean Algorithm
The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationRSA Encryption. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles October 10, 2003
RSA Encryption Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles October 10, 2003 1 Public Key Cryptography One of the biggest problems in cryptography is the distribution of keys.
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationFactorizations: Searching for Factor Strings
" 1 Factorizations: Searching for Factor Strings Some numbers can be written as the product of several different pairs of factors. For example, can be written as 1, 0,, 0, and. It is also possible to write
More informationMATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003
MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld
More information4.2 Euclid s Classification of Pythagorean Triples
178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple
More informationMATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS
MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS Class Meetings: MW 2:00-3:15 pm in Physics 144, September 7 to December 14 [Thanksgiving break November 23 27; final exam December 21] Instructor:
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationHandout NUMBER THEORY
Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why
More informationDigitalCommons@University of Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University
More informationSOLUTIONS 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
More informationElementary Number Theory
Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationAn Introductory Course in Elementary Number Theory. Wissam Raji
An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory
More informationI. 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
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationz 0 and y even had the form
Gaussian Integers The concepts of divisibility, primality and factoring are actually more general than the discussion so far. For the moment, we have been working in the integers, which we denote by Z
More informationGCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!
GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationNumber Theory: A Mathemythical Approach. Student Resources. Printed Version
Number Theory: A Mathemythical Approach Student Resources Printed Version ii Contents 1 Appendix 1 2 Hints to Problems 3 Chapter 1 Hints......................................... 3 Chapter 2 Hints.........................................
More information1.2. Successive Differences
1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationRSA and Primality Testing
and Primality Testing Joan Boyar, IMADA, University of Southern Denmark Studieretningsprojekter 2010 1 / 81 Correctness of cryptography cryptography Introduction to number theory Correctness of with 2
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationPlaying 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
More informationCategory 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?
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationJust the Factors, Ma am
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
More informationFive fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms
The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about
More informationPrimes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov
Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES
More informationContinued 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
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationCubes and Cube Roots
CUBES AND CUBE ROOTS 109 Cubes and Cube Roots CHAPTER 7 7.1 Introduction This is a story about one of India s great mathematical geniuses, S. Ramanujan. Once another famous mathematician Prof. G.H. Hardy
More informationThe Fundamental Theorem of Arithmetic
The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationFactoring & Primality
Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationPrimality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationVocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.
CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationSome 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
More informationUnit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.
Unit 1 Number Sense In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions. BLM Three Types of Percent Problems (p L-34) is a summary BLM for the material
More informationPrime Factorization 0.1. Overcoming Math Anxiety
0.1 Prime Factorization 0.1 OBJECTIVES 1. Find the factors of a natural number 2. Determine whether a number is prime, composite, or neither 3. Find the prime factorization for a number 4. Find the GCF
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More information