Introduction to Diophantine Equations

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Transcription

1 Introduction to Diophantine Equations Tom Davis September, 2006 Abstract In this article we will only touch on a few tiny parts of the field of linear Diophantine equations. Some of the tools introduced, however, will be useful in many other parts of the subject. 1 Whole Numbers In number theory, we are usually concerned with the properties of the integers, or whole numbers: Z {...,, 2, 1, 0, 1, 2,,...}. Let us begin with a very simple problem that should be familiar to anyone who has studied elementary algebra. Suppose that dolls sell for dollars each, and toy train sets sell for 18 dollars. A store sells 25 total dolls and train sets, and the total amount received is 208 dollars. How many of each were sold? The standard solution is straight-forward: Let x be the number of dolls and y be the number of train sets. Then we have two equations and two unknowns: x + y 25 x + 18y 208 The equations above can be solved in many ways, but perhaps the easiest is to note that the first one can be converted to: x 25 y and then that value of x is substituted into the other equation and solved: (25 y) + 18y y + 18y 208 y + 18y y y Then if we substitute y into either of the original equations, we obtain x 22, and it is easy to check that those values satisfy the conditions in the original problem. Now let s look at a more interesting problem: Suppose that dolls sell for dollars each, and toy train sets sell for 18 dollars. A store sells only dolls and train sets, and the total amount received is 208 dollars. How many of each were sold? 1

2 This time there is only one equation: x + 18y 208. We probably learned in algebra class that you need as many equations as unknowns to solve problems like this, so at first it seems hopeless, but there is one additional key piece of information: the number of dolls and the number of train sets must be non-negative whole numbers. With that in mind, let s see what we can do, ignoring for the moment the fact that we already have a solution, namely: x 22 and y. Beginning from our original equation, we can do this: x x y y 29 2y + 5 y. At first, this seems like we haven t made any progress, but notice that since y has to be an integer, the value of (29 2y) is a whole number, so also the fraction (5 y)/ also has to be a whole number. Let s call it a, and then do some arithmetic with the resulting equation: a 5 y a 5 y y 5 a y 5 a 1 a + 1 a. As before, we still don t have a solution, but things look better in a sense: the denominator in the fraction is smaller: it is now instead of. As before, since we know that a is a whole number, we know that 1 a is a whole number, and therefore (1 a)/ must be a whole number which we will call b, and we ll again repeat the same sort of algebraic manipulations: b b 1 a 1 a a 1 b a 1 b b + 1 b. The same reasoning as before tells us that (1 b)/ must be a whole number, so we call it c: c 1 b c 1 b b 1 c. Now we ve actually made some progress. No matter what integer value c takes, b will be an integer! Let s substitute that value of b back into the previous equation: a 1 b 1 (1 c) c 1 + c.

3 Now substitute this value of a to obtain y: y ( 1 + c) 12 28c c. Finally, we can substitute this value of y into the original equation to obtain x: x y ( c) c c. Our solution looks a little different from what we obtained in the first problem, but here it is: x y c c If c 0 we obtain the same solution we did previously: x 22 and y, but note that any integer value of c will yield another solution. We can see that positive values of c will yield negative values of y, but if c 1, we obtain another solution: x and y 10. It s easy to check that both (x, y) pairs are valid solutions to the original problem. If c is smaller, 2 or less, then the x values become negative, so there are no additional solutions. When an equation of this sort is solvable by this method, there is no limit to the number of steps that need to be taken to obtain the solution. In the example above, we needed to introduce integers a, b and c, but other equations might require more or fewer of these intermediate values. 2 Linear Diophantine Equations What we have just solved is known as a Diophantine equation an equation whose roots are required to be integers. Probably the most famous Diophantine equation is the one representing Fermat s last theorem, finally proved hundreds of years after it was proposed by Andrew Wiles: If n > 2, there are no non-trivial 1 solutions in integers to the equation: x n + y n z n. There are many, many forms of Diophantine equations, but equations of the sort that we just solved are called linear Diophantine equations : all the coefficients of the variables are integers. Let s look a little more closely at the equation we just solved: x + 18y 208. If the only requirement were that the roots be integers (not necessarily non-negative integers), then our solution: x c and y c represent an infinte set of solutions, where every different integer value of c generates another solution. 1 The trivial solutions are those where x or y is zero.

