A First Look at the Complex Modulus

Size: px
Start display at page:

Download "A First Look at the Complex Modulus"

Transcription

1 A First Look at the Complex Modulus After expanding the field of arithmetic by introducing complex numbers, and also defining their properties, Gauss introduces the complex modulus. We have treated the concept of the modulus earlier. The character of each number was discovered to be not self-evident, but, rather, depended on its relation with other numbers, i.e. different moduli. Now on the plane of complex numbers, how will we find the character of complex numbers, in other words, how do we determine whether a number is a quadratic, cubic, biquadratic, or non-residues? As a beginning in this investigation, let us take as an example a complex prime number 4 i. Given 4 i as a modulus, how will we determine the congruency of other number s relative to a complex modulus? How can we find least residues? We will begin by hearing from Gauss, in his 2nd treatise on biquadratic residues: Gauss writes: the schema of complex numbers is a system of equidistant points which are laid on equidistant straight lines such that the infinite plane is decomposed into infinitely many squares. Every number which is divisible by a complex number a + bi = m will likewise form infinitely many squares, whose sides are equal to a 2 +b 2 or whose area is equal to a 2 +b 2 ; the latter squares will have an inclined position to the former if neither of the two numbers a, b are equal to zero. 1 Let s see how this works for 4 i. How do the associates making up this grid relate to one another? Say 4 i is the modulus. Is 4 + i congruent to zero? That this is true is easily seen. Take a different pair of associates, say 1 + 4i and 4 i. 1 The geometric representation given here is one way to represent the arithmetic of complex 1

2 Geometrically it would appear that 1 + 4i is congruent to zero, modulus 4 i, as they both reach a point of zero, and yet these numbers combined do not equal zero like the last two. How about the simpler case of real numbers that are not equally distant from zero, as in the case of 2 and 37 mod. 5? There it is a question of divisibility, that the distance between the two numbers is a multiple of 5. What about in this case? Is 1 + 4i divisible by 4 i? Try this out geometrically on the grid. The modulus defines a given pathway through all other numbers, and a particular viewpoint of them all. Here, we can think of the spaces on the new grid we created as units. Proceeding from the origin, any of the associates could be considered our new unit. Say 1 + 4i is our unit. How many of repetitions of the unit is 4 i from 1 + 4i? What is the proportion between the units? What did you find? In this case 4 i is considered our downward vertical direction, akin to i on the former grid of unit one squares, thus it is one unit vertically down we need to go. The complex modulus presents, even in the simple case of two associates, a problem of complex multiplication. If (4 i)(i) = 1 + 4i, then 1 + 4i, our number, is divisible by the modulus, right? Therefore, 1 + 4i is congruent to zero modulus 4 i. If we want to demonstrate this arithmetically, we need to make the denominator a whole (1 + 4i)(4 + i) number. In this way it is easy to see that (4 i)(4 + i) = i. numbers. There are other physical forms which complex numbers can assume. 2

3 But further still, are all the points on the red grid divisible by any of the associates? Let s pick a new number, say 3+5i. Is it divisible by the associates? Try it geometrically first. If 4 i was our modulus, how many spaces in the red grid would we need to go to get to 3 + 5i? After you find this, show that it is true arithmetically as well. The following animation shows modulus 4 i being multiplied by 1 + i. [ANIMATION:multiplication.swf] Try this for some other numbers on the grid. After we have done this, we have shown that every number that corresponds to a point of a square is congruent to zero. This geometrically validates what Gauss said before, that every number which is divisible by a complex number a + bi = m will likewise form infinitely many squares. Therefore, every number, such as 4 i, and its associates will all be congruent to zero if any one of them is taken as modulus. 3

4 What about other numbers that don t lie on the points of the squares? Gauss writes: Every number which is not divisible with respect to modulus m will correspond to a point, which lies either within such a square, or on the boundary line of two squares; the latter case, however, can only occur if a, b have a common divisor... What are these numbers congruent to, relative to the modulus? Example : 6 + 2i? mod 4 i Think about this geometrically. Just now we found all the numbers which represented points of the squares of the red grid were congruent to zero. Here, relative to 6 + 2i again, is there another line that can be drawn to this point from a different zero? We are not watching a recent presidential campaign debate, but there are a lot of zeros to choose from. Lets pick a zero. How about 9 + 2i, i.e. (4 i)(2 + i). 2 The line drawn from our number divisible by the modulus, 9 + 2i, is 3. 2 Arising as a corollary from this, we here have a way to determine whether uneven complex numbers like 2 + 9i are divisible by any number and thus not prime. It is not hard to demonstrate that any complex number which connects two points on this grid will not be prime. 4

