diffy boxes (iterations of the ducci four number game) 1

Save this PDF as:

Size: px
Start display at page:

Transcription

1 diffy boxes (iterations of the ducci four number game) 1 Peter Trapa September 27, 2006 Begin at the beginning and go on till you come to the end: then stop. Lewis Carroll Consider the following game. Draw a square and label each of the corners with some whole number. At the midpoint of each square write the (positive) difference between the numbers at the corresponding vertices. Then draw a new square though the midpoints and repeat the process. For instance, consider the starting square Then write in the positive differences at the midpoints and draw a new square: And then we repeat the process: A good reference for this material is the article The Convergence of Difference Boxes, by A. Behn, C. Kribs-Zaleta, and V. Ponomarenko, American Math. Monthly, volume 112 (1995), pp Much of the notation and terminology I use is borrowed from that paper. An exhaustive list of references can be found at kribs/diffy.html. 1

2 The remarkable observation is that we ended up at the square with all vertices labeled 0. Was that just luck? Was my choice of original square chosen in a special way so that we ended up with the zero box? What if we allow the starting numbers to be any real numbers (not just integers)? Does this change things? Given an integer k, can we find a starting box that reaches the zero box after exactly k steps? What about playing the game on pentagons? Hexagons? Cubes? These are the main questions that we want to address over the next two weeks. Before turning to some exercises, some notation is useful. Start with a diffy box and choose any corner of it. Beginning with that corner read off the numbers at the other corners moving in a clockwise fashion. This gives a list of 4 numbers, say a,b,c, and d. Then we label the diffy box [a b c d]. For instance if we start with the box and choose the vertex 5, then we label the box [ ]. The label attached to a box is not well-defined in the following sense: if we started with the vertex 2, then we would label the box [ ]. But this ambiguity is harmless in practice. As an example of this notation, look at our original example. Then we can describe the sequence of diffy boxes in our new notation as [ ] [ ] [ ] [ ] [ ] [ ]. As a matter of terminology, we say that the original box [ ] has longevity 5 (since it takes five moves to reach the zero box). 2

3 3 exercises i: first examples 1. Compute the longevity of the following diffy boxes: (a) [ ] (b) [ ] (c) [ ] (d) [ ] (e) [ ] (f) [ ] (g) [ ] (h) [ ] (i) [ ] (j) [ ]

4 4 exercises ii: true or false 2. Determine if the following statements are true or false. Be sure to justify your reasoning! (a) The longevity of [a b c d] equals the longevity of [b c d a]. (b) The longevity of [a b c d] equals the longevity of [c b d a]. (c) The longevity of [a b c d] equals the longevity of [b a d c]. (d) The longevity of [a b c d] equals the longevity of [ a b c d]. (e) The longevity of [a b c d] equals the longevity of [ar br cr cr] for any real number r. (f) There are integers a < b < c < d so that the longevity of [a b c d] is 4.

5 5 exercises iii: diffy polygons 1. We could play the same game with triangles instead of boxes. In this case, we adopt the following notation: [a b c] labels a triangle whose vertices (read in clockwise fashion) are a, b, and c. We may define the longevity of a diffy triangle just as above. For instance, the diffy box [0 1 1] has infinite longevity since we can compute: [0 1 1] [1 0 1] [1 1 0] [0 1 1] [1 0 1] [1 1 0] [0 1 1]. On the other hand, any diffy triangle of the form [a a a] has longevity 1: [a a a] [0 0 0]. Find a diffy triangle not of the form [a a a] which has finite longevity. 2. Repeat Exercise (1) for a pentagon instead of a triangle.

