A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*)
|
|
- Colin Booth
- 5 years ago
- Views:
Transcription
1 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 and D. A. KLARNER State University of New York at Binghampton Binghampton, N.Y., U.S.A. (Received January 22, 1975) Consider a catalogue Swhich lists one to infinitely many shapes of rectangular bricks with positive integer dimensions. Using as many bricks of each shape as needed, the bricks listed in S may be used to completely fill certain rectangular boxes. We assume the shapes to be oriented, i.e. we are not allowed to turn bricks around when trying to fill a box. Thus, a new catalogue res) may be formed which lists the (infinitely many) rectangular boxes which may be completely filled with bricks having their shape listed in S. Some of the bricks listed in Smay be shapes of boxes which can be filled up completely with smaller bricks listed in S; in other words, there may be elements SE S such that SE r(s\{s}). The bricks which may be formed with bricks in S smaller than themselves are composites. Bricks in S which are not composites are primes in S. If Br = Br(S) is the set of primes in S, then B; is non-empty and every box which can be formed with elements of S can be formed with elements of the subset Br of S; in other words, r(br) = res) (see lemma 4). The subject ofthis note is the remarkable fact that the set of primes Br(S) is finite for every set S. The brief history of this problem is as follows: Results involving the tiling of rectangles and three-dimensional boxes with identical polyominoes and polycubes are discussed in ref. 3. One sort of result presented there is typified by the following example. The L-tetromino and two of the smallest rectangles it tiles are shown in fig. I. An a X b rectangle can be tiled with copies of the L-tetromino Fig. 1. The L-tetromino *) Dedictated to our mutual friend e.j. Bouwkamp. and the smallest rectangles it tiles.
2 338* N. G. DE llruijn AND D. A. KLARNER if and only if a and b are integers greater than 1 such that 8 divides ab. Also, every a xb rectangle having integer sides a and b greater than 1 with ab a multiple of 8 can be tiled with 2 X 4 and 3 X 8 rectangles. If S denotes the set of rectangles which can be tiled with L-tetrominoes, one way to characterize S is to list the elements of B res) which are (2, 4), (3, 8), (4, 2), (8, 3); the first two are shown in fig. 1. On reading ref. 3 and doing some investigation of his own, Frits Göbel noted that in every case where one has a characterization of the set S of rectangles which can be tiled with copies of one polyomino, a characterization of S can be given by listing the elements of Br(S) because this always turned out to be a finite set. Thus, he was led to conjecture that Br(S) is finite for every set S of rectangular k-dimensional boxes. Bouwkamp (see ref. 1) has done considerable work with a computer to determine the set of prime boxes among the boxes which can be tiled with the Y-pentacube. Frits Göbel described his conjecture to the second author of the present note who found a prooffor the one- and two-dimensional instances ofthe conjecture. This proof was generalized in collaboration 2), but the proof breaks down in three and higher dimensions (the mistake in the proof is in the bottom third of p. 467 in ref. 2). The proof is illustrated for 2 dimensions, and this correct instance evidently convinced readers of the full generality. The mistake was finally noted and corrected in ref. 4. On reading this correction the first author of the present note thought of a simpler proof. Both proofs are presented here. The first proof is a corrected version of the proof which appears in ref. 2. Let (dl'..., d k ) denote a k-tuple of positive integers. Such a k-tuple will also be called a shape, occasionally written as d. Then an (oriented) k-dimensional box with shape (dl'..., d k ) is a set K of dl... d k integer points containing one point (the smallest) (Cl>., Ck) such that The set of all k-dimensional boxes with shape (dl>..., d k ) is denoted (dl'..., d k ). Boxes with shapes dl, d 2, are said to tile a box C if there exists a partition {Cl' C 2, } of C with Cl' C 2, E (dl) U (d 2 ) U... If S is a set of shapes then res) is the set of shapes of boxes that can be tiled by S. We shall also consider a more special kind of tiling (which we might refer to as repeated one-dimensional concatenation). If ä, b, ë are shapes, and ifthere is an i (1 ~ i ~ k) such that Cl= al + bh and such that Cl = al = bl for all j =1= i, then we say that ë is obtained from ä and b by one-dimensional concatenation. If S is a set of shapes, we define A(S) as the smallest set of shapes closed under one-dimensional concatenation, i.e. A(S) is the smallest set with the properties
3 I I : FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS 339* (i) A(S);;;2 S; (ii) if a E A(S), b E A(S), and ë is obtained from a and b by one-dimensional concatenation, then ë E A(S). For example, if a, b, ë are shapes, a ES, bes, if Cl = al + bl> and if cj is the least common multiple of aj and b J for 2 ~j ~ k, then ë E A(S). It is easy to see that if a E A(S) then S tiles every box of shape ti. In other words A(S) res). The following example shows that A(S) can be smaller I than r(s): If S = {(I, 4), (4, 1), (3, 3)} then (5, 5) E res) but (5, 5) rf= A(S). An element b of S is called prime with respect to A and Sif b rf= A(S\ {b }). The set of all these primes is called BA(S) (or BA for short). The operator A has the following properties (for all sets S, T): (i) S A(S); (ii) if S T then A(S) A(T); (iii) A(A(S)) = A(S); (iv) if a E A(S) then there exists a subset U of S with a E A(U) and such that every shape in U is ~ a (we say that b :::::;; a if bi ~ ai for i = 1,..., k). From these properties we derive: Lemma 1. If T S A(T) then BA(S) T. Proof Let b be any element of BA(S). By the definition of BA(S) we have b rf= A(S \ {b }). Now by (ii): b rf= A(T \ {b }). Since BA(S) S A (T) we have b e A(T), and it follows that A(T \ {b}) =1= A(T), whence bet. Lemma 2. A(BA(S)) = A(S). Proof According to (i), (ii), (iii) and to BA(S) S it suffices to show that S A(BA(S)). We do this by showing that if S \ A(BA(S)) contains a shape a then it contains a shape b with b ~ a, b =1= a (and that cannot go on for ever!). Let a be such a shape. Then a rf= BA(S), whence a E A(S \ {a}). By (iv) we can find U such that U S\ {a}, a E A( U) and such that all shapes in U are :::::;; a. We cannot have U A(BA(S)) since that would imply a E A(BA(S)). So we can take beu such that b rf= A(BA(S)). Since beu S\ {a} we have b ~ a, bes, b =1= a. Hence bes \ A(BA(S)). Lemma 3. If T S r(t) then Br(S) T. Lemma 4. r(br(s)) = res). Proofs of lemmas 3 and 4 are obtained from those of lemmas 1 and 2 by replacing all A's by r's. We now express our main result as a theorem.
4 340* N. G. DE BRUIJN AND D. A. KLARNER Theorem. Let S denote a set of k-dimensional shapes. Then we have (i) S has a finite subset T such that S s;; r(t) (whence res) = T(T»; (ii) Br(S) is finite; (iii) S has a finite subset T such that S s;; A(T) (whence A(S) = A(T»; (iv) BA(S) is finite. Remark. It follows from the lemmas that (i) is equivalent to (ii), and that (iii) is equivalent to (iv). Furthermore (iii) implies (i) (since A(T) T(T», hence it.suffices to prove either (iii) or (iv). First proof (Corrected version of the proof given in ref. 2; it will prove the theorem in the form (iv).) The proofis by induction on the dimension k ofthe boxes. For k = 1, Smay be regarded as a set of positive integers and BA(S) is the smallest subset of S such that every number in S is a non-negative linear combination of elements of BA(S). Suppose the greatest common divisor of elements of S is d; then it is easy to show that some finite subset F of S has greatest common divisor equal to d. Hence, since every large multiple of d is a non-negative linear combination of elements of F, all but a finite subset E of S is contained in A(F). Hence, S A(F U E) and BA(S) F u E. This proves BA(S) is finite in the 1- dimensional case. Now suppose BA(S) is finite for every set S of k-dimensional shapes for k = 1,..., n - 1 with n ;;;;:2. But, suppose there exists a set Tof n-dimensional boxes with BiT) infinite (this leads to a contradiction). Without loss of generality it can be supposed that BA(T) = T. Also, let the elements of T be put in a sequentialorder (i!> i 2, ) with i l = ««...., tin) for i = 1,2,... Each of the n sequences (til: i = 1,2,... ),..., (tin: i = 1,2,... ) must tend to infinity. For example, if the first sequence (til: i = 1, 2,... ) does not tend to infinity, then there exists an infinite constant subsequence (til: i E I) so that the infinite subsequence (il: i E I) of (il: i = 1,2,... ) contains boxes all having the same height. It follows from the induction hypothesis that the set {il: i E I}has finite basis with respect to A. A moment's thought may be required here because a detail is being passed over. At bottom, we are using the fact that having boxes all of one height really amounts to dealing with boxes of one lower dimension. Now we select an infinite subsequence R of T and show that BA(R) is finite. This provides the contradiction we seek since this implies there exists an element (in fact, infinitely many elements) of Twhich is composite. (Supposing T = B A(T) means no element of T is composite.) Given n-tuples ä = (al'..., an), h = (bi,..., bn) ofpositive integers, ä is said to divide h if al divides bi for i = 1,..., n. This notion of division leads to a notion of greatest common divisor of two or more n-tuples of positive integers.
5 FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS 341* We form the subsequence R = (il> i 2, ) as follows: Let,\ = i1> and note that i 1 has only a finite number of divisors. Hence, f 1 has the same greatest common divisor dl with each one of an infinite set of subsequent terms of Tfor some divisor dl of i 1 Let T 2 denote such an infinite subsequence of (i2' i 3,. ), and let i 2 denote the first term of T 2 Now this process is repeated with T 2 in place of Tand i 2 in place off 1, thus forming a new subsequence T 3 of T 2 with 1'2 deleted, and,\ is defined to be the first term of T 3 Thus, the ith term of Ris found by i-i repetitions of this process. It follows from this construction that R has the peculiar property that, for each i, the greatest common divisor of Fi with all subsequent terms of R is the same n-tuple dl for i = 1, 2,... Any sequence with this property is said to be stab/e. Note that every subsequence of a stable sequence is again stable. Now we show by construction that BA(R) is finite. Let for i= 1,..., n where then we shall show there exists an integer P such that A ({F 1,, F 2 n}) contains all boxes having shape (PI (J1>., Pn (JII) with P1>..., P«~ p. This implies BA(R) is finite since all but a finite subset of the elements of R have this form. Let /hies) denote the least common multiple of r 1,i>, r 2 S,i for i, s = 1,..., n where Fi = (ri1>..., rin) for i = 1, 2,... Now we show by induction onj: (A)). For every stable sequence there exists a number p) such that every shape (q1 151>"" q) c5j> /hj+1(j),..., /hn(j)) with q1>..., q) ~ p) is an element of A({i 1,, i 2 J})' Forj = 1, x, y = 1,2,..., the shape (1) (r11 x + r 21 y, /hil),...,,u1l(1)) may be formed from 1'1 and 1'2 by repeated one-dimensional concatenation. But, there exists an integer PI such that ç, 15 1 has the form r11 x + r 21 Y with x, y ~ 1 for all q1 ~ PI because the greatest common divisor of r 11 and r 21 divides 15 1, This proves A i- Now suppose A) is true for somej ~ 1; we shall prove AJ+1' Let,u/cs) denote the least common multiple of r 2 S+1,i', r 2 s+ 1,i> and note that A) also applies to the stable sequence (ft: t = 2) + 1,..., 2J+1). Thus, there exists a number P/ such that every shape where q1", q) ~ p/ is an element of A({F 2 J+1>', f 2 J+1}). Now we apply (2)
6 342* N. G. DE BRUIJN AND D. A. KLARNER repeated one-dimensional concatenation to shapes given in (1) and (2) to obtain the shape ql ~l'..., qj ~J> X ftj+l(j) + Y ftj+/(j), ftj+z"(j),..., ft,,"(j» (3) for all ql,..., qj ~ max (P1>p/), x, Y = 1,2,... where ft/, denotes the least common multiple of ftt and ftt'. Now observe that the greatest common divisor of ftj+l(j) and ftj+/(j) divides ~J+1' so there exists an integer PJ+l ~ max (PJ'p/) such that every number qj+1 ~J+ 1 with qj+1 ~ PJ+ 1 has the form x ftj+l(j) + Y ftj+l'(j) with x, Y ~ 1. Also, note that IttCj) and ft/(j) have the least common multiple ftt(j + 1) by definition forj = 1,..., n. Hence AJ implies AJ+l' This completes the proof. Second proof We shall prove (iii); the idea is modelled after the following proof (slightly longer than necessary) for the case k = 1. Let S be a set of positive integers. If S is empty, nothing has to be proved. If S is not empty, choose an hes. For any r (0 ~ r < h) with the property that A(S) contains a number = r (mod h) we select such a number. The set of selected numbers is denoted by D. Let q be some positive upper bound for the elements of this finite set D. We now havea(s) = A({h} u D u {I,...,q- I}) since every element of S exceeding q - 1 is the sum of an element of D and a non-negative multiple of h. We next proceed by induction with respect to the dimension k. We take n > 1 and assume the theorem correct for k = n - 1. One of the dimensions is singled out and referred to as "height". If oe= (al'..., an) is an n-dimensional shape we write (al'..., an-l) = a* (the "cross-section") and an = height (oe). Furthermore, if t is a positive integer we write oe*t= (al'..., an-i> t). As shapes of constant height can be treated as shapes of lower dimension, we note that if oe,oel,'.., a p are such that oe*e A({al*'..., oe/}) then oe*tea({al*t,..., oep*t}). Let S be a set of n-dimensional shapes. We put Y = {oe*: oee S}. By the induction hypothesis Yhas a finite subset Zwith Y A(Z). Take al'..., oepe S such that Z = {oel*'..., oep*}.we put p h = IT height 1=1 (oei)' Since h is a multiple of height (oei), we have oet*"e A( { oe}).if oeesthen oe*e Y, whence oe*e A( {oei*,..., oep*}).therefore oe*1ie A( {al *11,..., oep*1'}). Since h is a multiple of height (ai), we have al*l. E A(X). Thus we have proved: if oee S then oe*l'e A(X).
7 FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS 343* For 0 ~ r < h we consider T, = {a* : a E S, height (a) = r (mod h)}. By the induction hypothesis T, has a finite subset R, with T, s;; A(R r ). We select a finite subset Qr of S such that R, = {a* : a E Qr}. Let q be a positive integer such that height (ex) ~ q for all ex E R, and all r (0 ~ r < h). Let y be any element of S whose height m exceeds q; let r satisfy o ~ r < 11, m - r 0 (mod 11). For every ex E Qr we have a*" E A(X), and since m > q ~ height (ex), m _ height (ex) (mod h), we conclude ex*m E A(X U Qr). Furthermore y* E T, S;; A(Rr), whence y = y*ms;; A({ ex*m: a E Qr}) S;; A(X U Qr). Consequently: if fj E S, height (fj) > q, then fj E A(X U Qo U... U Q,.-l)' If 1 ~ i ~ q we consider the sets W, = {ex: a ES, height (a) = i}, V, = {a* : a E W,}. By the induction hypothesis V, has a finite subset U, with V, S;; A(U,). Let P, be the set of all shapes with height i and cross-section in V" Then W, S;; A(P,). Our final conclusion is that for every ex E S. This proves (iii). The theorem has the following interesting corollary. Let S be any set of shapes. A box with its shape in res) is called cleavable if some hyperplane cuts it into two non-empty boxes with shapes in res). Thus a non-cleavable box is a box which can be tiled with boxes having their shape listed in S, but never with a "fault" hyperplane. The corollary is that the set of shapes of non-cleavable boxes is either empty or finite. Note that every shape in Br is non-cleavable, and that every non-cleavable shape is in BA' REFERENCES 1) C. J. Bouwkamp and D. A. Klarner, J. recreational Math. 3, ló-26, ) D. A. Klarner and Frits Göbel, Indag. math. 31, , ) D. A. Klarner, J. comb. Theory. 7, , ) D. A. Klarner, A finite basis theorem revisited, Stanford Research Report. Stan-CS (Computer Science Department), February, 1973.
ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationWilson 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 informationConstructions for Higher Dimensional Perfect Multifactors
Constructions for Higher Dimensional Perfect Multifactors Garth Isaak AMS subject 05B99 (94A55) keywords: de Bruijn cycles, perfect maps Abstract Perfect maps, factors and multifactors can be viewed as
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationCMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017
CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More information252 P. ERDÖS [December sequence of integers then for some m, g(m) >_ 1. Theorem 1 would follow from u,(n) = 0(n/(logn) 1/2 ). THEOREM 2. u 2 <<(n) < c
Reprinted from ISRAEL JOURNAL OF MATHEMATICS Vol. 2, No. 4, December 1964 Define ON THE MULTIPLICATIVE REPRESENTATION OF INTEGERS BY P. ERDÖS Dedicated to my friend A. D. Wallace on the occasion of his
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationSubrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING
Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationConstructing c-ary Perfect Factors
Constructing c-ary Perfect Factors Chris J. Mitchell Computer Science Department Royal Holloway University of London Egham Hill Egham Surrey TW20 0EX England. Tel.: +44 784 443423 Fax: +44 784 443420 Email:
More information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More information2 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 informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationNumber 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 informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More information18 Divisibility. and 0 r < d. Lemma Let n,d Z with d 0. If n = qd+r = q d+r with 0 r,r < d, then q = q and r = r.
118 18. DIVISIBILITY 18 Divisibility Chapter V Theory of the Integers One of the oldest surviving mathematical texts is Euclid s Elements, a collection of 13 books. This book, dating back to several hundred
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More informationMODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.
MODEL ANSWERS TO HWK #7 1. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above by c on the left, we get 0
More informationUse 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 informationCOM 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 informationSolutions to Assignment 3
Solutions to Assignment 3 Question 1. [Exercises 3.1 # 2] Let R = {0 e b c} with addition multiplication defined by the following tables. Assume associativity distributivity show that R is a ring with
More informationCS 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 informationDivisibility 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 informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationON THE DENSITY OF SOME SEQUENCES OF INTEGERS P. ERDOS
ON THE DENSITY OF SOME SEQUENCES OF INTEGERS P. ERDOS Let ai
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More informationON 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 informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
More informationSYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime
More informationcou~rrl~ig Its Principles and Techniques (7) Koh Khee Meng M a111ematicai DL Y..
cou~rrl~ig Its Principles and Techniques (7) by Koh Khee Meng M a111ematicai DL Y.. 17. The Principle of Inclusion and Exclusion In Section 1 of[1], we introduced the Addition Principle (AP) which was
More informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationSums 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 informationFACTORIZATION AND THE PRIMES
I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary
More information6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
More information12 Sequences and Recurrences
12 Sequences and Recurrences A sequence is just what you think it is. It is often given by a formula known as a recurrence equation. 12.1 Arithmetic and Geometric Progressions An arithmetic progression
More informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More information1. 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 information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationAN EXTENSION OF A THEOREM OF EULER. 1. Introduction
AN EXTENSION OF A THEOREM OF EULER NORIKO HIRATA-KOHNO, SHANTA LAISHRAM, T. N. SHOREY, AND R. TIJDEMAN Abstract. It is proved that equation (1 with 4 109 does not hold. The paper contains analogous result
More informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
More informationTHE RADICAL OF A NON-ASSOCIATIVE ALGEBRA
THE RADICAL OF A NON-ASSOCIATIVE ALGEBRA A. A. ALBERT 1. Introduction. An algebra 21 is said to be nilpotent of index r if every product of r quantities of 21 is zero, and is said to be a zero algebra
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationpage 1 Total ( )
A B C D E F Costs budget of [Claimant / Defendant] dated [ ] Estimated page 1 Work done / to be done Pre-action Disbs ( ) Time ( ) Disbs ( ) Time ( ) Total ( ) 1 Issue /statements of case 0.00 0.00 CMC
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More information41st International Mathematical Olympiad
41st International Mathematical Olympiad Taejon, Korea, July 2000 1 Two circles Γ 1 and Γ 2 intersect at M and N Let l be the common tangent to Γ 1 and Γ 2 so that M is closer to l than N is Let l touch
More information36th United States of America Mathematical Olympiad
36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationCYCLICITY OF (Z/(p))
CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic
More informationUNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY
UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY ISAAC M. DAVIS Abstract. By associating a subfield of R to a set of points P 0 R 2, geometric properties of ruler and compass constructions
More informationGoldbach and twin prime conjectures implied by strong Goldbach number sequence
Goldbach and twin prime conjectures implied by strong Goldbach number sequence Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this note, we present a new and direct approach to prove the Goldbach
More informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More informationMATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.
MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationON THE NUMERICAL RANGE OF AN OPERATOR
ON THE NUMERICAL RANGE OF AN OPERATOR CHING-HWA MENG The numerical range of an operator P in a Hubert space is defined as the set of all the complex numbers (Tx, x), where x is a unit vector in the space.
More informationModular Arithmetic and Elementary Algebra
18.310 lecture notes September 2, 2013 Modular Arithmetic and Elementary Algebra Lecturer: Michel Goemans These notes cover basic notions in algebra which will be needed for discussing several topics of
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationInduction and recursion. Chapter 5
Induction and recursion Chapter 5 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms Mathematical Induction Section 5.1
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More informationAll 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 informationRMT 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 informationRigidity Results for Tilings by L-Tiles and Notched Rectangles
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 Introduction
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic
More informationPATH BUNDLES ON n-cubes
PATH BUNDLES ON n-cubes MATTHEW ELDER Abstract. A path bundle is a set of 2 a paths in an n-cube, denoted Q n, such that every path has the same length, the paths partition the vertices of Q n, the endpoints
More informationPrimes in the Semigroup of Non-Negative Matrices
Linear and Multilinear Algebra, 1974, Vol. 2, pp. 135-140 Gordon and Breach Science Publishers Ltd. Printed in Great Britain Primes in the Semigroup of Non-Negative Matrices DANIEL J. RICHMAN and HANS
More information64 P. ERDOS AND E. G. STRAUS It is possible that (1.1) has only a finite number of solutions for fixed t and variable k > 2, but we cannot prove this
On Products of Consecutive Integers P. ERDŐS HUNGARIAN ACADEMY OF SCIENCE BUDAPEST, HUNGARY E. G. STRAUSt UNIVERSITY OF CALIFORNIA LOS ANGELES, CALIFORNIA 1. Introduction We define A(n, k) = (n + k)!/n!
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationDiscrete 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 informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More information1. Algebra 1.7. Prime numbers
1. ALGEBRA 30 1. Algebra 1.7. Prime numbers Definition Let n Z, with n 2. If n is not a prime number, then n is called a composite number. We look for a way to test if a given positive integer is prime
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationInstructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test
Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important
More information