5 Since we are looking at the same point, the two numbers should be congruent relative to this number. Well, is 6 + 2i 3 mod 9 + 2i? Our arithmetic seems to be following along nicely. Try this same number 6 + 2i with a different modulus, say 4 i. The point drawn from 4 i would be 2 + 3i. 5

6 What about if our modulus is 1 + 4i? Again we have a third side of the triangle, 5 2i. Looking at all the associates, we have: 6 + 2i 5 2i mod 1 + 4i 6 + 2i 5 2i mod 1 4i 6 + 2i 2 + 3i mod 4 i 6 + 2i 2 + 3i mod 4 + i Of these two numbers that are congruent relative to the modulus, one of them is smaller. This brings us to a new question. What is the least possible length for any one of the points lying within a square? Given what we have discovered about these triangles, now let s look at one particular point in the square from the standpoint of many lines. 6

7 All the numbers, 6 4i, 2 3i, 3 6i, 2 2i, 5+3i, 1+2i, 6i, 4+5i, 3+i, 7 are congruent to one of the others relative to one of the associates of 1+4i. Which is one the least residue of 1+4i or one of its associates? Here the least residue is 1 + 2i. All other numbers are congruent to 1 + 2i relative to a modulus which is either one of the 4 associates of 1 + 4i, or some multiple of it. Thus, every number in the plane will be congruent to some least residue which is made up of one of the points within the square. We also have figured out something about a whole class of triangles. Notice that one side of each the triangle is the same. Therefore, in each triangle, the two sides are congruent to each other relative to the modulus. 7

8 How are all of these similar? Now, before going on, let s apply what we ve seen with the complex modulus and triangles on the plane, in a different way. What about a triangle which does not have one of its sides as one of the lines on our red grid. Look at these triangles. With all of these triangles, none of their sides are congruent with our modulus 4-i and its associates. This brings us to a more general case of the plane. Which side of these triangles would be the modulus? Couldn t any one of them be the modulus? Therefore, what does this say about triangles in the complex plane? In the complex domain, two sides of any triangle are always congruent to the third. Moving along, we have shown that every number in the plane will be congruent to one least residue. Extend this fact to the powers of complex numbers. Likewise any complex number taken to any power will be congruent to one of these least residues inside the square, zero, or the sides of the square in the case mentioned by Gauss where a and b have a common divisor. An example of this would be (1 + 2i) 2 i mod 1 + 4i [INSERT ANIMATION: FullPartOne8.swf] To continue with our investigation of least residues: how many are there? We started by finding what was congruent to 0, so we have one to start with. It is easy to count the rest inside the square: 16. We have a total of 17 least residues for modulus 1+4i and its associates. Before continuing forward, let 8

9 us remark what we have achieved in the little time playing around with the geometrical representation mentioned by Gauss: for any complex modulus, we have succeeded in reducing the investigation of every possible complex and real number to one of the points inside, or for the special case mentioned by Gauss, or on the boundary line of a square. Lastly, note that 17 is also the product, called the norm,of 1 + 4i and 1 4i, its conjugate. We will refer to the norm as p. Its general form is thus a 2 + b 2, the sum of two squares. Is every norm, the sum of two squares? Also, what would the area of the square be? If our two sides are 1 + 4i and 4 i, what is their product? Wait a second, how can an area be i? Hmmmm. That doesn t seem to work. Rather, if we want to describe the length of the sides of these squares, they would be the a 2 + b 2, and the area would thus be a 2 + b 2. What does this tell us about the nature of these complex numbers, that they cannot represent areas? Let us now proceed onward to investigate the least residues of a given complex modulus. 9

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

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

More information

Complex Circle. by Liona Fan Chiang

Complex Circle. by Liona Fan Chiang Complex Circle by Liona Fan Chiang By the conclusion of Gauss first treatise on biquadratic residues, brilliant Gauss was finally able to algebraically arrive at a representation of specific primes into

More information

Modulus. Peter Martinson

Modulus. Peter Martinson Modulus Peter Martinson Before Karl Gauss moved to attend Göttingen University in October 1795, and before he was able to investigate the works of other famous mathematicians, such as that turncoat Leonhard

More information

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

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

More information

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

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

Solving the general quadratic congruence. y 2 Δ (mod p),