6 6 Our next aim is to prove the following theorem: Theorem. If a,b,c and d are integers, then the diffy box [a b c d] has finite longevity. The key tool in the proof of the theorem is a notion of the size of a diffy box: Definition. Given a diffy box [a b c d], define the size of [a b c d], denoted [a b c d] to be the largest difference among (not necessarily adjacent) pairs of vertices. For example, [ ] = 25 since 22 ( 3) = 25 is the largest difference among 3, 7, 8, 22. As as example, we compute the sizes of the various boxes in the first example considered above. As before, may write that sequence of boxes as [ ] [ ] [ ] [ ] [ ] [ ]. The corresponding sizes are easy to write down, The key observation is that the sizes in this sequence never increase. In fact, they strictly decreases until we reached the last two terms (where the sizes were both zero). Here is the general result we need: Lemma. Given a pair of diffy boxes B 1 B 2, then B 1 B 2. If no two adjacent corners of B 1 have the same value, then B 1 > B 2. Proof. Let a < b < c < d denote the four entries of B 1 arranged in increasing order. Then B 1 = d a. Meanwhile the four entries of B 2 are all between 0 and d a. So the size of B 2 is at most d a. This shows that B 1 B 2. When can B 1 = B 2? That is, when does B 2 = d a? Since all entries of B 2 are between 0 and d a, B 2 = d a only if the entries 0 and d a are adjacent in B 2. But if 0 appears in B 2, then two adjacent vertices of B 1 must have the same value. This proves the second assertion of the lemma. Now we can return to the theorem above and try to prove it. We start with any diffy box, say B 1, and start performing our difference operation to get a sequence B 1 B 2 B 3... At each step the size is shrinking: B 1 B 2 B 3. Let k denote the smallest integer such that B k = B k+1 (instead of B k > B k+1 ). Such a k always exists. (Why?!) If B k = 0, then all entries of B k are the same, B k+1 is the zero box, and the longevity of B 1 is k. On the other hand, suppose that B k 0. Then it looks like our argument might be stuck. To finish it we need to know one final exercise (included on the next page): any diffy box of the form [a a x y] has finite longevity.

7 7 exercises iv: finishing the proof. Suppose B = [a a x y]. Show that the longevity l(b) is less than or equal to 6. (This exercise completes the proof of the theorem.)

8 8 The previous theorem handles that case of integer diffy boxes. (Where in the proof did we use the hypothesis that all numbers involved were integers?) So that leads us to ask about noninteger diffy boxes. Consider the following table (whose first two entries you computed in the exercises above): B l(b) [ ] 9 [ ] 13 [ ] 16 [ ] 22 [ ] 30 At this point, the diffy boxes in the first column are really just pulled out of a hat. Our goal in the remainder of the notes is to understand a little bit about how they were pulled out of the hat. But before turning to that, it is impossible to resist mentioning a few more words about the numbers appearing above. The fourth entries in the diffy boxes in the above table are approaching a particular number q where q = is the unique (positive) real solution to (1) x 3 x 2 x 1 = 0. Meanwhile the third entries in the diffy boxes in the above table are approaching q(q 1), q(q 1) A nice coincidence 2 emerges here. Consider the Tribonnaci Sequence (which is a kind of generalization of the Fibonnaci Sequence), 1,1,1,3,5,9,17, 31,57,... ; here the next term is obtained by adding the three previous terms together (and the first three terms are defined to be 1). Let T n denote the nth term of this sequence. So T 4 = 3 and T 8 = 31, for instance. Then there is a remarkable closed formula for the nth term, (q T n = nearest integer to 3 )n ( ) Explaining how one might arrive at a formula like this is another mystery for another day! The bizarre thing to note is the appearance of q here. At any rate, let me simply add a final line to the table above: B l(b) [0 1 (q 1)q q] Since many of you are familiar with the famous Fibonnaci sequence, let me take a moment to recall the analogous features of it. The first few terms of the Fibonnaci sequence are 2 Or maybe not a coincidence? 1,1,2,3,5,8,12, 20,32,... ;

9 here the next term is obtained by adding together the previous two (and the first two terms are defined to be 1). If we let F n denote the nth term of the Fibonnaci sequence, then we also have a remarkable formula φ n F n = nearest integer to, 5 where φ denote the Golden Mean, i.e. the unique positive real solution to x 2 x 1 = 0. (Compare with Equation (1)). So, indeed, the magic number q bears the same importance for the Tribonnaci Sequence as the Golden Mean does for the Fibonnaci Sequence. Pretty neat, huh? 9 But let s get back to diffy boxes. We want to have a way to visualize the longevity calculations that we have been making. In the second set of exercises above, we discovered a bunch of operations on diffy boxes that do not affect longevity. We can summarize those longevity-preserving operations as follows: (a) translation: l([a b c d]) = l([a+r b+r c+r d+r]) for any real number r. (b) negation: l([a b c d]) = l([ a b c d]). (c) scaling: l([a b c d]) = l([ra rb rc rd]) for and real number r. (So (b) is really a special case of (c).) (d) rotation: l([a b c d]) = l([b c d a]). (e) reflection: l([a b c d]) = l([b a d c]). Using these operations, we now describe an algorithm to bring any diffy box into a standard form. First we define what we mean by standard form. Definition. A diffy box is in standard form if it is of the following three forms: [ ]; [ ]; or [0 1 x y] with x 0, y 1, and x 1 y x + 1. In pictures, the diffy box [0 1 x y] is in standard form if (and only if) the point (x,y) lies in the following region, y x

