# Practice Problems for First Test

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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.- Leonhard Euler. Please note: 1. Calculators are not allowed in the exam. 2. You may assume the following axioms and theorems: (a) Axiom: The natural numbers N satisfies the Well Ordering Principle, i.e. non-empty subset of natural numbers contains a least element. every (b) Theorem: Let a, b, c be integers. The linear equation ax + by = c has a solution if and only if gcd(a, b) divides c. 3. You must provide full explanations for all your answers. You must include your work. Theory Question 1. Prove that if p is prime and p ab then either p a or p b. Explain why the previous statement can be re-written as follows: if p is a prime and ab 0 mod p then a 0 mod p or b 0 mod p (or equivalently, if ab 0 in Z/pZ then either a 0 or b 0 in Z/pZ). Suppose p divides ab but p does not divide a. Then gcd(p, a) = 1 (otherwise, there is d > 1 such that d p and d a, and since p is prime d = p but p does not divide a). By the theorem above, there exist x, y Z such that Multiplying this equation by b gives: ax + py = 1. abx + pby = b. Since p divides ab and p obviously divides pb, then p divides any linear combination of ab and pb. Hence p divides b = (ab)x + (pb)y. The rest of the problem follows from the fact that p a if and only if a 0 mod p. Theory Question 2. Prove the existence part of the Fundamental Theorem of Arithmetic, i.e. every natural number n > 1 can be written as a product of primes. See the book or your class notes. Theory Question 3. Prove the uniqueness part of the Fundamental Theorem of Arithmetic, i.e. every natural number n > 1 can be written uniquely as a product of primes, up to a reordering of the prime-power factors (you may assume Theory Question 2).

2 See the book or your class notes. Theory Question 4. Prove Euclid s theorem on the infinitude of primes, i.e. prove that there exist infinitely many prime numbers. See the book or your class notes. Question 1. Use Euclid s algorithm to: 1. Find the greatest common divisor of 13 and Find all solutions of the linear diophantine equation 13x + 50y = Find the multiplicative inverse of 13 modulo 50. Find the multiplicative inverse of 50 modulo 13. Can you use your previous work to find the multiplicative inverse of 7 modulo 27? 4. Find all solutions to 26x 4 mod = , 13 = , 11 = Thus, the gcd is One particular solution is found by reversing Euclid s algorithm (and then multiplying through by 2). In particular, = 2. By a theorem in class, since gcd(50, 13) = 1, all the solutions of 13x + 50y = 2 are given by: x = t, y = t, for all t Z. 3. A solution to the equation 13x+50y = 1 is given by x = 27 and y = 7. The equation = 1 implies that mod 50 and so, 27 is a multiplicative inverse of 13 modulo 50. Also, 7 6 mod 13 is a multiplicative inverse of 50 modulo 13. And 50 4 mod 27 is the inverse of 7 modulo We first solve 13x 2 mod 50. In fact, we have already seen that = 2. Thus x 4 mod 50 is the unique solution. Thus, all solutions to 26x 4 mod 100 are x = 4 and x = = 54 modulo 100 (again by a theorem proved in class). Question 2. Prove that the equation x 2 7y z 5 = 3 has no solution with x, y, z in Z (Hint: Calculate all possible squares modulo 7).

