Rigidity Results for Tilings by L-Tiles and Notched Rectangles

Size: px
Start display at page:

Download "Rigidity Results for Tilings by L-Tiles and Notched Rectangles"

Transcription

1 Rigidity Results for Tilings by L-Tiles and Notched Rectangles A. Calderon 1 S. Fairchild 2 S. Simon 3 1 University of Nebraska-Lincoln 2 Houghton College 3 Carnegie Mellon University MASSfest 2013

2 Introduction to Tiling What is a tile? Has been prominent in recreational math for decades Tiling of regions in a square lattice Consists of 1 1 cells

3 Tilesets Introduction What is a tile? Take a rectangle and make an L-shaped dissection Consider the two pieces and the two obtained from a reflection over the first bisector L 2 C 1 C 2 C 3 C 4 R 1 L 1 R 2 (a) The dissections C 1, C 2, C 3, C 4. (b) A C 1 dissection Figure: Our dissections and T (C 1, 6, 3).

4 Rigidity Introduction What is a tile? Definition A tiling by T (C i, k, n), 1 i 4 and 3 n k, of a region in plane is called rigid if it reduces to a tiling by k n and n k rectangles.

5 Problem Statement Introduction What is a tile? Problem Investigate the rigidity properties of tilings of each quadrant by T (C i, k, n), 1 i 4 and 3 n k

6 3 3 Base Case Introduction m R 1 L 1 R L 2 R 2 R 1 L 1

7 3 3 Inductive Step m R 1 L 1 X i+1 L 2 X i X i 1 R 2

8 m Tiling of X i 4 X i R 1 2 Figure: Tiling the corner of X i with R 1.

9 m Tiling of X i 4 X i R 1 2 Figure: Tiling the corner of X i with R 1.

10 m Tiling of X i 4 X i R 1 2 Figure: Tiling the corner of X i with R 1.

11 m Tiling of X i (a) Propagation of the pattern up the staircase. (b) The end of the propagation. Figure: Attempts to tile cell 1 with L 2.

12 m Tiling of X i X i R 1or2 X i 1 Figure: If we tile cell 1 by R 1 or R 2, we must tile cells 3 and 4 as shown.

13 Nonrigid Tilings by T (C 2, 3, 3) m II III IV IV II I (a) A nonrigid tiling of the second quadrant. III (b) A nonrigid tiling of the third quadrant. I

14 m T (C 2, 3, 3) in the First Quadrant 1 1

15 m T (C 2, 3, 3) in the First Quadrant 1 1

16 m Rigid Tilings of the Second and First Quadrants X i (c) Tiling the corner of X i with R 1. (d) Tiling X i on the staircase line.

17 Definitions Introduction m Definition A gap is a n k, k > 0, region in the first quadrant such that the x and y coordinates of its bottom left corner are both divisible by n. We call k the length of the gap. Definition We say an L 1 tile is in an irregular position if its bottom left corner has both its x and y coordinates divisible by n and if all squares below and to the left of the corner follow the rigid pattern.

18 m Existence of an Irregular L 1 Tile Lemma Any nonrigidly tiled gap of the i th quadrant by T (C i, mn, n) induces an L 1 tile in an irregular position or a nonrigidly tiled gap closer to the y-axis.

19 m Existence of an Irregular L 1 Tile Proof. Choose the gaps that are closest to the x-axis, and with respect to those choose the gap closest to the y-axis. Consider the bottom left corner of the gap Case 1: L 1 tiles the bottom left corner Case 2: R 2 tiles the bottom left corner L R 1 L 1 R 2

20 m Existence of an Irregular L 1 Tile Proof. Consider the bottom left corner of the gap Case 3: R 1 tiles the bottom left corner L 2 R 1 L 1 R2

21 m Impossibility of Irregular L 1 Lemma Tilings of the first quadrant by T (C 1, mn, n) cannot contain an L 1 in an irregular position.

22 m Impossibility of Irregular L 1 Proof. Assume for the sake of contradiction there exists a tiling of the first quadrant with an L 1 tile in an irregular position L 2 R 1 L 1 R 2