10 10 Here is the algorithm to take any diffy box [a b c d] and bring it into standard form using only the longevity preserving operations (a) (e) described above:. Step 1. Rotate (operation (d)) the box to obtain a new box [a 1 b 1 c 1 d 1 ] so that the new box has d 1 a 1 maximal among all adjacent difference b 1 a 1, c 1 b 1, d 1 c 1, and d 1 a 1.. Step 2. Observe that either a 1 or d 1 is extreme in the sense that either a 1 or d 1 is the largest entry in the diffy box, or else a 1 or d 1 is the smallest entry in the diffy box. Reflect (operation (e)) if necessary to obtain a new diffy box [a 2 b 2 c 2 d 2 ] so that a 2 is extreme.. Step 3. If necessary, reflect to obtain a new box [a 3 b 3 c 3 d 3 ] so that a 3 b 3 c 3 d 3.. Step 4. If a 3 is maximal, negate the box (operation (b)). Call the new box [a 4 b 4 c 4 d 4 ].. Step 5. Translation (operation (a)) by a to make the first entry 0. Call the new box [0 b 5 c 5 d 5 ].. Step 6. At this point, if b 5 0, scale (operation (c)) by 1/b to obtain a new box called [0 1 c 6 d 6 ]. Otherwise the box is of the form [0 0 c 6 d 6 ]. In either case, the box is now in standard form. Here is an example. Take our original box [ ]. Already 22 ( 3) is maximal, so we don t have to do anything in Step 1. Step 2 says reflect to get the first coordinate to be maximal; so we have to reflect to get 22 in the first coordinate to be maximal. The result is [ ]. Since ( 3)), we don t have to do anything in Step 3. Step 4 says to negate the box; we obtain [ ]. In Step 5, we add 33 to everything to get [ ]. Step 6 says to divide by 14 leaving us with [0 1 15/14 25/14] which, we observe, is indeed in standard form. We can summarize the previous paragraph by the following list of steps: [a b c d] = [ ] [ ] [ ] [ ] [ ] [ ] [0 1 15/14 25/14] Now try your hand at the following exercises.

11 11 exercises v: standard form By using the above algorithm, bring the following diffy boxes into standard form. Record each step of the algorithm as in the example above 1. abcd = [ ] 2. abcd = [ ] 3. abcd = [ ] 4. abcd = [ ]

12 12 5. abcd = [ ] exercises v: standard form (continued) 6. abcd = [ ] 7. abcd = [ ] 8. abcd = [ ]

13 13 exercises vi: visualizing standard form (continued) In each of the above eight exercises, you arrived at 8 diffy boxes of the form [0 1 x y] (or [ ]). Plot the (x, y) coordinates of the first four points on the first graph below. Plot the (x,y) coordinates of the second four points on the second graph below. Also plot the point ((q 1)q,q). Can you see a pattern? y x y x

14 14 We re out of time, but I can t resist the punchline. We can continue doing experiments like the ones in the last few pages of exercises: we start with a diffy box B 1 = [0 1 a b], compute the sequence of difference operations B 1 B 2..., covert each of these to standard form, B i = [0 1 x i y 1 ] or [0 0 x i y i ], and then plot the sequence of points (x 1,y 1 ),(x 2,y 2 ),.... (It s most interesting to do this for diffy boxes with long longevities, like the ones listed in the table above.) The patterns one finds are as in the examples above: the points radiate in a spiral out from a central point until one encounters the boundary. What is the central point? It s nothing but the magic box [0 1 (q 1)q q]. If we start at this point, we never move. This doesn t mean that [0 1 (q 1)q q] [0 1 (q 1)q q], but only that the difference operation applied to [0 1 (q 1)q q] has the same standard form. This, in turn, means that the longevity of [0 1 (q 1)q q] is infinite. Indeed it is the unique diffy box in standard form which has infinite longevity.

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,

Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

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

The Pointless Machine and Escape of the Clones

MATH 64091 Jenya Soprunova, KSU The Pointless Machine and Escape of the Clones The Pointless Machine that operates on ordered pairs of positive integers (a, b) has three modes: In Mode 1 the machine adds

Pick s Theorem. Tom Davis Oct 27, 2003

Part I Examples Pick s Theorem Tom Davis tomrdavis@earthlink.net Oct 27, 2003 Pick s Theorem provides a method to calculate the area of simple polygons whose vertices lie on lattice points points with

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Essential Question: LESSON 4 FINITE ARITHMETIC SERIES AND RELATIONSHIP TO QUADRATIC

5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

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