3 Since the set {0, 1, 2, 3, 4, 5, 6} is a complete residue system modulo 7 and since a 2 = ( a) 2, we can conclude that {0 2, 1 2, 2 2, 3 2 } = {0, 1, 4, 2} is a complete system of squares modulo 7 (i.e. the squares are congruent to either 0, 1, 2 or 4 modulo 7). Now, suppose that there are integers x, y, z such that x 2 7y z 5 = 3. Then: 3 = x 2 7y z 5 x 2 mod 7 but this, x 2 3 mod 7 is impossible by our previous remark. Question 3. Show that 257 divides = Notice that 2 8 = 256 ( 1) mod 257. Thus, 2 25 = (2 8 ) mod 257. Finally: mod 257. Question 4. What time does a clock read 100 hours after it reads 2 o clock? If the time is now 2PM, after 100 hours, will it be in the PM or in the AM? We need to find the remainder of 102 modulo 12: 102 = , and so mod 12. Thus, the time is 6 o clock. By the way, is that in the PM or AM? Suppose the time now is 2PM (which is 14 : 00, the 14th hour of the day). Then we need to find the remainder of 114 = modulo 24: and the time is 6 PM. 114 = , and so mod 24 Question 5. Show that 2 2n + 5 is composite for every positive integer n. First, we try a few numbers. For n = 1, = 9 = 3 3. For n = 2, = 21 = 3 7. For n = 3, = 261 which is divisible by 3. Let us prove that every number 2 2n +5 is divisible by 3 and therefore composite. Since mod 3, we also have 2 2n = (2 2 ) 2n 1 1 mod 3 for all n > 0. Hence: 2 2n mod 3. Question 6. Find the smallest positive integer n such that n 7 mod 3, n 5 mod 5, n 3 mod 7.

4 Simplifying, we need to solve the system: n 1 mod 3, n 0 mod 5, n 3 mod 7. Since n 0 mod 5, then n = 5a. Since n 1 mod 3 and n 3 mod 7 then n 10 mod 21 (solve n = 1 + 3x = 3 + 7y, so 3x 7y = 2). Hence, we need to solve: 5a 10 mod 21 and clearly a = 2 works. Thus, n 10 mod 105 and n = 10 is the smallest valid solution. Question 7. A troop of 17 monkeys store their bananas in 11 piles of equal size with a twelfth pile of 6 left over. When they divide the bananas into 17 equal groups, none remain. What is the smallest number of bananas they can have? Let x be the number of bananas. Then: x 6 mod 11, and x 0 mod 17. Hence, x = 17a for some integer a. Thus, we need to solve 17a 6 mod 11 or 17a+11b = 6. Clearly, a = 1, b = 1 work. Thus a = 1 and x 17 mod 187. The smallest possible number is 17. Question 8. The seven digit number n = 72x20y2, where x and y are digits, is divisible by 72. What are the possibilities for x and y? Notice that 72 = Thus, 8 divides n and so 8 divides the three last digits 0y2 = y2. The only two digit numbers divisible by 8 and ending in 2 are 32 or 72, so y = 3 or 7. The number n is also divisible by 9, thus the sum of its digits x y + 2 = x + y + 13 is a multiple of 9. So x + y + 4 is a multiple of 9. If y = 3 then x + 7 must be a multiple of 9, and the only possibility is x = 2. If y = 7 then x + 11 must be a multiple of 9, which implies that x = 7. Therefore: n = = , or n = = Question 9. Show that mod 17. By the properties of congruences we know that mod 17 because 36 2 mod 17. Moreover, mod 17. Therefore: (2 4 ) 25 ( 1) mod 17.

5 Question 10. Show that 42 n 7 n for all positive n. Note that 42 = First, notice that if n is even or odd, n 7 n will always be even, and so it is divisible by 2. Also, if n 0, 1 or 2 mod 3, it is an easy calculation to check that n 7 n 0 mod 3. And likewise (although a little more work), one checks that for n 0, 1, 2, 3, 4, 5, 6 mod 7 we also get n 7 n 0 mod 7, and so 7 divides n 7 n, for all n 1. Thus, since n 7 n mod 7 and n 7 n mod 6 and gcd(6, 7) = 1, we obtain n 7 n mod 42, for all n. Question 11. Show that is divisible by 7. Note that = mod 7. Thus, mod 7 and 2222 = mod 7. One also calculates that mod 7 and 2222 = and 5555 = Finally: ( 3) (( 3) 6 ) 370 ( 3) 2 +(3 6 ) mod 7. Question 12. Prove that for any natural number n 1, 3 6n 2 6n is divisible by 35 (Hint: work modulo 5 and modulo 7, separately). Let us begin working modulo 5 and 7 separately. One calculates: mod 5, mod 5, mod 7. Thus: 3 6n 2 6n 4 n 4 n 0 mod 5, 3 6n 2 6n mod 7. Thus, since 5 and 7 are relatively prime, 3 6n 2 6n 0 mod 35. Question 13. Find the remainder when 14! is divided by 17. Let us calculate modulo 17: 14! mod ( 8) ( 7) ( 6) ( 5) ( 4) ( 3) mod ( 7) ( 6) ( 5) ( 4) ( 3) mod ( 7) ( 6) ( 5) ( 3) mod ( 6) ( 3) mod 17 8 mod 17