Solving the general quadratic congruence. y 2 Δ (mod p), Quadratic Congruences Solving the general quadratic congruence ax 2 +bx + c 0 (mod p) for an odd prime p (with (a, p) = 1) is equivalent to solving the simpler congruence y 2 Δ (mod p), where Δ = b 2 4ac

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

For your quiz in recitation this week, refer to these exercise generators:

For your quiz in recitation this week, refer to these exercise generators: Monday, Oct 29 Today we will talk about inverses in modular arithmetic, and the use of inverses to solve linear congruences. For your quiz in recitation this week, refer to these exercise generators: GCD

More information

MATH Fundamental Concepts of Algebra

MATH Fundamental Concepts of Algebra MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even

More information

Sums of Squares. Bianca Homberg and Minna Liu

Sums of Squares. Bianca Homberg and Minna Liu Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares

More information

2.57 PART E: THE FUNDAMENTAL THEOREM OF ALGEBRA (FTA) The Fundamental Theorem of Algebra (FTA)

2.57 PART E: THE FUNDAMENTAL THEOREM OF ALGEBRA (FTA) The Fundamental Theorem of Algebra (FTA) 2.57 PART E: THE FUNDAMENTAL THEOREM OF ALGEBRA (FTA) The Fundamental Theorem of Algebra (FTA) If f ( x) is a nonconstant n th -degree polynomial in standard form with real coefficients, then it must have

More information

22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve

22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve 22. The Quadratic Sieve and Elliptic Curves 22.a The Quadratic Sieve Sieve methods for finding primes or for finding factors of numbers are methods by which you take a set P of prime numbers one by one,

More information

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6 Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine

More information

ax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d

ax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d 10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to

More information

3.4. ZEROS OF POLYNOMIAL FUNCTIONS

3.4. ZEROS OF POLYNOMIAL FUNCTIONS 3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find

More information

EXAMPLES OF MORDELL S EQUATION

EXAMPLES OF MORDELL S EQUATION EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural

More information

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization

More information

Table of Contents. 2013, Pearson Education, Inc.

Table of Contents. 2013, Pearson Education, Inc. Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter

More information

Finding Divisors, Number of Divisors and Summation of Divisors. Jane Alam Jan

Finding Divisors, Number of Divisors and Summation of Divisors. Jane Alam Jan Finding Divisors, Number of Divisors and Summation of Divisors by Jane Alam Jan Finding Divisors If we observe the property of the numbers, we will find some interesting facts. Suppose we have a number

More information

Notes: Pythagorean Triples

Notes: Pythagorean Triples Math 5330 Spring 2018 Notes: Pythagorean Triples Many people know that 3 2 + 4 2 = 5 2. Less commonly known are 5 2 + 12 2 = 13 2 and 7 2 + 24 2 = 25 2. Such a set of integers is called a Pythagorean Triple.

More information

EULER S THEOREM KEITH CONRAD

EULER S THEOREM KEITH CONRAD 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

More information

G. Eisenstein, 2. Applications of algebra to transcendental arithmetic.

G. Eisenstein, 2. Applications of algebra to transcendental arithmetic. G. Eisenstein, 2. Applications of algebra to transcendental arithmetic. Given two algebraic equations whatsoever, we can eliminate the unknown quantity x in two different ways, either by putting in place

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

1 What is the area model for multiplication?

1 What is the area model for multiplication? for multiplication represents a lovely way to view the distribution property the real number exhibit. This property is the link between addition and multiplication. 1 1 What is the area model for multiplication?

More information

GRE Quantitative Reasoning Practice Questions