4 A more geometric view of the problem is this: If we were to graph the equation x + 18y 208, the solutions are places where the graph passes through points that have integer coordinates. In Figure 1 a portion of that line is plotted, and the points where the graph has integer coordinates are indicated and labeled. (-2,2) (-1,1) (,10) (22,) (0,-) Figure 1: Graph of x + 18y 208 Notice that all the points with integer coordinates are evenly spaced along the line. In fact, if we begin at any point and add 18 to the x-coordinate and at the same time subtract from the y-coordinate, we arrive at another point on the graph with integer coordinates. A quick examination of the original equation should make it obvious why this is the case. The equation is: x + 18y 208. If we add 18 to the x value, we increase the left side by 18. If we subtract from the y value, we decrease the left side by the same amount: 18. The net effect is to leave the left side unchanged. Notice that this line has a negative slope and happens to cut through the first quadrant (quadrant I) and intersect some points with integer coordinates there. This may or may not be the case for the graphs of other linear Diophantine equations. Lines with positive slopes can have an infinite number of solutions where both are positive, and there are equations where there are none. It s easy to construct such equations with whatever characteristics you wish. Does every equation of the form: ax + by c, where a, b and c are integers have a solution (x, y), where x and y are also integers? The answer is no. For example, what if a and b are even and c is odd? The left side must be even, and if the right side is odd, there is no possibility of a solution with integer values. Similarly, if a and b are both multiples of and c is not, the left side will be a multiple of and the right side is not, so again, there are no possible integer solutions. In fact, if the greatest common divisor (GCD) of a and b does not divide c, then there are no integer solutions. The amazing thing, however, is that if the GCD of a and b also

5 divides c, then there are an infinite number of integer solutions, and we will see why that is the case later on. Note also that another observation we made about our particular problem will also apply to a general linear Diophantine equation; namely, that if (x, y) is an integer solution to: ax + by c then so will be (x + bk, y ak) where k is any integer. If we substitute x + bk for x and y ak for y, we obtain: a(x + bk) + b(y ak) c ax + abk + by abk c ax + by c, so if (x, y) is a solution, then so also is (x + bk, y ak). Reducing Fractions Now we will jump to a problem that at first glance is totally unrelated to linear Diophantine equations, but will turn out to be very similar. Let s begin with a very ugly problem: Reduce the following fraction to lowest terms: Recall that to reduce a fraction to lowest terms, you search for numbers that are common factors of the numerator and denominator and if such numbers exist, the fraction can be simplified by dividing both numerator and denominator by that common number. For example, in the fraction 8/66 both the numerator and denominator have a factor of 6, so we have: It s easy to check that the 8 and 11 in the fraction 8/11 have no other integer common factors, so 8/11 is reduced to its simplest possible form. With a computer, or with a heck of a lot of effort by hand or even with a calculator, we can search for common factors of the numerator and denominator of our original problem, but that could require a great amount of effort. In fact, you will need to test hundreds of possible factors before you arrive at the following: , and even then, a bit more work must be done to assure that 91 and 116 have no common factors. 5

6 What we would like to do is have a method to find the GCD (greatest common divisor) of the numerator and denominator, and then eliminate that from the numerator and denominator, yielding the fraction reduced to simplest form. Let s try the following approach, which, except for some slightly ugly arithmetic, should seem quite familiar: Notice that if some number does divide and then it must also divide That means that: GCD(21525, 19091) GCD(19091, 5562). Thus we have reduced the size of the numbers in our problem. We can continue in the same way: In every case, any number that divides the two leftmost numbers in the equations above must also divide the rightmost, and in the final line, we observe that must be the GCD of those numbers. Once we know that divides the numerator and denominator and in fact is the largest number to do so, we can divide the numerator and denominator of our original fraction by that number to obtain the form 91/116 as the simplest form. This method to obtain the GCD of any two numbers is known as Euclid s algorithm. Euclid s Algorithm and Diophantine Equations Now let s use the Euclidean algorithm on two of the numbers from the original Diophantine equation we solved in Section 1: x + 18y In this example, the final number is 1, so the GCD of 18 and is 1 (in other words, 18 and are relatively prime), but the interesting thing to note is that the numbers in the GCD calculation: 18,,,, 1 are the same numbers that we got as denominators and as the coefficients of the variables in the numerators in the fractions when we were solving the Diophantine equation x + 18y 208. The only oddball numbers were 6