23 m Rigidity results for tiling the first quadrant by T (C 1, mn, n) Theorem Any tiling of the first quadrant by T (C 1, mn, n) is rigid. Proof. Assume for the sake of contradiction that there is a nonrigid tiling of the first quadrant. This implies there is a nonrigid gap. By the first lemma, this implies the existence of an L 1 tile in an irregular position or a non rigidly tiled gap closer to the y-axis. But the non rigidly tiled gap placed closer to the y axis eventually will force an L 1 tile, so by the second lemma, we know that such a tiling doesn t exist.

24 m Generalization of Rigidity Results Remark We have generalized this rigidity result for T (C i, mn, n) in the i th quadrant for 1 i 4.

25 m for Rectangles of Coprime Dimension Theorem If p, n are coprime, then all quadrants have nonrigid tilings by T (C i, p, n), 1 i 4.

26 m for Rectangles of Coprime Dimension Proof. Assume that gcd(p, n) = 1. Then we know that p is a generator in Z/nZ. Hence, for some x Z +, we have (x + 1)p 1 mod n, which implies that xp + (p 1) 0 mod n. n n n p p n p

27 Generalizing the Dissection m 3 more independent parameters For yp xn = r t, region I is infinite strips of length xn, region II is a strip of width p. For ap bn = s, region III is an infinite strip of width (a 1)p, region V is a rectangle of size bn yp. I s r IV L 1 II V t III

28 Introduction For n 4 T (C i, n, n) is rigid in the i th quadrant T (C 2, n, n) and T (C 4, n, n) rigid in each quadrant Special Case: T (C 2, 3, 3) rigid in only the first quadrant

29 Introduction T (C i, mn, n) for 1 i 4 and m 2, n 3 is rigid in the i th quadrant T (C 1, mn, n) is nonrigid in the second, third, and fourth quadrants T (C 3, mn, n) is nonrigid in the first, second, and fourth quadrants T (C 2, mn, n) and T (C 4, mn, n) have currently eluded our investigative measures

30 For p, n coprime, If p, n are coprime, then all quadrants have nonrigid tilings by T (C i, p, n), 1 i 4 Algorithm generalizes to all possible L shaped dissections of the rectangle

31 Applications Introduction

32 Appendix References References I M. Chao, D. Levenstein, V. Nitica, R. Sharp, A coloring invariant for ribbon L-tetrominoes, Discrete Mathematics, 313 (2013) S. W. Golomb, Checker boards and polyominoes, American Mathematical Monthly, 61 (1954) S. W. Golomb, Replicating figures in the plane, Mathematical Gazette, 48 (1964) S. W. Golomb, Polyominoes, Puzzeles, Patterns, Problems, and Packings (2 nd ed.), Princeton University Press, NJ, V. Nitica, Rep-tiles revisited, in the volume MASS Selecta: Teaching and Learning Advanced Undergraduate Mathematics, American Mathematical Society, V. Nitica, A rigidity property of ribbon L-shaped n-ominoes and generalizations, submitted to Discrete Mathematics

On tiling the integers with 4-sets of the same gap sequence

On tiling the integers with 4-sets of the same gap sequence On tiling the integers with -sets of the same gap sequence arxiv:05.0v [math.co] May 0 Ilkyoo Choi Junehyuk Jung Minki Kim May, 0 Abstract Partitioning a set into similar, if not, identical, parts is a

More information

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

More information

Invariants II. LA Math Circle (Advanced) November 15, 2015

Invariants II. LA Math Circle (Advanced) November 15, 2015 Invariants II LA Math Circle (Advanced) November 15, 2015 Recall that an invariant is some quantity associated with a system that is left unchanged by a specified process. We typically use them to show

More information

Fermat's Little Theorem

Fermat's Little Theorem Fermat's Little Theorem CS 2800: Discrete Structures, Spring 2015 Sid Chaudhuri Not to be confused with... Fermat's Last Theorem: x n + y n = z n has no integer solution for n > 2 Recap: Modular Arithmetic

More information

MATH 152 Problem set 6 solutions

MATH 152 Problem set 6 solutions MATH 52 Problem set 6 solutions. Z[ 2] is a Euclidean domain (i.e. has a division algorithm): the idea is to approximate the quotient by an element in Z[ 2]. More precisely, let a+b 2, c+d 2 Z[ 2] (of

More information

COLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES BY DANIEL WESLEY CRANSTON

COLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES BY DANIEL WESLEY CRANSTON COLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES BY DANIEL WESLEY CRANSTON B.S., Greenville College, 1999 M.S., University of Illinois, 2000 THESIS Submitted in partial fulfillment of the

More information

A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*)