GRE Quantitative Reasoning Practice Questions GRE Quantitative Reasoning Practice Questions y O x 7. The figure above shows the graph of the function f in the xy-plane. What is the value of f (f( ))? A B C 0 D E Explanation Note that to find f (f(

More information

Discrete Math. Instructor: Mike Picollelli. Day 10

Discrete Math. Instructor: Mike Picollelli. Day 10 Day 10 Fibonacci Redux. Last time, we saw that F n = 1 5 (( 1 + ) n ( 5 2 1 ) n ) 5. 2 What Makes The Fibonacci Numbers So Special? The Fibonacci numbers are a particular type of recurrence relation, a

More information

CLASS-IX MATHEMATICS. For. Pre-Foundation Course CAREER POINT

CLASS-IX MATHEMATICS. For. Pre-Foundation Course CAREER POINT CLASS-IX MATHEMATICS For Pre-Foundation Course CAREER POINT CONTENTS S. No. CHAPTERS PAGE NO. 0. Number System... 0 3 0. Polynomials... 39 53 03. Co-ordinate Geometry... 54 04. Introduction to Euclid's

More information

MODULAR ARITHMETIC KEITH CONRAD

MODULAR ARITHMETIC KEITH CONRAD 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

More information

4. Congruence Classes

4. Congruence Classes 4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {

More information

Divisibility of Natural Numbers

Divisibility of Natural Numbers 10-19-2009 Divisibility of Natural Numbers We now return to our discussion of the natural numbers. We have built up much of the mathematical foundation for the natural numbers (N = 1, 2, 3,...). We used

More information

Math 430 Midterm II Review Packet Spring 2018 SOLUTIONS TO PRACTICE PROBLEMS

Math 430 Midterm II Review Packet Spring 2018 SOLUTIONS TO PRACTICE PROBLEMS Math 40 Midterm II Review Packet Spring 2018 SOLUTIONS TO PRACTICE PROBLEMS WARNING: Remember, it s best to rely as little as possible on my solutions. Therefore, I urge you to try the problems on your

More information

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

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

More information

Lesson 8: Complex Number Division

Lesson 8: Complex Number Division Student Outcomes Students determine the modulus and conjugate of a complex number. Students use the concept of conjugate to divide complex numbers. Lesson Notes This is the second day of a two-day lesson

More information

6: Polynomials and Polynomial Functions

6: Polynomials and Polynomial Functions 6: Polynomials and Polynomial Functions 6-1: Polynomial Functions Okay you know what a variable is A term is a product of constants and powers of variables (for example: x ; 5xy ) For now, let's restrict

More information

Theory of Biquadratic Residues Second Treatise

Theory of Biquadratic Residues Second Treatise Theory of Biquadratic Residues Second Treatise Carl Gauss Commentationes soc. reg. sc. Gotting. recentiores. Vol. VII. Gottingae 8 4. That which was requisite for the classification of the number + was

More information

1: Please compute the Jacobi symbol ( 99

1: Please compute the Jacobi symbol ( 99 SCORE/xx: Math 470 Communications Cryptography NAME: PRACTICE FINAL Please show your work write only in pen. Notes are forbidden. Calculators, all other electronic devices, are forbidden. Brains are encouraged,

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

More information

Commutative Rings and Fields

Commutative Rings and Fields Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

More information

Q 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?

Q 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today? 2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a

More information

THE GAUSSIAN INTEGERS

THE GAUSSIAN INTEGERS THE GAUSSIAN INTEGERS KEITH CONRAD Since the work of Gauss, number theorists have been interested in analogues of Z where concepts from arithmetic can also be developed. The example we will look at in

More information

Chapter 1 Linear Equations. 1.1 Systems of Linear Equations

Chapter 1 Linear Equations. 1.1 Systems of Linear Equations Chapter Linear Equations. Systems of Linear Equations A linear equation in the n variables x, x 2,..., x n is one that can be expressed in the form a x + a 2 x 2 + + a n x n = b where a, a 2,..., a n and

More information

32 Divisibility Theory in Integral Domains

32 Divisibility Theory in Integral Domains 3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible

More information

Complex Numbers. Rich Schwartz. September 25, 2014

Complex Numbers. Rich Schwartz. September 25, 2014 Complex Numbers Rich Schwartz September 25, 2014 1 From Natural Numbers to Reals You can think of each successive number system as arising so as to fill some deficits associated with the previous one.

More information

ORDERS OF ELEMENTS IN A GROUP

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

More information

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 017/018 DR. ANTHONY BROWN. Lines and Their Equations.1. Slope of a Line and its y-intercept. In Euclidean geometry (where

More information

ORDERS OF UNITS IN MODULAR ARITHMETIC

ORDERS OF UNITS IN MODULAR ARITHMETIC ORDERS OF UNITS IN MODULAR ARITHMETIC KEITH CONRAD. Introduction If a mod m is a unit then a ϕ(m) mod m by Euler s theorem. Depending on a, it might happen that a n mod m for a positive integer n that

More information

MAT029C. 8.2 Multiplying and Simplifying with Radical Expressions.

MAT029C. 8.2 Multiplying and Simplifying with Radical Expressions. MAT029C TOPICS: RADICAL EQUATIONS QUADRATIC EQUATIONS Radical Equations 8.1 Introduction to Radical Expressions I. Basically, squaring and square rooting undo each other: = 9 and = 3. So, = 9, right? II.

More information

Number Theory Math 420 Silverman Exam #1 February 27, 2018

Number Theory Math 420 Silverman Exam #1 February 27, 2018 Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer

More information

Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:

Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the

More information

M381 Number Theory 2004 Page 1

M381 Number Theory 2004 Page 1 M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

More information

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2. 1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of

More information

CHAPTER 3. Congruences. Congruence: definitions and properties

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

More information

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635 COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is

More information

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8 Warm Up Look for a pattern and predict the next number or expression in the list. 1. 1000, 500, 250, 125, 62.5 2. 1, 2, 4, 7, 11, 16, 22 3. 1, 3, 9, 27, 81 4. 8, 3, 2, 7, -12 5. 2, 2 2, 4, 4 2, 8 6. 7a

More information

Elementary proofs of congruences for the cubic and overcubic partition functions

Elementary proofs of congruences for the cubic and overcubic partition functions AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 602) 204), Pages 9 97 Elementary proofs of congruences for the cubic and overcubic partition functions James A. Sellers Department of Mathematics Penn State

More information

Blankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus

Blankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus Blankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus Amina Dozier, Charles Fahringer, Martin Harrison, Jeremy Lyle Dr. Neil Calkin, Dr. Kevin James, Dr. Dave Penniston July 13, 2006

More information

Integers and Division

Integers and Division Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random

More information

7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

IRREDUCIBILITY TESTS IN F p [T ]

IRREDUCIBILITY TESTS IN F p [T ] IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are

More information

Math-3. Lesson 3-1 Finding Zeroes of NOT nice 3rd Degree Polynomials

Math-3. Lesson 3-1 Finding Zeroes of NOT nice 3rd Degree Polynomials Math- Lesson - Finding Zeroes of NOT nice rd Degree Polynomials f ( ) 4 5 8 Is this one of the nice rd degree polynomials? a) Sum or difference of two cubes: y 8 5 y 7 b) rd degree with no constant term.

More information

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

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

More information

Circles in F 2 q. Jacob Haddock, Wesley Perkins, and John Pope Faculty Adviser: Dr. Jeremy Chapman

Circles in F 2 q. Jacob Haddock, Wesley Perkins, and John Pope Faculty Adviser: Dr. Jeremy Chapman Circles in F q Jacob Haddock, Wesley Perkins, and John Pope Faculty Adviser: Dr. Jeremy Chapman Abstract. In Euclid s The Elements, a unique circle in R is determined by three noncollinear points. This

More information

Lecture Notes. Advanced Discrete Structures COT S

Lecture Notes. Advanced Discrete Structures COT S Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section

More information

Contest Number Theory

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

More information

MATH 115, SUMMER 2012 LECTURE 12

MATH 115, SUMMER 2012 LECTURE 12 MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct

More information

Let me just tell you how, then I ll use an example to make it more clear.

Let me just tell you how, then I ll use an example to make it more clear. CHAPTER 15 Equations with Radicals Sec. 1 Simplifying Radicals From grade school, you can probably remember how to take square roots of numbers like 25, 64, and the 100. The number on the inside of the

More information

Sec. 1 Simplifying Rational Expressions: +

Sec. 1 Simplifying Rational Expressions: + Chapter 9 Rational Epressions Sec. Simplifying Rational Epressions: + The procedure used to add and subtract rational epressions in algebra is the same used in adding and subtracting fractions in 5 th

More information

Polynomial and Rational Functions. Copyright Cengage Learning. All rights reserved.

Polynomial and Rational Functions. Copyright Cengage Learning. All rights reserved. 2 Polynomial and Rational Functions Copyright Cengage Learning. All rights reserved. 2.3 Real Zeros of Polynomial Functions Copyright Cengage Learning. All rights reserved. What You Should Learn Use long

More information

Fibonacci mod k. In this section, we examine the question of which terms of the Fibonacci sequence have a given divisor k.

Fibonacci mod k. In this section, we examine the question of which terms of the Fibonacci sequence have a given divisor k. Fibonacci mod k I start by giving out a table of the first 0 Fibonacci numbers actually the first, because we begin with u 0 =0 (and I have a reason for that which will soon become apparent). Okay, which

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

CSE 20: Discrete Mathematics

CSE 20: Discrete Mathematics Spring 2018 Summary So far: Today: Logic and proofs Divisibility, modular arithmetics Number Systems More logic definitions and proofs Reading: All of Chap. 1 + Chap 4.1, 4.2. Divisibility P = 5 divides

More information

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked

More information

AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to

AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS JOHN ROBERTSON Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com This note discusses the possible numbers of ambiguous

More information

3.7 Non-linear Diophantine Equations

3.7 Non-linear Diophantine Equations 37 Non-linear Diophantine Equations As an example of the use of congruences we can use them to show when some Diophantine equations do not have integer solutions This is quite a negative application -

More information

Polynomial and Synthetic Division

Polynomial and Synthetic Division Polynomial and Synthetic Division Polynomial Division Polynomial Division is very similar to long division. Example: 3x 3 5x 3x 10x 1 3 Polynomial Division 3x 1 x 3x 3 3 x 5x 3x x 6x 4 10x 10x 7 3 x 1

More information

Rational Expressions & Equations

Rational Expressions & Equations Chapter 9 Rational Epressions & Equations Sec. 1 Simplifying Rational Epressions We simply rational epressions the same way we simplified fractions. When we first began to simplify fractions, we factored

More information

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number Topic Contents Factoring Methods Unit 3 The smallest divisor of an integer The GCD of two numbers Generating prime numbers Computing prime factors of an integer Generating pseudo random numbers Raising

More information

Introduction to Induction (LAMC, 10/14/07)

Introduction to Induction (LAMC, 10/14/07) Introduction to Induction (LAMC, 10/14/07) Olga Radko October 1, 007 1 Definitions The Method of Mathematical Induction (MMI) is usually stated as one of the axioms of the natural numbers (so-called Peano

More information

The Gauss-Jordan Elimination Algorithm

The Gauss-Jordan Elimination Algorithm The Gauss-Jordan Elimination Algorithm Solving Systems of Real Linear Equations A. Havens Department of Mathematics University of Massachusetts, Amherst January 24, 2018 Outline 1 Definitions Echelon Forms

More information

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

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

ISOMORPHISMS KEITH CONRAD

ISOMORPHISMS KEITH CONRAD ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition

More information

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental

More information

Chapter 10. Right Triangles

Chapter 10. Right Triangles Chapter 10 Right Triangles If we looked at enough right triangles and experimented a little, we might eventually begin to notice some relationships developing. For instance, if I were to construct squares

More information

Basic Principles of Algebra

Basic Principles of Algebra Basic Principles of Algebra Algebra is the part of mathematics dealing with discovering unknown numbers in an equation. It involves the use of different types of numbers: natural (1, 2, 100, 763 etc.),

More information

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

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology. MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number

More information

SMT China 2014 Team Test Solutions August 23, 2014

SMT China 2014 Team Test Solutions August 23, 2014 . Compute the remainder when 2 30 is divided by 000. Answer: 824 Solution: Note that 2 30 024 3 24 3 mod 000). We will now consider 24 3 mod 8) and 24 3 mod 25). Note that 24 3 is divisible by 8, but 24