7 the constants in the numerators, and that s not surprising: we never used the number 208 when we were using the Euclidean algorithm to find the GCD of 18 and. If you check the arithmetic calculations that are being done in each case, it will be clear why the numbers generated in both examples must be the same. Suppose that the original Diophantine equation had had a 1 instead of the 208. To make sure you understand the technique we used to solve our Diophantine equation it would be a good exercise to solve the following equation by yourself before reading on: x + 18y 1 Here s the solution (but just the equations: the textual arguments are omitted): x + 18y 1 x 1 18y a 1 y y 1 a b 1 a a 1 b c 1 b b 1 c 2y + 1 y a + 1 a b + 1 b The nice thing about the 1 in place of the 208 is that it remains constant throughout the calculation, whereas the 208 was reduced as various of the denominators divided it evenly. In this calculation, all the other coefficients are the same as the numbers generated in the straight-forward calculation of the GCD of and 18. To complete the solution, we need to back-substitute the b 1 c and after a few steps we obtain: x c and y 2 c, where c is an arbitrary integer. (Obviously this equation will have no solutions where both x and y are positive.) Thus when you do a GCD calculation of a and b, and that GCD turns out to be 1, you ve done a lot of the work toward solving the Diophantine equation ax + by 1. So if we can do the Euclidean algorithm, we can find with almost no effort other than a little arithmetic the coefficients we need to solve a linear Diophantine equation of the form ax + by 1. Of course we d like to be able to solve equations where the 1 is replaced by an arbitrary number c, but that is actually not too difficult. As as example, let s find solutions for x + 18y 208 assuming that we ve solved x + 18y 1. The solutions for the latter equation are x c and y 2 c,