A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*) R912 Philips Res. Repts 30,337*-343*,1975 Issue in honour of C. J. Bouwkamp A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*) by N. G. de BRUIJN Technological University Eindhoven Eindhoven, The Netherlands

More information

SOME HINTS AND ANSWERS TO 18.S34 SUPPLEMENTARY PROBLEMS (Fall 2007)

SOME HINTS AND ANSWERS TO 18.S34 SUPPLEMENTARY PROBLEMS (Fall 2007) SOME HINTS AND ANSWERS TO 18.S34 SUPPLEMENTARY PROBLEMS (Fall 2007) 2. (b) Answer: (n 3 + 3n 2 + 8n)/6, which is 13 for n = 3. For a picture, see M. Gardner, The 2nd Scientific American Book of Mathematical

More information

COM S 330 Lecture Notes Week of Feb 9 13

COM S 330 Lecture Notes Week of Feb 9 13 Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...

More information

Mathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring

Mathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring 2016 1 Climbing the Ladder We want to show that n 1 P(n) is true. Think of the positive integers as a ladder. 1, 2, 3, 4, 5, 6,...

More information

Sums of Squares. Bianca Homberg and Minna Liu

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

More information

Strong Mathematical Induction

Strong Mathematical Induction Strong Mathematical Induction Lecture 23 Section 5.4 Robb T. Koether Hampden-Sydney College Mon, Feb 24, 2014 Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, 2014 1

More information

Olympiad Constructions Cody Johnson. Constructions. July 14, 2016 Cody Johnson.

Olympiad Constructions Cody Johnson. Constructions. July 14, 2016 Cody Johnson. Introduction Constructions July 4, 06 Cody Johnson ctj@math.cmu.edu A large amount of Olympiad combinatorics are posed in the form Find the minimum/maximum n such that... Constructions are very useful

More information

Homework 3 Solutions, Math 55

Homework 3 Solutions, Math 55 Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}

More information

MathSciNet infinitude of prime

MathSciNet infinitude of prime 0 π(x) x π(x) > c log log x π(x) > c log x c MathSciNet infinitude of prime 2018/11/3 2012 arxiv Romeo Meštrović, Euclid s theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.

More information

Counting Clusters on a Grid

Counting Clusters on a Grid Dartmouth College Undergraduate Honors Thesis Counting Clusters on a Grid Author: Jacob Richey Faculty Advisor: Peter Winkler May 23, 2014 1 Acknowledgements There are a number of people who have made

More information

Proofs of the infinitude of primes

Proofs of the infinitude of primes Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number

More information

CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS

CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS (1) For a positive integer n, an n-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second

More information

Recreational Mathematics

Recreational Mathematics Recreational Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Summer 2003 Chapters 5 8 Version 030630 Chapter 5 Greatest common divisor 1 gcd(a, b) as an integer combination of

More information

BMT 2018 Team Test Solutions March 18, 2018

BMT 2018 Team Test Solutions March 18, 2018 . A circle with radius is inscribed in a right triangle with hypotenuse 4 as shown below. What is the area of the triangle? Note that the diagram is not to scale. 4 Answer: 9 Solution : We wish to use

More information

Mathematical Induction. Section 5.1

Mathematical Induction. Section 5.1 Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction

More information

