Quiz 07a. Integers Modulo 12

Similar documents
Section 20: Arrow Diagrams on the Integers

Knots, Coloring and Applications

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?

Math 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

STEP Support Programme. Hints and Partial Solutions for Assignment 17

Math 138: Introduction to solving systems of equations with matrices. The Concept of Balance for Systems of Equations

CS1800: Sequences & Sums. Professor Kevin Gold

Commutative Rings and Fields

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

Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore

Math 016 Lessons Wimayra LUY

MA 3260 Lecture 10 - Boolean Algebras (cont.) Friday, October 19, 2018.

#26: Number Theory, Part I: Divisibility

Polynomial and Synthetic Division

O.K. But what if the chicken didn t have access to a teleporter.

Math Lecture 4 Limit Laws

INTERSECTION THEORY CLASS 1

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.

Sums of Squares (FNS 195-S) Fall 2014

Take the Anxiety Out of Word Problems

Quadratic Equations Part I

Section 1.x: The Variety of Asymptotic Experiences

Math Lecture 3 Notes

Module 3 Study Guide. GCF Method: Notice that a polynomial like 2x 2 8 xy+9 y 2 can't be factored by this method.

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

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Algebra Exam. Solutions and Grading Guide

Algebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

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?

Algorithms: Review from last time

Roberto s Notes on Linear Algebra Chapter 4: Matrix Algebra Section 7. Inverse matrices

What is proof? Lesson 1

32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE

Number theory (Chapter 4)

MA 3280 Lecture 05 - Generalized Echelon Form and Free Variables. Friday, January 31, 2014.

Vector Basics, with Exercises

CISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata

Lecture 4. Algebra. Section 1:. Signature, algebra in a signature. Isomorphisms, homomorphisms, congruences and quotient algebras.

In this unit we will study exponents, mathematical operations on polynomials, and factoring.

Physics Motion Math. (Read objectives on screen.)

Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5

Lecture for Week 2 (Secs. 1.3 and ) Functions and Limits

Generell Topologi. Richard Williamson. May 28, 2013

MA 1125 Lecture 15 - The Standard Normal Distribution. Friday, October 6, Objectives: Introduce the standard normal distribution and table.

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?

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

One-to-one functions and onto functions

Lecture 4: Constructing the Integers, Rationals and Reals

irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways:

6.080 / Great Ideas in Theoretical Computer Science Spring 2008

You separate binary numbers into columns in a similar fashion. 2 5 = 32

Solving Quadratic & Higher Degree Equations

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

Chapter 1 Review of Equations and Inequalities

If we square the square root of something (that s not negative), we get the something : ( 34) ( ) 34

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

Squaring and Unsquaring

Let s Do Algebra Tiles

base 2 4 The EXPONENT tells you how many times to write the base as a factor. Evaluate the following expressions in standard notation.

Error Correcting Codes Prof. Dr. P Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore

An Intuitive Introduction to Motivic Homotopy Theory Vladimir Voevodsky

5 + 9(10) + 3(100) + 0(1000) + 2(10000) =

MIT BLOSSOMS INITIATIVE

Introduction to Vector Spaces Linear Algebra, Fall 2008

To factor an expression means to write it as a product of factors instead of a sum of terms. The expression 3x

QUADRATICS 3.2 Breaking Symmetry: Factoring

Conway s Rational Tangles

1. Introduction to commutative rings and fields

Lecture 2: Change of Basis

Polynomial Division. You may also see this kind of problem written like this: Perform the division x2 +2x 3

6.4 Division of Polynomials. (Long Division and Synthetic Division)

MEI Core 1. Basic Algebra. Section 1: Basic algebraic manipulation and solving simple equations. Manipulating algebraic expressions

Lecture 3: Latin Squares and Groups

Physics 8 Monday, September 12, 2011

1.1.1 Algebraic Operations

Math 3 Variable Manipulation Part 3 Polynomials A

What if the characteristic equation has complex roots?

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7

Generating Function Notes , Fall 2005, Prof. Peter Shor

Section 4.3. Polynomial Division; The Remainder Theorem and the Factor Theorem

POLYNOMIAL EXPRESSIONS PART 1

An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Science, Chennai. Unit - I Polynomials Lecture 1B Long Division

MITOCW watch?v=rf5sefhttwo

Just DOS Difference of Perfect Squares. Now the directions say solve or find the real number solutions :

3.4 Complex Zeros and the Fundamental Theorem of Algebra

( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of

1 Introduction. 2 Solving Linear Equations. Charlotte Teacher Institute, Modular Arithmetic

NP-Completeness I. Lecture Overview Introduction: Reduction and Expressiveness

CIS 2033 Lecture 5, Fall

CHMC: Finite Fields 9/23/17

Section 29: What s an Inverse?

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

Chapter Five Notes N P U2C5

Unit 2: Polynomials Guided Notes

2. Two binary operations (addition, denoted + and multiplication, denoted

After that, we will introduce more ideas from Chapter 5: Number Theory. Your quiz in recitation tomorrow will involve writing proofs like those.

2. Introduction to commutative rings (continued)

Transcription:

MA 3260 Lecture 07 - Binary Operations Friday, September 28, 2018. Objectives: Continue with binary operations. Quiz 07a We have a machine that is set to run for x hours, turn itself off for 3 hours, and then restart. Starting at 10 o clock this process is repeated 7 times, and at the end of the last 3-hour rest period, it is 5 o clock. What integers can x be? In other words, (1) 10 o clock + 7(x + 3) = 5 o clock. Find all integer solutions for x. There are more interesting applications of what I m about to propose, but at least we ll have something to talk about. Integers Modulo 12 Let s solve this equation on the clock. By this, I mean that we only work with the hours on the clock, the numbers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and instead of 12, I ll go back to 0. So we re saying now that 13 = 1, 14 = 2, etc. I sometimes say that mathematics is the systematic exploitation of ambiguity, and that s what we re doing here. For example, 1 2 and 3 6 are different things, but thinking of them as being the same makes fractions more useful. Integers modulo 12. Mathematically, clock arithmetic is doing algebra in Z 12, the integers modulo 12. The numbers in Z 12 are the integers, except they re all replaced by the remainder we get after dividing by 12. For example, 39 = 3 12 + 3, so in Z 12, 39 = 3. Since the remainders are less than 12, Z 12 has 12 elements (2) Z 12 = { 0, 1, 2, 3, 4,5,6, 7, 8,9,10,11 }. We ll have addition and multiplication that kind of looks like regular addition and multiplication, but only with these 12 elements. For example, (3) 6 + 9 = 15 = 3, so 6 + 9 = 3 in Z 12. Multiplication works the same way (4) 3 7 = 21 = 9. Before going further, let s solve our equation in Z 12, (5) 10 + 7(x + 3) = 5. Subtract 10 from both sides to get (6) 7(x + 3) = 7. We ll have to be careful about the next step, divide both sides by 7, but in this case it s OK, (7) x + 3 = 7 7 = 1. Finally, subtract 3 from both sides. (8) x = 10. Going back to the regular integers, x = 10, 22, 34, 46,58,.... If we don t mind negative time periods, we also have 2, 14,.... 1

MA 3260 Lecture 07 - Binary Operations 2 (9) 0 1 2 3 4 5 6 7 8 9 10 11 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 2 3 4 5 6 7 8 9 10 11 2 0 2 4 6 8 10 0 2 4 6 8 10 3 0 3 6 9 0 3 6 9 0 3 6 9 4 0 4 8 0 4 8 0 4 8 0 4 8 5 0 5 10 3 8 1 6 11 4 9 2 7 6 0 6 0 6 0 6 0 6 0 6 0 6 7 0 7 2 9 4 11 6 1 8 3 10 5 8 0 8 4 0 8 4 0 8 4 0 8 4 9 0 9 6 3 0 9 6 3 0 9 6 3 10 0 10 8 6 4 2 0 10 8 6 4 2 11 0 11 10 9 8 7 6 5 4 3 2 1 (10) + 0 1 2 3 4 5 6 7 8 9 10 11 0 0 1 2 3 4 5 6 7 8 9 10 11 1 1 2 3 4 5 6 7 8 9 10 11 0 2 2 3 4 5 6 7 8 9 10 11 0 1 3 3 4 5 6 7 8 9 10 11 0 1 2 4 4 5 6 7 8 9 10 11 0 1 2 3 5 5 6 7 8 9 10 11 0 1 2 3 4 6 6 7 8 9 10 11 0 1 2 3 4 5 7 7 8 9 10 11 0 1 2 3 4 5 6 8 8 9 10 11 0 1 2 3 4 5 6 7 9 9 10 11 0 1 2 3 4 5 6 7 8 10 10 11 0 1 2 3 4 5 6 7 8 9 11 11 0 1 2 3 4 5 6 7 8 9 10 Subtraction We take subtraction for granted. If we want to understand it better, it s useful to try to look at subtraction in an unfamiliar setting. You would study such things in modern algebra (a.k.a. abstract algebra). One way of interpreting subtraction is as follows. If we want to know what 7 5 is, we might give the answer a name, like x, and consider the equation (11) 7 5 = x. We could then define the subtraction as (12) 7 = x + 5, and ask what number plus 5 is equal to 7? In this case, x = 2. An alternative interpretation would make subtracting 5 equivalent to adding a negative 5. So (13) 7 5 = 7 + ( 5). In Z 12, 5 = 7, so adding 5 is the same as adding 7, so (14) 7 5 = 7 + ( 5) = 7 + 7 = 14. There are two basic properties at work here. We need that 5 + ( 5) = 0, and x + 0 = x. The property that adding zero does essentially nothing is generally said by mathematicians as zero is an additive identity. If two elements add together to equal an additive identity, we say that they re additive inverses.

MA 3260 Lecture 07 - Binary Operations 3 But of course. With subtraction in Z 12, we can also just do the subtraction as regular integers, and then convert to an element of Z 12, like (15) 4 9 = 5 = 7. Division Division is to multiplication as subtraction is to addition. In multiplication, 1 is a multiplicative identity, since we have (16) x 1 = x in both Z 12 and multiplication with regular numbers. In the real numbers, R, we have multiplicative inverses like 1 3 3 = 1. In Z 12 we only have (17) 1 1 = 1, 5 5 = 1, 7 7 = 1, and 11 11 = 1. In other words, in Z 12, 1, 5, 7, and 11 are their own multiplicative inverses. Dividing by these elements of Z 12 is straightforward. For example, (18) 8 7 = 8 7 = 8. We can also interpret the division as What times 7 equals 8? In other words, we want to figure out (19) 8 7 = x, and think of this as (20) 8 = x 7. Looking at the multiplication table, we find 8 in the times 7 column, and see that 8 7 = 8. Binary Operations Given a set A, a binary operation is a function from the ordered pairs of elements from A back to A. In particular, a binary operation takes any two elements from A, say a, b A, and associates the pair with a unique element a b A. In function notation, we might write f(a, b) = a b, although we ll just recognize that a b is the sum, product, etc. of a and b. ordered pairs. Be aware that a binary operation will distinguish between a b and b a. These will often be equal, but this is not always the case. every ordered pair. A binary operation must assign a value in the set to every ordered pair. For example, normal division on the integers is not a binary operation, since some pairs, like 5 3, don t have values in Z. On the other hand, division on the positive reals is a binary operation. a unique element. Just so things make sense, we would like to be able to use a b as the name of an element. In particular, we don t want an operation to have multiple results. It s hard to mess this up, since all of our normal terminology takes care to avoid ambiguous results. A contrived example might be something like a b = ± a 2 b 2 defined on the reals. Integers Modulo n In clock arithmetic, we were dealing with the set of integers modulo 12. We can do the same thing with any positive integer n to define Z n. Z 2. In Z 2, we re dealing with the remainders after dividing by 2, so Z 2 = {0, 1 }. The binary operations + and on Z 2 basically correspond to what we know about adding and multiplying odd and even numbers. For example, 1 + 1 = 0 corresponds to saying odd plus odd is even.

MA 3260 Lecture 07 - Binary Operations 4 Divisors of zero. The study of binary operations lies mainly in the field of modern algebra or abstract algebra, and in its purest form, algebra seeks to understand the significance of the various properties that binary operations might have. You have probably heard of things like the commutative property or the distributive property. Here s another that you probably haven t seen before. In normal high school algebra, you could solve a quadratic equation as follows. Given (21) x 2 2x 3 = 0, you could factor the expression on the left side to get (22) (x 3)(x + 1) = 0, and then conclude that (23) x = 3, 1. Being able to do this depends on the fact that if (x 3)(x + 1) = 0, then we must have either x 3 = 0 or x + 1 = 0. It follows that x = 3 or x = 1. The basic property we re using is that in the real numbers, if ab = 0, then either a = 0 or b = 0. So what if we don t have that property? We can understand that a little better, if we had a binary operation that didn t. In Z 12 we don t. For example, 2 6 = 0 and 3 4 = 0. In this case, 2, 6, 3, and 4 are divisors of zero. Let s try to solve the quadratic equation that looks the same as the one above in Z 12. In other words, solve (24) x 2 2x 3 = 0. We could factor this as (25) (x 3)(x + 1) = 0. Is that right? Try multiplying it out. Are x = 3 and x = 1 solutions? Yes. OK so far. We still have that 0 a = 0 in Z 12. Something different, however, is that 2 6 = 0. Note that if x = 5, then we have (26) ((5) 3)((5) + 1) = 2 6 = 0, and x = 5 is also a solution. Quiz 07b 1. Are there any other solutions? I got x = 3, 5, 9, 11. 2. Is the factoring step valid? Certainly (x 3)(x + 1) = x 2 2x 3. Try multiplying out a. (x 5)(x 9) b. (x 3)(x 11) c. (x + 7)(x + 3) 3. Can you figure out which Z n s have (non-zero) divisors of zero, and which do not?

MA 3260 Lecture 07 - Binary Operations 5 Other binary operations Playing with weird binary operations helps us understand the normal ones better. As an application, we would generally prefer a symbolic calculation than to work with the things they represent. Like if George puts 52 cows in a corral, Sarah puts 37, and Zoe takes 5 out. How many cows in the corral? Symbolically that s easy, 52 + 37 5 = 84. Going out into the corral and counting is harder. I m going to take a while on this next example, because I think everyone should see it. Knots and the Conway Polynomial Topology is the study of continuously deformable objects. If you can bend and stretch one object so that it ends up looking like another (following certain rules), then we might say that those two objects are topologically equivalent. One area within topology is called knot theory. Roughly, a knot is like a piece of rope sitting in space with the ends attached. A knot can also be multiple loops of rope, which we ll call links.

MA 3260 Lecture 07 - Binary Operations 6 In the picture below, we have diagrams for three knots. The first is completely unknoted, and it has an appropriate name, the unknot. The second knot is basically two unknots linked together. It s called a simple link. The third knot is called a trefoil. unknot simple link trefoil If we can deform a knot by bending, stretching, or twisting (but not breaking) so that it looks like another, then those two knots are the same knot. In the picture below (ignoring the arrows for now), we can deform one into the unknot, one into a simple link, and the middle one is a new knot. unknot figure-eight knot simple link Why knots? Knot theory has been an important area of recent research, I think, because they have been found to code the same information as the possible shapes of our universe, but in a form more palatable to our brains. Also, the ideas used to study knots can extend to other situations, where curves cross. For example, the way DNA tangles affects how it behaves, and it displays knot theory like structures. Just off the top of my head, I would think that having a computer pick roads out of an aerial photograph and choosing routes (as in Google Maps) might be a knot theory type problem. Mostly, I just think that it s cool to see how out-of-the-box mathematicians can be. We ll finish for today with a question that will frame what we re going to do. Is it possible for two knots to cancel each other out?

MA 3260 Lecture 07 - Binary Operations 7 Let me explain a little more. I m going to define a binary operation on knots called the connect sum. Basically, we re going to take two knots, cut each knot without disturbing the crossings, and then join them together by the loose ends to form a new knot. For example, the picture below shows the connect sum of two trefoils. Homework 07 1. Do the following division problems in Z 12 using the multiplication table. You might have more than one possible answer, give all of them. You also might not have any, just say DNE (does not exist) for these. a. 7 5. b. 3 6. c. 8 10. d. 5 2. e. 2 5. 2. If we re trying to solve an equation like 4x = 6, we can t just divide by 4, because 4 does not have a multiplicative inverse. We have to, like some of the problems in Problem 1, just look at the table, and see which elements of Z 12 satisfy 4 times x equals 6. Looking at the table, we see there are no solutions. For the following, find all solutions, if any. a. 5x = 9. b. 3x = 0. c. 4x = 8. d. 11x = 4. e. 9x = 3. 3. Since every element in Z 12 has an additive inverse, subtracting an element from both sides of an equation is fine. Solve the following by subtracting something from both sides of the equation, and then proceeding as in Problem 2. a. 3x + 7 = 11. b. 6x + 4 = 0. c. 2x + 10 = 8. d. 11x + 5 = 7. e. 4x + 3 = 5.

MA 3260 Lecture 07 - Binary Operations 8 OK. So the question becomes: Can the connect sum of two knots be equivalent to the unknot? 4. Clearly, there are two knots that can be connect summed and give you the unknot. What are the two knots (they can be the same two knots)? 5. Is it clear that two mirror-image trefoils can or can t untie each other? 6. Do you think it s possible for two knots to untie each other? Answers on next page.

MA 3260 Lecture 07 - Binary Operations 9 1) Should look very similar to 4. 1a) 11. b) DNE. c) 2 and 8. d) DNE. e) 10. 2a) x = 9. b) x = 0, 4, 8. c) x = 2, 5, 8, 11. d) x = 8. e) x = 3, 7, 11. 3a) 3x = 4. No solutions. b) 6x = 8. No solutions. c) 2x = 10. x = 5, 11. d) 11x = 2. x = 10. e) 4x = 2. No solutions. 4) Two unknots. That s the boring answer. Are there any interesting ones? 5) I don t know if it s clear or not, but it doesn t seem like they can untie each other. 6) Knots untie on me all the time when I m trying hold something down, but extension cords and garden hoses get hopelessly tangled. It s really hard to say.