More information

Symmetries and Polynomials

Symmetries and Polynomials Symmetries and Polynomials Aaron Landesman and Apurva Nakade June 30, 2018 Introduction In this class we ll learn how to solve a cubic. We ll also sketch how to solve a quartic. We ll explore the connections

More information

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient

More information

On Fermat s marginal note: a suggestion

On Fermat s marginal note: a suggestion On Fermat s marginal note: a suggestion Nico F. Benschop - Amspade Research - The Netherlands Annual Dutch Mathematics Congress N M C33 (U-Twente, Apr.1998) Abstract A suggestion is put forward regarding

More information

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018 MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should

More information

THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS

THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical

More information

Executive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:

Executive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics: Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter

More information

MODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.

MODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain. MODEL ANSWERS TO HWK #7 1. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above by c on the left, we get 0

More information

Pade Approximations and the Transcendence

Pade Approximations and the Transcendence Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k

More information

AP PHYSICS SUMMER ASSIGNMENT

AP PHYSICS SUMMER ASSIGNMENT AP PHYSICS SUMMER ASSIGNMENT There are two parts of the summer assignment, both parts mirror the course. The first part is problem solving, where there are 14 math problems that you are given to solve

More information

Exam 2 Solutions. In class questions

Exam 2 Solutions. In class questions Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest

More information

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

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

Lecture 2. The Euclidean Algorithm and Numbers in Other Bases

Lecture 2. The Euclidean Algorithm and Numbers in Other Bases Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers

More information