2 IGOR PAK so we loose some information about the structure of the tilings since there could be many tilings of with the same multiset of tiles (see e

2 IGOR PAK so we loose some information about the structure of the tilings since there could be many tilings of with the same multiset of tiles (see e RIBBON TILE INVARIANTS Igor Pak MIT E-mail: pak@math.mit.edu September 30, 1997 Abstract. Let T be a nite set of tiles, B be a set of regions tileable by T. We introduce a tile counting group G (T; B)

More information

Exercises. Template for Proofs by Mathematical Induction

Exercises. Template for Proofs by Mathematical Induction 5. Mathematical Induction 329 Template for Proofs by Mathematical Induction. Express the statement that is to be proved in the form for all n b, P (n) forafixed integer b. 2. Write out the words Basis

More information

Tetrads and their Counting

Tetrads and their Counting Baltic J. Modern Computing, Vol. 6 (2018), No. 2, 96-106 https://doi.org/10.22364/bjmc.2018.6.2.01 Tetrads and their Counting Juris ČERŅENOKS, Andrejs CIBULIS Department of Mathematics, University of Latvia

More information

Math 109 September 1, 2016

Math 109 September 1, 2016 Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,

More information

Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

More information

Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.

Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis. Exercises Exercises 1. There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next

More information

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006 Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18

More information

Invariants II. LA Math Circle (Advanced) November 15, 2015

Invariants II. LA Math Circle (Advanced) November 15, 2015 Invariants II LA Math Circle (Advanced) November 15, 2015 Recall that an invariant is some quantity associated with a system that is left unchanged by a specified process. We typically use them to show

More information

Mathematical induction

Mathematical induction Mathematical induction Notes and Examples These notes contain subsections on Proof Proof by induction Types of proof by induction Proof You have probably already met the idea of proof in your study of

More information

Vocabulary Cards and Word Walls

Vocabulary Cards and Word Walls Vocabulary Cards and Word Walls Revised: September 9, 2011 Important Notes for Teachers: The vocabulary cards in this file match the Common Core, the mathematics learning standards adopted by the Washington

More information

arxiv: v1 [math.gm] 1 Oct 2015

arxiv: v1 [math.gm] 1 Oct 2015 A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence

More information

2010 Shortlist JBMO - Problems

2010 Shortlist JBMO - Problems Chapter 1 2010 Shortlist JBMO - Problems 1.1 Algebra A1 The real numbers a, b, c, d satisfy simultaneously the equations abc d = 1, bcd a = 2, cda b = 3, dab c = 6. Prove that a + b + c + d 0. A2 Determine

More information

Some Polyomino Tilings of the Plane

Some Polyomino Tilings of the Plane Some Polyomino Tilings of the Plane Cristopher Moore SFI WORKING PAPER: 1999-04-03 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of

More information

2018 MOAA Gunga Bowl: Solutions

2018 MOAA Gunga Bowl: Solutions 08 MOAA Gunga Bowl: Solutions Andover Math Club Set Solutions. We pair up the terms as follows: +++4+5+6+7+8+9+0+ = (+)+(+0)+(+9)+(4+8)+(5+7)+6 = 5+6 = 66.. By the difference of squares formula, 6 x =

More information

Math 2414 Activity 1 (Due by end of class Jan. 26) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line.

Math 2414 Activity 1 (Due by end of class Jan. 26) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line. Math Activity (Due by end of class Jan. 6) Precalculus Problems: 3, and are tangent to the parabola ais. Find the other line.. One of the two lines that pass through y is the - {Hint: For a line through

More information

Baltic Way 2003 Riga, November 2, 2003

Baltic Way 2003 Riga, November 2, 2003 altic Way 2003 Riga, November 2, 2003 Problems and solutions. Let Q + be the set of positive rational numbers. Find all functions f : Q + Q + which for all x Q + fulfil () f ( x ) = f (x) (2) ( + x ) f

More information

UNIVERSITY OF MICHIGAN UNDERGRADUATE MATH COMPETITION 27 MARCH 28, 2010

UNIVERSITY OF MICHIGAN UNDERGRADUATE MATH COMPETITION 27 MARCH 28, 2010 UNIVERSITY OF MICHIGAN UNDERGRADUATE MATH COMPETITION 27 MARCH 28, 200 Instructions. Write on the front of your blue book your student ID number. Do not write your name anywhere on your blue book. Each

More information

EQUAL LABELINGS FOR P K -SIDED DICE

EQUAL LABELINGS FOR P K -SIDED DICE EQUAL LABELINGS FOR P K -SIDED DICE A Thesis Presented to the Faculty of California State Polytechnic University, Pomona In Partial Fulfillment Of the Requirements for the Degree Master of Science In Mathematics

More information

D-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings

D-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings D-MATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n

More information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

Divisibility = 16, = 9, = 2, = 5. (Negative!)

Divisibility = 16, = 9, = 2, = 5. (Negative!) Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties

More information

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in

More information

The generating function of simultaneous s/t-cores

The generating function of simultaneous s/t-cores The generating function of simultaneous s/t-cores William J. Keith, wjk150@cii.fc.ul.pt University of Lisbon CMUC Seminar, Univ. Coimbra Abstract Previous work on partitions simultaneously s-core and t-core

More information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information

History of Mathematics

History of Mathematics History of Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Summer 2011 6A: Fermat: Beginning of modern number theory (2) Fermat s little theorem Given a prime p, and any geometric

More information

1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.

1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018. New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of

More information

International Mathematics TOURNAMENT OF THE TOWNS

International Mathematics TOURNAMENT OF THE TOWNS International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2008. 1. A standard 8 8 chessboard is modified by varying the distances between parallel grid lines, so that the cells are rectangles

More information

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA

More information

Math 2414 Activity 1 (Due by end of class July 23) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line.

Math 2414 Activity 1 (Due by end of class July 23) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line. Math 44 Activity (Due by end of class July 3) Precalculus Problems: 3, and are tangent to the parabola ais. Find the other line.. One of the two lines that pass through y is the - {Hint: For a line through

More information

ON A TWO-DIMENSIONAL SEARCH PROBLEM. Emil Kolev, Ivan Landgev

ON A TWO-DIMENSIONAL SEARCH PROBLEM. Emil Kolev, Ivan Landgev Serdica Math. J. 21 (1995), 219-230 ON A TWO-DIMENSIONAL SEARCH PROBLEM Emil Kolev, Ivan Landgev Communicated by R. Hill Abstract. In this article we explore the so-called two-dimensional tree search problem.

More information

1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let

1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.

More information

Number Theory Homework.

Number Theory Homework. Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this

More information

Math From Scratch Lesson 28: Rational Exponents

Math From Scratch Lesson 28: Rational Exponents Math From Scratch Lesson 28: Rational Exponents W. Blaine Dowler October 8, 2012 Contents 1 Exponent Review 1 1.1 x m................................. 2 x 1.2 n x................................... 2 m

More information

MINIMUM AREA POLYOMINO VENN DIAGRAMS

MINIMUM AREA POLYOMINO VENN DIAGRAMS MINIMUM RE POLYOMINO VENN DIGRMS ette ultena, Matthew Klimesh, and Frank Ruskey bstract. Polyomino Venn (or polyvenn) diagrams are Venn diagrams whose curves are the perimeters of polyominoes drawn on

More information

UNC Charlotte Algebra Competition March 9, 2009

UNC Charlotte Algebra Competition March 9, 2009 Algebra Competition March 9, 2009 1. If the operation is defined by x y = 3y + y x, then 2 5 = (A) 10 (B) 10 (C) 40 (D) 26 (E) None of these Solution: C. The solution is found by direct substitution. 2.

More information

1 Continued Fractions

1 Continued Fractions Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction

More information

Enumeration of generalized polyominoes

Enumeration of generalized polyominoes Enumeration of generalized polyominoes MATTHIAS KOCH and SASCHA KURZ Department of Mathematics, University of Bayreuth matthias.koch, sascha.kurz@uni-bayreuth.de D-95440 Bayreuth, Germany Submitted: May

More information

Convex Domino Towers

Convex Domino Towers Convex Domino Towers Tricia Muldoon Brown Department of Mathematics Armstrong State University 11935 Abercorn Street Savannah, GA 31419 USA patricia.brown@armstrong.edu Abstract We study convex domino

More information

Designing a Calculus Mobile

Designing a Calculus Mobile Integre Technical Publishing Co., Inc. College Mathematics Journal 33: November 1, 1 :33 p.m. farmer.tex page 131 Designing a Calculus Mobile Tom Farmer Tom Farmer (farmerta@muohio.edu) received his Ph.D.

More information

inv lve a journal of mathematics 2009 Vol. 2, No. 2 Bounds for Fibonacci period growth mathematical sciences publishers Chuya Guo and Alan Koch

inv lve a journal of mathematics 2009 Vol. 2, No. 2 Bounds for Fibonacci period growth mathematical sciences publishers Chuya Guo and Alan Koch inv lve a journal of mathematics Bounds for Fibonacci period growth Chuya Guo and Alan Koch mathematical sciences publishers 2009 Vol. 2, No. 2 INVOLVE 2:2(2009) Bounds for Fibonacci period growth Chuya

More information

PROOF WITHOUT WORDS MATH CIRCLE (BEGINNERS) 05/06/2012

PROOF WITHOUT WORDS MATH CIRCLE (BEGINNERS) 05/06/2012 PROOF WITHOUT WORDS MATH CIRCLE (BEGINNERS) 05/06/2012 If you ve been with us for a little while, you ve already seen some examples of proofs without words. Remember a proof is just an airtight argument

More information

CSE 20 DISCRETE MATH SPRING

CSE 20 DISCRETE MATH SPRING CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Describe computer representation of sets with bitstrings Define and compute the cardinality of finite

More information

9th Bay Area Mathematical Olympiad

9th Bay Area Mathematical Olympiad 9th Bay rea Mathematical Olympiad February 27, 2007 Problems with Solutions 1 15-inch-long stick has four marks on it, dividing it into five segments of length 1,2,3,4, and 5 inches (although not neccessarily

More information

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

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

More information

1 2n. i=1. 2m+1 i = m, while. 2m + 1 = 1. is the best possible for any odd n.

1 2n. i=1. 2m+1 i = m, while. 2m + 1 = 1. is the best possible for any odd n. Problem 1. Let n be a positive integer. Find the largest nonnegative real number f(n) (depending on n) with the following property: whenever a 1, a,..., a n are real numbers such that a 1 + a + + a n is

More information

Proposition The gaussian numbers form a field. The gaussian integers form a commutative ring.

Proposition The gaussian numbers form a field. The gaussian integers form a commutative ring. Chapter 11 Gaussian Integers 11.1 Gaussian Numbers Definition 11.1. A gaussian number is a number of the form z = x + iy (x, y Q). If x, y Z we say that z is a gaussian integer. Proposition 11.1. The gaussian

More information

Wilson s Theorem and Fermat s Little Theorem

Wilson s Theorem and Fermat s Little Theorem Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =

More information

Long division for integers

Long division for integers Feasting on Leftovers January 2011 Summary notes on decimal representation of rational numbers Long division for integers Contents 1. Terminology 2. Description of division algorithm for integers (optional

More information

POLYOMINOES WITH MINIMUM SITE-PERIMETER AND FULL SET ACHIEVEMENT GAMES. Nándor Sieben

POLYOMINOES WITH MINIMUM SITE-PERIMETER AND FULL SET ACHIEVEMENT GAMES. Nándor Sieben POLYOMINOES WITH MINIMUM SITE-PERIMETER AN FULL SET ACHIEVEMENT GAMES Nándor Sieben Abstract The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula

More information

2007 Shortlist JBMO - Problems

2007 Shortlist JBMO - Problems Chapter 1 007 Shortlist JBMO - Problems 1.1 Algebra A1 Let a be a real positive number such that a 3 = 6(a + 1). Prove that the equation x + ax + a 6 = 0 has no solution in the set of the real number.

More information

RECURRENCE IN GENERIC STAIRCASES

RECURRENCE IN GENERIC STAIRCASES RECURRENCE IN GENERIC STAIRCASES SERGE TROUBETZKOY Abstract. The straight-line flow on almost every staircase and on almost every square tiled staircase is recurrent. For almost every square tiled staircase

More information

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize

More information

Investigation Of Plane Symmetry In Lattice Designs

Investigation Of Plane Symmetry In Lattice Designs Salem State University Digital Commons at Salem State University Honors Theses Student Scholarship 2016-12-01 Investigation Of Plane Symmetry In Lattice Designs Katyana Sheridan Salem State University

More information

Convex Domino Towers

Convex Domino Towers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017, Article 17.3.1 Convex Domino Towers Tricia Muldoon Brown Department of Mathematics Armstrong State University 11935 Abercorn Street Savannah,

More information

#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary

#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary #A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

LARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0).

LARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0). LARGE PRIME NUMBERS 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power a e % n. (Here x % n denotes the element of {0,, n 1}

More information

IF A PRIME DIVIDES A PRODUCT... ζ(s) = n s. ; p s

IF A PRIME DIVIDES A PRODUCT... ζ(s) = n s. ; p s IF A PRIME DIVIDES A PRODUCT... STEVEN J. MILLER AND CESAR E. SILVA ABSTRACT. One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact

More information

A Topological Approach to Molecular Chirality

A Topological Approach to Molecular Chirality Claremont Colleges Scholarship @ Claremont Pomona Faculty Publications and Research Pomona Faculty Scholarship 1-1-2011 A Topological Approach to Molecular Chirality Erica Flapan Pomona College Recommended

More information

Van der Waerden Numbers with Finite Gap Sets of Size Three

Van der Waerden Numbers with Finite Gap Sets of Size Three Van der Waerden Numbers with Finite Gap Sets of Size Three Stephen Hardy Emily McLean Kurt Vinhage July 29, 2009 Abstract For a set D of positive integers, let w D (k; r) denote the least positive integer

More information

Some unsolved problems in mathematics and computation

Some unsolved problems in mathematics and computation Some unsolved problems in mathematics and computation Dartmouth College Odyssey Series - JHU Center for Talented Youth - 10/4/14 Mathematics is... 1. Universal It is the same in any place of the world

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

Rectangular Young tableaux and the Jacobi ensemble

Rectangular Young tableaux and the Jacobi ensemble Rectangular Young tableaux and the Jacobi ensemble Philippe Marchal October 20, 2015 Abstract It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau

More information

A Mathematical Analysis of The Generalized Oval Track Puzzle

A Mathematical Analysis of The Generalized Oval Track Puzzle Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 1 Article 5 A Mathematical Analysis of The Generalized Oval Track Puzzle Samuel Kaufmann Carnegie Mellon University, sakaufma@andrew.cmu.edu

More information

If something is repeated, look for what stays unchanged!

If something is repeated, look for what stays unchanged! LESSON 5: INVARIANTS Invariants are very useful in problems concerning algorithms involving steps that are repeated again and again (games, transformations). While these steps are repeated, the system

More information

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.

More information

RMT 2013 Power Round Solutions February 2, 2013

RMT 2013 Power Round Solutions February 2, 2013 RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated

More information

Martin Gardner s minimum no-3-in-a-line problem

Martin Gardner s minimum no-3-in-a-line problem Martin Gardner s minimum no-3-in-a-line problem Alec S. Cooper Oleg Pikhurko John R. Schmitt Gregory S. Warrington July 19, 01 Abstract In Martin Gardner s October 1976 Mathematical Games column in Scientific

More information

Discrete Math, Second Problem Set (June 24)

Discrete Math, Second Problem Set (June 24) Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have

More information

Canadian Open Mathematics Challenge

Canadian Open Mathematics Challenge The Canadian Mathematical Society in collaboration with The CENTRE for EDUCATION in MATHEMATICS and COMPUTING presents the Canadian Open Mathematics Challenge Wednesday, November, 006 Supported by: Solutions

More information

Organization Team Team ID#

Organization Team Team ID# 1. [4] A random number generator will always output 7. Sam uses this random number generator once. What is the expected value of the output? 2. [4] Let A, B, C, D, E, F be 6 points on a circle in that

More information

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19

More information

Problems for Putnam Training

Problems for Putnam Training Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,

More information

3.2 Solving linear congruences. v3

3.2 Solving linear congruences. v3 3.2 Solving linear congruences. v3 Solving equations of the form ax b (mod m), where x is an unknown integer. Example (i) Find an integer x for which 56x 1 mod 93. Solution We have already solved this

More information

Precalculus idea: A picture is worth 1,000 words

Precalculus idea: A picture is worth 1,000 words Six Pillars of Calculus by Lorenzo Sadun Calculus is generally viewed as a difficult subject, with hundreds of formulas to memorize and many applications to the real world. However, almost all of calculus

More information

Note that Todd can only move north or west. After this point, Allison executes the following strategy based on Todd s turn.

Note that Todd can only move north or west. After this point, Allison executes the following strategy based on Todd s turn. 1. First, note that both Todd and Allison place exactly one blue stone in each of their turns. Also, it will take Todd at least eight moves to get from the center to a corner. Therefore, as Todd would

More information

Relating minimum degree and the existence of a k-factor

Relating minimum degree and the existence of a k-factor Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex

More information

ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT

ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT #A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of

More information

Consider the plane containing both the axis of the cone and two opposite vertices of the cube's bottom face. The cross section of the cone and the cub

Consider the plane containing both the axis of the cone and two opposite vertices of the cube's bottom face. The cross section of the cone and the cub Solutions to the Twenty-Eighth University of Melbourne/Hewlett-Packard Mathematics Competition Senior Division, 1999 1 Two mathematicians, Walter and Hyam, are working at their respective homes on a problem

More information