THE GOLDEN RATIO AND THE FIBONACCI SEQUENCE

/ 24 THE GOLDEN RATIO AND THE FIBONACCI SEQUENCE Todd Cochrane Everything is Golden 2 / 24 Golden Ratio Golden Proportion Golden Relation Golden Rectangle Golden Spiral Golden Angle Geometric Growth, (Exponential

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

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

EQUATIONS and INEQUALITIES

EQUATIONS and INEQUALITIES Linear Equations and Slope 1. Slope a. Calculate the slope of a line given two points b. Calculate the slope of a line parallel to a given line. c. Calculate the slope of a line

Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =

Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

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

Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

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,

Assignment 5 - Due Friday March 6

Assignment 5 - Due Friday March 6 (1) Discovering Fibonacci Relationships By experimenting with numerous examples in search of a pattern, determine a simple formula for (F n+1 ) 2 + (F n ) 2 that is, a

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

MA.7.G.4.2 Predict the results of transformations and draw transformed figures with and without the coordinate plane.

MA.7.G.4.2 Predict the results of transformations and draw transformed figures with and without the coordinate plane. Symmetry When you can fold a figure in half, with both sides congruent, the fold line

Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required

Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

Trigonometric Functions and Triangles

Trigonometric Functions and Triangles Dr. Philippe B. Laval Kennesaw STate University August 27, 2010 Abstract This handout defines the trigonometric function of angles and discusses the relationship between

Vector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.

1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

SMMG December 2 nd, 2006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. Fun Fibonacci Facts

SMMG December nd, 006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. The Fibonacci Numbers Fun Fibonacci Facts Examine the following sequence of natural numbers.

Appendix F: Mathematical Induction

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

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

3 Some Integer Functions

3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple

ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,

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

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

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

Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the

Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

1.4 Factors and Prime Factorization

1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that

Change of Continuous Random Variable

Change of Continuous Random Variable All you are responsible for from this lecture is how to implement the Engineer s Way (see page 4) to compute how the probability density function changes when we make

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

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

Which shapes make floor tilings?

Which shapes make floor tilings? Suppose you are trying to tile your bathroom floor. You are allowed to pick only one shape and size of tile. The tile has to be a regular polygon (meaning all the same

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

7 Relations and Functions

7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,

The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

Ummmm! Definitely interested. She took the pen and pad out of my hand and constructed a third one for herself:

Sum of Cubes Jo was supposed to be studying for her grade 12 physics test, but her soul was wandering. Show me something fun, she said. Well I wasn t sure just what she had in mind, but it happened that

TOPIC 3: CONTINUITY OF FUNCTIONS

TOPIC 3: CONTINUITY OF FUNCTIONS. Absolute value We work in the field of real numbers, R. For the study of the properties of functions we need the concept of absolute value of a number. Definition.. Let

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.

You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk

The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk Nicholas Jackiw njackiw@kcptech.com KCP Technologies, Inc. ICTMT11 2013 Bari Overview. The study of hyperbolic geometry and non-euclidean

Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis

Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis 2. Polar coordinates A point P in a polar coordinate system is represented by an ordered pair of numbers (r, θ). If r >

A couple of Max Min Examples. 3.6 # 2) Find the maximum possible area of a rectangle of perimeter 200m.

A couple of Max Min Examples 3.6 # 2) Find the maximum possible area of a rectangle of perimeter 200m. Solution : As is the case with all of these problems, we need to find a function to minimize or maximize

Chapter 4. Descartes, Third Meditation. 4.1 Homework

Chapter 4 Descartes, Third Meditation 4.1 Homework Readings : - Descartes, Meditation III - Objections and Replies: a) Third O and R: CSM II, 132; 127-8. b) Fifth O and R: CSM II, 195-97, 251. c) First

22.1 Interior and Exterior Angles

Name Class Date 22.1 Interior and Exterior ngles Essential Question: What can you say about the interior and exterior angles of a triangle and other polygons? Resource Locker Explore 1 Exploring Interior

Polynomial and Rational Functions

Polynomial and Rational Functions Quadratic Functions Overview of Objectives, students should be able to: 1. Recognize the characteristics of parabolas. 2. Find the intercepts a. x intercepts by solving

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

Regions in a circle. 7 points 57 regions

Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

SMMG February 25 th, 2006 featuring Dr. Alistair Windsor Fun with Fractals

SMMG February 25 th, 2006 featuring Dr. Alistair Windsor Fun with Fractals 1. If f(z) is a function, various behaviors can arise when f is iterated. Gaston Julia studied the iteration of polynomials and

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 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products