6 where, in order, we have used that 2 ( 8) 16 1 mod 17, and 4( 4) 1 mod 17, and 5 7 ( 5)( 7) 1 mod 17, and 3 6 ( 3)( 6) 1 mod 17. Question 14. Prove that if n is odd, then n and n 2 are relatively prime. (Hint: Use the theorem (b) at the beginning of this document). Suppose n is odd. The numbers n and n 2 satisfy a Bezout s identity of the form n (n 2) = 2. Therefore, by Theorem (b) at the beginning of this document, the GCD of n and n 2 divides 2. But it cannot be equal to 2 because n is odd and 2 does not divide n. Thus, the GCD must be 1. Question 15. Prove that if k 1, the integers 6k + 5 and 7k + 6 are relatively prime. The integers x = 7k + 6 and y = 6k + 5 satisfy a Bezout s identity of the form 6x 7y = 1 because: 6(7k + 6) 7(6k + 5) = = 1. Thus, by Theorem (b) above, the GCD of x and y must be 1. Question 16. Find all primes p such that 17p + 1 is a square. Suppose 17p + 1 = n 2 for some n 1. Then n 2 1 = 17p and, therefore, 17p = (n + 1)(n 1). By the Fundamental Theorem of Arithmetic, the prime factorization of (n + 1)(n 1) is precisely 17p, thus the factor (n+1) is equal to 1, p, 17 or 17p (and in the last case n 1 = 1, so n = 2). The cases n + 1 = 1 and n + 1 = 17p are impossible (because, respectively, they imply n = 0 and 17p = 3). If n + 1 = p then 17 = n 1 and n = 18 so p = 19. If n + 1 = 17 then n 1 = p and n = 16, so p = 15, which is not a prime, so it is not a valid choice. Hence the only possible case is p = 19, so 17p + 1 = = 324 = Question 17. Show that n(n 1)(2n 1) is divisible by 6 for every n > 0. We shall prove that n(n 1)(2n 1) is congruent to 0 modulo 2 and modulo 3. Thus, we can conclude that n(n 1)(2n 1) 0 mod 6. Indeed, if n 0 or 1 modulo 2, then n(n 1) 0 mod 2. Also, if n 0 mod 3 then n 0 mod 3, if n 1 mod 3 then (n 1) 0 mod 3 and if n 2 mod 3 then (2n 1) 0 mod 3. Thus, in all cases n(n 1)(2n 1) 0 mod 3, as desired.

7 Question 18. Does 3x 1 mod 18 have a solution? What about 3x 1 mod 19? Determine for which integers 1 a 17 the equation ax 1 mod 18 has solutions. Do the same modulo 19. The congruence 3x 1 mod 18 does not have solutions because gcd(3, 18) is not a divisor of 1. The congruence 3x 1 mod 19 does have solutions because gcd(3, 19) = 1. The equation ax 1 mod 18 only has solutions when gcd(a, 18) = 1 (find them all). The equation ax 1 mod 19 has solutions for any 1 a 18, because then gcd(a, 19) = 1, because 19 is prime. Question 19. Verify that: 1. The numbers 0, 2, 2 2, 2 3, 2 4, 2 5, 2 6, 2 7, 2 8, 2 9, 2 10 are a complete set of representatives modulo The numbers 0, 2, 2 2, 2 3, 2 4, 2 5, 2 6 are not a complete set of representatives modulo 7. Just a number of calculations...

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

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

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

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

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

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

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