8 where c is an arbitrary integer. An easy solution is simply to set c 0 and obtain x 5 and y 2 as a particular solution. But if we multiply x and y by 208, then the left side will be increased by a factor of 208 so if we increase the right side by the same factor, we ll have an (x, y) pair that satisfies our original equation x + 18y 208. Thus a solution is this: x and y It s easy to plug these numbers in to check that they are valid. But we also noticed that adding any multiple of 18 to x while at the same time adding that same multiple of to y will yield the other solutions, so the general solution to our original problem is: x k and y 16 k. If k 58, for example, this yields the solution x and y 10. We have seen that if we have any solution to one of these linear Diophantine equations, we can obtain all the others by adding constant multiples of the opposite coefficients to the given solution, all we really need is one solution. In the previous examples, once we got to the point where we had b 1 c, we backsubstituted and carefully kept track of the coefficient of c in the calculations. But since any solution will generate all the others, why not let c 0? Then we just need to track a single number. 5 Putting It All Together Let s use the techniques above, but in their most simplified form, to solve another Diophantine equation. Here s the problem: In a pet shop, rats cost 5 dollars, guppies cost dollars and crickets cost 10 cents. One hundred animals are sold, and the total receipts are 100 dollars. How many rats, guppies and crickets were sold? If r, g and c represent the number of rats, guppies and crickets, respectively, we ve got two equations (but three unknowns): r + g + c 100 5r + g +.1c 100 To turn the problem into a purely integer problem, multiply the second equation by 10: r + g + c r + 0g + c 1000 If we subtract the first equation from the second we obtain the familiar looking linear Diophantine equation in two variables: 9r + 29g 900. Luckily, the GCD for 9 and 29 is 1 which divides 900 so there will be solutions (although possibly not solutions where all the values are non-negative. (This problem is probably much easier to solve using guess and check techniques: we know that the number of crickets must be a multiple of 10, so you could just try 0, 10, 20,..., 100 of them.) 8

9 Let s find the GCD of 9 and 29, using the Euclidean algorithm: Since we ve used the variable c for the number of crickets, and g for the number of guppies, let s use variables i, j, k, et cetera for the integer values of fractions that we get as we step through the solution of the Diophantine equation. We will a particular solution to the simpler equation: 9r + 29g 1 and then multiply both r and g by 900 for a solution to the original problem. Without doing any calculations, but just reading the values obtained from the Euclidean algorithm used to calculate the GCD of 9 and 29 and the variables i, j, k and l as the integer values of fractions, we can just write down the relationships among them (expressed both ways). For the purposes of finding a solution to the equation, only the expressions on the right are important. Note how the numbers in the fractions (other than the 1, of course) are exactly the same as the numbers on the left in the execution of the Euclidean algorithm to find the GCD of 9 and 29 above. r 1 29g 9 i 1 20r 29 j 1 9i 20 k 1 2j 9 l 1 k 2 g 1 9r 29 r 1 29i 20 i 1 20j 9 j 1 9k 2 k 1 2l From the last line, clearly k 2l for arbitrary integers l, so just set l 0 to obtain a particular solution. If l 0, then k 1. If k 1 then j. If j, then i 9. If i 9 then r 1. And if r 1, then g 22. It s easy to check our work; namely, that r 1 and g 22 is a solution to: 9r + 29g 1. To obtain a particular solution to the original equation, multiply by 900: r 1100 and g From previous considerations, we know that the general solution to 9

10 the original equation will be: r g k k We re looking for non-negative values of r and g, so divide 29 into 1100 and we find that if k 0 we obtain the values r 16 and g. If k 0 or k 05, either r or g is negative. Since there are 100 total animals, c 80, and it s easy to check that r 16, g and c 80 solves the problem. 10

Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

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

Homework 5 Solutions

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

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

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

CHAPTER 3 Numbers and Numeral Systems

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

2 The Euclidean algorithm

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

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

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

Solving Systems of Two Equations Algebraically

8 MODULE 3. EQUATIONS 3b Solving Systems of Two Equations Algebraically Solving Systems by Substitution In this section we introduce an algebraic technique for solving systems of two equations in two unknowns

Section 1.1 Linear Equations: Slope and Equations of Lines

Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of

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.

Foundations for Middle School 6 th Grade Syllabus

Unit 1:, and Percents (Lessons 0 19) and Percents (Lessons 0 19) Foundations for Middle School 6 th Grade Syllabus Solving for every variable Foundations for Middle School 6 th Grade Syllabus 1 Unit 1:

Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

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

Further linear algebra. Chapter I. Integers.

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

Mathematics of Cryptography

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

MTH 382 Number Theory Spring 2003 Practice Problems for the Final

MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend -95,

Chapter 2. Linear Equations

Chapter 2. Linear Equations We ll start our study of linear algebra with linear equations. Lots of parts of mathematics arose first out of trying to understand the solutions of different types of equations.

3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

Vieta 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

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

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

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

A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after.

Fibonacci Problem: A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after. Question: How many rabbits will the farmer have after n months? Try it on small numbers.

8.1 Systems of Linear Equations: Gaussian Elimination

Chapter 8 Systems of Equations 8. Systems of Linear Equations: Gaussian Elimination Up until now, when we concerned ourselves with solving different types of equations there was only one equation to solve

0.7 Quadratic Equations 8 0.7 Quadratic Equations In Section 0..1, we reviewed how to solve basic non-linear equations by factoring. The astute reader should have noticed that all of the equations in that

Topics in Number Theory

Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall

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

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

(Refer Slide Time: 00:00:56 min)

Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology, Delhi Lecture No # 3 Solution of Nonlinear Algebraic Equations (Continued) (Refer Slide

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

Equations and Inequalities

Rational Equations Overview of Objectives, students should be able to: 1. Solve rational equations with variables in the denominators.. Recognize identities, conditional equations, and inconsistent equations.

Kenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract

Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.

Generating Functions

Generating Functions If you take f(x =/( x x 2 and expand it as a power series by long division, say, then you get f(x =/( x x 2 =+x+2x 2 +x +5x 4 +8x 5 +x 6 +. It certainly seems as though the coefficient

It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

Basic Math Refresher A tutorial and assessment of basic math skills for students in PUBP704.

Basic Math Refresher A tutorial and assessment of basic math skills for students in PUBP704. The purpose of this Basic Math Refresher is to review basic math concepts so that students enrolled in PUBP704:

Chapter 11 Number Theory

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

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

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

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

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5 Modular Arithmetic One way to think of modular arithmetic is that it limits numbers to a predefined range {0,1,...,N

An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

MINI LESSON. Lesson 5b Solving Quadratic Equations

MINI LESSON Lesson 5b Solving Quadratic Equations Lesson Objectives By the end of this lesson, you should be able to: 1. Determine the number and type of solutions to a QUADRATIC EQUATION by graphing 2.

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 =

Introduction to Modular Arithmetic, the rings Z 6 and Z 7

Introduction to Modular Arithmetic, the rings Z 6 and Z 7 The main objective of this discussion is to learn modular arithmetic. We do this by building two systems using modular arithmetic and then by solving

Zeros 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

STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS

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

Systems of Linear Equations in Two Variables

Chapter 6 Systems of Linear Equations in Two Variables Up to this point, when solving equations, we have always solved one equation for an answer. However, in the previous chapter, we saw that the equation

Practice Math Placement Exam

Practice Math Placement Exam The following are problems like those on the Mansfield University Math Placement Exam. You must pass this test or take MA 0090 before taking any mathematics courses. 1. What

Continued fractions and good approximations.

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

More Zeroes of Polynomials. Elementary Functions. The Rational Root Test. The Rational Root Test

More Zeroes of Polynomials In this lecture we look more carefully at zeroes of polynomials. (Recall: a zero of a polynomial is sometimes called a root.) Our goal in the next few presentations is to set

Name: Date: Algebra 2/ Trig Apps: Simplifying Square Root Radicals. Arithmetic perfect squares: 1, 4, 9,,,,,,...

RADICALS PACKET Algebra 2/ Trig Apps: Simplifying Square Root Radicals Perfect Squares Perfect squares are the result of any integer times itself. Arithmetic perfect squares: 1, 4, 9,,,,,,... Algebraic

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

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

SUPPLEMENT TO CHAPTER

SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved

3. Polynomials. 3.1 Parabola primer

3. Polynomials 3.1 Parabola primer A parabola is the graph of a quadratic (degree 2) polynomial, that is, a parabola is polynomial of the form: standard form: y = ax 2 + bx + c. When we are given a polynomial

Solution Guide Chapter 14 Mixing Fractions, Decimals, and Percents Together

Solution Guide Chapter 4 Mixing Fractions, Decimals, and Percents Together Doing the Math from p. 80 2. 0.72 9 =? 0.08 To change it to decimal, we can tip it over and divide: 9 0.72 To make 0.72 into a

Domain Essential Question Common Core Standards Resources

Middle School Math 2016-2017 Domain Essential Question Common Core Standards First Ratios and Proportional Relationships How can you use mathematics to describe change and model real world solutions? How

Prime Numbers. Chapter Primes and Composites

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

SAT Math Facts & Formulas Review Quiz

Test your knowledge of SAT math facts, formulas, and vocabulary with the following quiz. Some questions are more challenging, just like a few of the questions that you ll encounter on the SAT; these questions

Number of Solutions to Simultaneous Equations

Worksheet 3.5 Simultaneous Equations Section 1 Number of Solutions to Simultaneous Equations In maths we are sometimes confronted with two equations in two variables and we want to find out which values

Systems of Linear Equations

DETAILED SOLUTIONS AND CONCEPTS - SYSTEMS OF LINEAR EQUATIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

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

Introduction to Finite Systems: Z 6 and Z 7

Introduction to : Z 6 and Z 7 The main objective of this discussion is to learn more about solving linear and quadratic equations. The reader is no doubt familiar with techniques for solving these equations

Mathematics of Cryptography Part I

CHAPTER 2 Mathematics of Cryptography Part I (Solution to Odd-Numbered Problems) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinity to positive infinity.

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

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

MA 134 Lecture Notes August 20, 2012 Introduction The purpose of this lecture is to... Introduction The purpose of this lecture is to... Learn about different types of equations Introduction The purpose

Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

Section 7 Algebraic Manipulations and Solving Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving Before launching into the mathematics, let s take a moment to talk about the words

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,

1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

CLASS NOTES. We bring down (copy) the leading coefficient below the line in the same column.

SYNTHETIC DIVISION CLASS NOTES When factoring or evaluating polynomials we often find that it is convenient to divide a polynomial by a linear (first degree) binomial of the form x k where k is a real

3.3. Parabola and parallel lines

3.3. Parabola and parallel lines This example is similar in spirit to the last, except this time the parabola is held fixed and a line of slope is moved parallel to itself. The objective is to see how

Task Model 3 Equation/Numeric DOK Level 1 algebraically, example, have no solution because 6. 3. The student estimates solutions by graphing systems of two linear equations in two variables. Prompt Features:

Section P.9 Notes Page 1 P.9 Linear Inequalities and Absolute Value Inequalities

Section P.9 Notes Page P.9 Linear Inequalities and Absolute Value Inequalities Sometimes the answer to certain math problems is not just a single answer. Sometimes a range of answers might be the answer.

Practice Problems for First Test

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

Sect Solving Systems of Equations by Addition (Elimination)

Sect 4.3 - Solving Systems of Equations by Addition (Elimination) Concept # Solving System of Linear Equations in Two Variables by Addition (Elimination). A variant of the Addition Property of Equality

Elements of a graph. Click on the links below to jump directly to the relevant section

Click on the links below to jump directly to the relevant section Elements of a graph Linear equations and their graphs What is slope? Slope and y-intercept in the equation of a line Comparing lines on

Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS

CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence

9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation

2.1 Algebraic Expressions and Combining like Terms

2.1 Algebraic Expressions and Combining like Terms Evaluate the following algebraic expressions for the given values of the variables. 3 3 3 Simplify the following algebraic expressions by combining like

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

9 abcd = dcba. 9 ( b + 10c) = c + 10b b + 90c = c + 10b b = 10c.

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

supplement for UND s Math 107 precalculus course

Systems of Equations supplement for UND s Math 107 precalculus course by Dave Morstad Introduction A system of equations is any group of equations. A solution to a system of equations is a solution that

2015 Junior Certificate Higher Level Official Sample Paper 1

2015 Junior Certificate Higher Level Official Sample Paper 1 Question 1 (Suggested maximum time: 5 minutes) The sets U, P, Q, and R are shown in the Venn diagram below. (a) Use the Venn diagram to list

A fairly quick tempo of solutions discussions can be kept during the arithmetic problems.

Distributivity and related number tricks Notes: No calculators are to be used Each group of exercises is preceded by a short discussion of the concepts involved and one or two examples to be worked out

Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

1 Determine whether an. 2 Solve systems of linear. 3 Solve systems of linear. 4 Solve systems of linear. 5 Select the most efficient

Section 3.1 Systems of Linear Equations in Two Variables 163 SECTION 3.1 SYSTEMS OF LINEAR EQUATIONS IN TWO VARIABLES Objectives 1 Determine whether an ordered pair is a solution of a system of linear

3.2 The Factor Theorem and The Remainder Theorem

3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial

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

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

Problem of the Month: Calculating Palindromes

Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:

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

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

Chapter 4 Fractions and Mixed Numbers

Chapter 4 Fractions and Mixed Numbers 4.1 Introduction to Fractions and Mixed Numbers Parts of a Fraction Whole numbers are used to count whole things. To refer to a part of a whole, fractions are used.

The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

5.1 The Remainder and Factor Theorems; Synthetic Division

5.1 The Remainder and Factor Theorems; Synthetic Division In this section you will learn to: understand the definition of a zero of a polynomial function use long and synthetic division to divide polynomials

1 Die hard, once and for all

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.

Lecture 1: Elementary Number Theory

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