### 12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

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

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

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

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

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

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

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

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

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

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

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

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

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

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

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

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

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

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

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

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

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

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

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

### Definition 1 Let a and b be positive integers. A linear combination of a and b is any number n = ax + by, (1) where x and y are whole numbers.

Greatest Common Divisors and Linear Combinations Let a and b be positive integers The greatest common divisor of a and b ( gcd(a, b) ) has a close and very useful connection to things called linear combinations

### PYTHAGOREAN TRIPLES PETE L. CLARK

PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =

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

### Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II

Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II Last week: How to find one solution to a linear Diophantine equation This week: How to find all solutions to a linear Diophantine

### 3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

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

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

### MATH 13150: Freshman Seminar Unit 10

MATH 13150: Freshman Seminar Unit 10 1. Relatively prime numbers and Euler s function In this chapter, we are going to discuss when two numbers are relatively prime, and learn how to count the numbers

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

### Integers and division

CS 441 Discrete Mathematics for CS Lecture 12 Integers and division Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Symmetric matrix Definition: A square matrix A is called symmetric if A = A T.

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

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

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 50 51. 2

1. Use Euler s trick to find the sum 1 + 2 + 3 + 4 + + 49 + 50. s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 Thus, 2s = 50 51. Therefore, s = 50 51. 2 2. Consider the sequence

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

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

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

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

### 5.1 Commutative rings; Integral Domains

5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following

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

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

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

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

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

### CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as

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

### 5-4 Prime and Composite Numbers

5-4 Prime and Composite Numbers Prime and Composite Numbers Prime Factorization Number of Divisorss Determining if a Number is Prime More About Primes Prime and Composite Numbers Students should recognizee

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

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

### Introduction to Diophantine Equations

Introduction to Diophantine Equations Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September, 2006 Abstract In this article we will only touch on a few tiny parts of the field

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

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

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

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

### Finite Fields and Error-Correcting Codes

Lecture Notes in Mathematics Finite Fields and Error-Correcting Codes Karl-Gustav Andersson (Lund University) (version 1.013-16 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents

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

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

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

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

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

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

### Overview of Number Theory Basics. Divisibility

Overview of Number Theory Basics Murat Kantarcioglu Based on Prof. Ninghui Li s Slides Divisibility Definition Given integers a and b, b 0, b divides a (denoted b a) if integer c, s.t. a = cb. b is called

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

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

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

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

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

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

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Let s just do some examples to get the feel of congruence arithmetic.

Basic Congruence Arithmetic Let s just do some examples to get the feel of congruence arithmetic. Arithmetic Mod 7 Just write the multiplication table. 0 1 2 3 4 5 6 0 0 0 0 0 0 0 0 1 0 1 2 3 4 5 6 2 0

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

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

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

### Lecture 13: Factoring Integers

CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method

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

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### Cryptography and Network Security Number Theory

Cryptography and Network Security Number Theory Xiang-Yang Li Introduction to Number Theory Divisors b a if a=mb for an integer m b a and c b then c a b g and b h then b (mg+nh) for any int. m,n Prime

### TEXAS A&M UNIVERSITY. Prime Factorization. A History and Discussion. Jason R. Prince. April 4, 2011

TEXAS A&M UNIVERSITY Prime Factorization A History and Discussion Jason R. Prince April 4, 2011 Introduction In this paper we will discuss prime factorization, in particular we will look at some of the

### Consequently, for the remainder of this discussion we will assume that a is a quadratic residue mod p.

Computing square roots mod p We now have very effective ways to determine whether the quadratic congruence x a (mod p), p an odd prime, is solvable. What we need to complete this discussion is an effective

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

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

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

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### 9 Modular Exponentiation and Cryptography

9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.