MATH 402 : 2017 page 1 of 6
|
|
- Lilian Stevenson
- 5 years ago
- Views:
Transcription
1 ADMINISTRATION What? Math 40: Enumerative Combinatorics Who? Me: Professor Greg Smith You: students interested in combinatorics When and Where? lectures: slot 00 office hours: Tuesdays at :30 6:30 and Wednesday 7:30 8:30 in 0 Jeffery Hall assessment: homework (40%: late problems sets are not accepted project (40%: detailed discussions in future lectures exam (0%: scheduled by registrar How? DO; one learns by working problems TALK mathematics with everyone you can READ; use multiple sources Why? problem solving skills communication skills beauty and elegance OVERVIEW What is enumerative combinatorics? In enumerative combinatorics, one counts the number of elements in a finite set or, more often, simultaneously count the number of elements in an infinite collection of sets. Subsets, partitions, and permutations of {,,...,n} are classic examples. Although these topics play a fundemental role in most areas of mathematics and computer science, the actual prerequisites are surprisingly small. I hope that this course will change the way you think about equations and power series. By design, the course will emphasis influential examples, techniques, and communication. Notation. Throughout the course, N := {0,,, 3,...} denotes the set of nonnegative integers. THE PIGEONHOLE PRINCIPLE This seemingly obvious statement produces unexpected results. Theorem (Pigeonhole Principle. If n objects are placed in r boxes where r < n, then at least one of the boxes contains more than one object. Proof. To establish a contradiction, assume that no box has more than one object. If there is no box with at least two objects, then each of the r boxes has either zero or one object in it. Let m be the number of boxes with zero objects in them; certainly m 0. It follows that there are r m boxes with one object. However, this means that the total number of objects placed in the r boxes is MATH 40 : 07 page of 6
2 r m r < n; contradiction. Therefore, our assumption is false and there exists at least one box with more than one object. Problem. Show that, if you pick cards from a standard deck of cards, then at least will be of the same suit. Solution. Each of the cards can belong to one of 4 suits. By the Pigeonhole Principle, two or more must belong to the same suit. Problem. Consider the sequence,3,7,,3,...; the jth element is a j := j+ for j N. If n is any odd integer, then this sequence contains an element that is divisible by n. Every odd integer has a multiple that is one less than a power of two. Solution. Focus on the first n elements of the sequence. If one of them is divisible by n, then we are done. Otherwise, consider their remainders modulo n; write a j = q j n + r j where 0 < r j < n and q j := a j /n. Since there are n distinct remainders, the Pigeonhole Principle implies that two elements of the sequence have the same remainder. If r j = r k where n > j > k > 0, then we have (q j q k n = a j a k = ( j+ ( k+ = j+ k+ = k+ ( j k = k+ a j k. It follows that n divides a j k, because k+ and n are relatively prime. Problem*. Given 0 points in the unit square, there exists points that are at most /3 units apart, and there exists 3 contained in a circle of radius /. Solution. Partition the unit square into nine squares of equal area. Since we have 0 points and 9 smaller squares, the Pigeonhole Principle implies that points lie in the same square. In a square, the points on the opposite corners have greatest distance between them. In our case, the Pythagorean Theorem implies that the distance is at most /3. Proposition* (From The Book. Given n integers a,a,...,a n, there is always a set of consecutive numbers a j+,a j+,...,a k with j < k whose sum k i= j+ a i is a multiple of n. Proof. Set N := {0,a,a +a,...,a +a + +a n } and R := {0,,...,n }. Consider the map f : N R where f (m is the remainder of m upon divison by n. Since N = n + > n = R, the Pigeonhole Principle implies that there are sums a + a + + a j and a + a + + a k with 0 j < k n and the same remainder. It follows that is a multiple of n. a j+ + a j+ + + a k = (a + a + + a j (a + a + + a k MATH 40 : 07 page of 6
3 THE GENERALIZED PIGEONHOLE PRINCIPLE Paul Erdős liked to talk about the The Book, in which God maintains the perfect proofs for mathematical theorems, following the dictum of G. H. Hardy that there is no premanent place for ugly mathematics. Erdős also said that you need not believe in God but, as a mathematician, you should believe in The Book. Notation. For n N, we set [n] := {,,3,...,n}, so [0] =, [] = {}, and [] = {,}. Proposition (From The Book. In any subset of [n] of cardinality n +, there are two relatively prime integers. Proof. Partition [n] into the n disjoint subsets (boxes: {,},{3,4},{,6},...,{n,n}. View the given subset as placing n + objects into these boxes. By the Pigeonhole Principle, there is box with at least two objects. In other words, the subset contains two consecutive integers and two numbers that differ by are relatively prime. Proposition (From The Book. In any subset of [n] of cardinality n +, there exists a pair of integers such that one divides the other. Remark. When n = 4, what happens? The possible pairs such that one divides the other are (,,(,4,(,6,(,8,(3,6,(4,8, so... Proof. Write every number in the given subset in the form k m where m is an odd number between and n. Since there are n + numbers in the subset, but only n different odd parts, the Pigeonhole Principle shows that there must be two numbers with the same odd part. Hence, one is a multiple of the other. Remark. Both Propositions are false if one replaces n + by n. {,4,6,...,n} and {n +,n +,...,n}. Indeed, consider the sets Theorem (Generalized Pigeonhole Principle. Let n and r be positive integers such that n > r. If n objects are placed in r boxes, then at least one of the boxes contains at least n r objects. Proof. In the language of mappings, the principle asserts that, for two finite sets N and R with N = n > r = R and any function f : N R, there exists an element m R with f (m nr. Otherwise, we would have f (m < n r for all a R and n = m R f (m ( < r nr = n which is absurd. Problem. Show that there are at least 4 people currently living in the Toronto Area who were born in the same hour of the same day of the same year. Solution. The verified oldest person lived less that 3 years (Jeanne Calment lived years, 64 days; , so we assume that all the residents of the Toronto Area are at most years old. As each year consists of at most 366 days, we have ((366(4 = boxes. Since there are at least 3794 Torontonians, the Generalized Pigeonhole Principle establishes that at least 3794/ > 4 people where born within 60 minutes of each other. Dirichlet used the Pigeonhole Principle to prove the existence of good rational approximations to irrational numbers. By taking the denominator to be q = n, it is easy to get an approximation whose error is at most /n. MATH 40 : 07 page 3 of 6
4 Theorem (Dirichlet 879. For any real number x and any positive integer n, there is a rational number p/q such that q n and x p q < nq q. Proof. Let {x} denote the fractional part of the real number x, so {x} := x x and 0 {x} <. Consider the n + numbers { jx}, where j n + and j Z, and the n boxes given by the intervals [0,/n,[/n,/n,...,[(n /n,n/n which partition [0,. By the Pigeonhole Principle, there exists an interval containing more than one of the numbers. If the numbers { jx} and {kx} with j > k belong to the same interval, then they differ by less than /n. Setting q := j k and p := jx kx, we have n > { jx} {kx} = jx jx kx + kx = ( j kx ( jx kx = qx p which yields x p/q < /nq. The Thue Siegel Roth theorem shows that this is essentially the tightest possible bound; the bound on rational approximation of algebraic numbers cannot be improved by increasing the exponent beyond. The next application of the Pigeonhole Principle is not immediate. Theorem* (Erdős Szekeres 939. In a sequence a,a,...,a mn+ of mn + distinct real numbers, there exists an increasing subsequence a i < a i < < a im+ where i < i < < i m+ of length m + or a deceasing subsequence a j > a j > > a jn+ with j < j < < j n+ of length n +. Proof. Associate to each element a i the length l i of a longest increasing subsequence starting at a i. If l i m+ for some i, then there is an increasing subsequence of length m+. Suppose otherwise, so we have l i m for i mn +. For the function a i l i mapping {a,a,...,a mn+ } to {,,...,m}, the Generalized Pigeonhole Principle implies that there exists some r [m] such that a i r for mn m + = n + elements. Let a j,a j,...,a jn+ with j < j < < j n+ be these elements. Look at two consecutive numbers a jk,a jk+ for some k n. If a jk < a jk+, then we could obtain an increasing subsequence of length r starting at a jk+ and consequently an increasing subsequence of length r + starting at a jk which cannot be since a jk r. Therefore, we obtain a decreasing subsequence a j > a j > > a jn+ of length n +. MATH 40 : 07 page 4 of 6
5 FIBONACCI NUMBERS Fibonacci considers the growth of an idealized (biologically unrealistic rabbit population, assuming that: a newly born pair of rabbits, one male, one female, are put in a field; rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits; rabbits never die and a mating pair always produces one new pair (one male, one female every month from the second month on. The puzzle that Fibonacci posed was: how many pairs will there be in one year? Definition. The Fibonacci numbers are defined by F 0 = 0, F =, and := + for all n. The first few numbers in the sequence are 0,,,,3,,8,3,,34,,89,44,33. This sequence has many remarkable properties. Problem. Show that F 0 + F + F + + = +. Solution. We proceed by induction on n. For n = 0, we have F 0 = 0 = = F, which establishes the base case. For n > 0, the induction hypothesis and the Fibonacci recurrence give F 0 + F + F + + = (F 0 + F + F = (+ + = (+ + = +. Problem. Prove that the Fibonacci number is even if and only n is divisible by 3. Solution. We proceed by induction. Since F 0 = 0, F =, and F =, the base case follows. For j > 0, suppose that F 3 j is even, F 3 j+ is odd, and F 3 j+ is odd. The next three Fibonacci numbers are which completes the induction. F 3( j+ = F 3 j+ + F 3 j+ = odd + odd = even F 3( j++ = F 3( j+ + F 3 j+ = even + odd = odd F 3( j++ = F 3( j++ + F 3( j+ = odd + even = odd, Theorem (Closed Formula. The Fibonacci numbers are given by = Proof. We can verify this formula as follows: F 0 = ( + 0 ( 0 = = 0 F = + = = = = = ( = ( + + = n ( n ( + + n ( n ( + + ( n ( + n ( 3+ ( n ( 3 n ( 6+ 4 n (! ( n ( 6 4 n ( n ( n n. = Fn. By mimicking the methods used to solve linear differential equations with constant coefficients, we can also rediscover this formula. MATH 40 : 07 page of 6
6 Proof. Suppose the recurrence relations = 0 has a solution of the form = x n. It follows that 0 = x n x n x n = x n (x x, so x = ±, 0. Since the Fibonacci recurrence ( is linear, the general solution has the form c + n ( + n c for some constants c and c. ( The initial conditions give 0 = c + c and = c + ( + ( c, so we obtain c = c and ( = c + ( ( = c + + = c. Therefore, the solution to the initial value problem is = ( + n ( n. Remark. This method generalizes to all linear recurrences. We will strength the analogy between recurrence relations and calculus later in the course. Definition. The Golden ratio is Some twentieth-century artists and architects have proportioned their works to approximate the golden ratio especially in the form of the golden rectangle, in which the ratio of the longer side to the shorter is the golden ratio believing this proportion to be aesthetically pleasing. The golden ratio also appears in some patterns in nature, including the spiral arrangement of leaves and other plant parts. + Problem*. Show that lim = + n. Solution. Set x n := + for n. Because > 0 for n > 0, we see that + = + > and x n > for n >. If the limit exists, then we have lim x n = x and n x = lim n x n = lim n + = lim n + + = lim = lim + n n + = lim n + = + lim = + n x n x = + + / + /x = + x x +. Hence, we obtain x x = 0. Since x, we conclude that x = + It remains to show that the limit exists. The equation x n = + ( ( implies that x n x n = + x n + x n = x n x n. = + = + = + x n x n x n. When x n x n < 0, it follows that x n x n < 0 and x n x n < x n x n x n x n = x n x n, so x n > x n > x n. Similarly, when x n x n > 0, we obtain x n < x n < x n. Since x =, x =, and x 3 = 3/, we have x > x 4 > x 6 > > x j > and x < x 3 < x < < x j < x j < x =. Hence, the odd term are increasing and bounded above, and the even terms are decreasing and bounded below, so these subsequences converge. The first paragraph show that the subsequences have the same limit, so the original sequence converges. MATH 40 : 07 page 6 of 6
Algorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More informationPutnam Pigeonhole Principle October 25, 2005
Putnam Pigeonhole Principle October 5, 005 Introduction 1. If n > m pigeons are placed into m boxes, then there exists (at least) one box with at least two pigeons.. If n > m, then any function f : [n]
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationLecture 8: Phyllotaxis, the golden ratio and the Fibonacci sequence
The 77 th Compton lecture series Frustrating geometry: Geometry and incompatibility shaping the physical world Lecture 8: Phyllotaxis, the golden ratio and the Fibonacci sequence Efi Efrati Simons postdoctoral
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 09 Tuesday, February 13 PROOFS and COUNTING Figure 1: Too Many Pigeons Theorem 9.1 (The Pigeonhole Principle (PHP)) If k + 1 or more pigeons fly to
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationLecture 6: The Pigeonhole Principle and Probability Spaces
Lecture 6: The Pigeonhole Principle and Probability Spaces Anup Rao January 17, 2018 We discuss the pigeonhole principle and probability spaces. Pigeonhole Principle The pigeonhole principle is an extremely
More informationMATH10040: 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 informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationFor math conventions used on the GRE, refer to this link:
GRE Review ISU Student Success Center Quantitative Workshop One Quantitative Section: Overview Your test will include either two or three 35-minute quantitative sections. There will be 20 questions in
More informationSolutions Best Student Exams Texas A&M High School Math Contest November 16, 2013
Solutions Best Student Exams Texas A&M High School Math Contest November 6, 20. How many zeros are there if you write out in full the number N = 0 (6 0000) = 0 (6 00) so there are 6 0 0 or N = (000000)
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions
Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k
More informationLecture 3: Miscellaneous Techniques
Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationOn the possible quantities of Fibonacci numbers that occur in some type of intervals
On the possible quantities of Fibonacci numbers that occur in some type of intervals arxiv:1508.02625v1 [math.nt] 11 Aug 2015 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
More information1) (JUNIOR 1 and SENIOR 1) Prove that if n is an even integer then. n(n + 1)(n + 2) 24
All Problems on Prize Exam Spring 2003 Version Date: Sat Mar :47:20 EST 2003 The secondary source of most of the problems on the prize exams is the Web site http://problems.math.umr.edu/index.htm (A web
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationFinals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016
Finals: Solutions ECS 20 (Fall 2009) Patrice Koehl koehl@cs.ucdavis.edu May 20, 2016 Part I: Logic Exercise 1 On a distant island, every inhabitant is either a Knight or Knave. Knights only tell the truth.
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationPreparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
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 informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMath 230 Final Exam, Spring 2008
c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
More informationHomework 7 Solutions, Math 55
Homework 7 Solutions, Math 55 5..36. (a) Since a is a positive integer, a = a 1 + b 0 is a positive integer of the form as + bt for some integers s and t, so a S. Thus S is nonempty. (b) Since S is nonempty,
More informationHomework 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 informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
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 informationMATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics
MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
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 informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationSummer HSSP Week 1 Homework. Lane Gunderman, Victor Lopez, James Rowan
Summer HSSP Week 1 Homework Lane Gunderman, Victor Lopez, James Rowan July 9, 2014 Questions 1 Chapter 1 Homework Questions These are the questions that should be turned in as homework. As mentioned in
More informationAn Introduction to Combinatorics
Chapter 1 An Introduction to Combinatorics What Is Combinatorics? Combinatorics is the study of how to count things Have you ever counted the number of games teams would play if each team played every
More informationCONTENTS NUMBER SYSTEMS. Number Systems
NUMBER SYSTEMS CONTENTS Introduction Classification of Numbers Natural Numbers Whole Numbers Integers Rational Numbers Decimal expansion of rational numbers Terminating decimal Terminating and recurring
More informationProblems 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 informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
More informationMath /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs
Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationMath 3012 Applied Combinatorics Lecture 5
September 1, 2015 Math 3012 Applied Combinatorics Lecture 5 William T. Trotter trotter@math.gatech.edu Test 1 and Homework Due Date Reminder Test 1, Thursday September 17, 2015. Taken here in MRDC 2404.
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationTenth Bit Bank Mathematics Real Numbers
Tenth Bit Bank Mathematics Real Numbers 1. The rational number among the following is... i) 4.28 ii) 4.282828... iii) 4.288888... A) i) & ii) B) ii) & iii) C) i) & iii) D) All the above 2. A rational number
More informationMATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2
MATH 80: ENUMERATIVE COMBINATORICS ASSIGNMENT KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(, n of the second ind is defined as the number of partitions of a [] into n non-empty blocs. We
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationExecutive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:
Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationStandards of Learning Content Review Notes. Grade 8 Mathematics 1 st Nine Weeks,
Standards of Learning Content Review Notes Grade 8 Mathematics 1 st Nine Weeks, 2016-2017 Revised September 2015 2 Mathematics Content Review Notes Grade 8 Mathematics: First Nine Weeks 2015-2016 -This
More informationCISC-102 Fall 2017 Week 1 David Rappaport Goodwin G-532 Office Hours: Tuesday 1:30-3:30
Week 1 Fall 2017 1 of 42 CISC-102 Fall 2017 Week 1 David Rappaport daver@cs.queensu.ca Goodwin G-532 Office Hours: Tuesday 1:30-3:30 Homework Homework every week. Keep up to date or you risk falling behind.
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationAS1051: Mathematics. 0. Introduction
AS1051: Mathematics 0 Introduction The aim of this course is to review the basic mathematics which you have already learnt during A-level, and then develop it further You should find it almost entirely
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationn(n + 2)(5n 1)(5n + 1)
All Problems on Prize Exam Spring 200 Version Date: Mon Mar 8 8:44:39 EST 200 The source for each problem is listed below when available; but even when the source is given, the formulation of the problem
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationGrade 7/8 Math Circles. Mathematical Thinking
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles March 22 & 23 2016 Mathematical Thinking Today we will take a look at some of the
More informationOne side of each sheet is blank and may be used as scratch paper.
Math 301 Fall 2017 (Practice) Midterm Exam 1 10/3/2017 Time Limit: 1 hour and 15 minutes Name: One side of each sheet is blank and may be used as scratch paper. Show your work clearly. Grade Table (for
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More informationGeneralization of Fibonacci sequence
Generalization of Fibonacci sequence Etienne Durand Julien Chartrand Maxime Bolduc February 18th 2013 Abstract After studying the fibonacci sequence, we found three interesting theorems. The first theorem
More informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
More informationof Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-007 Pythagorean Triples Diane Swartzlander University
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationArithmetic properties of lacunary sums of binomial coefficients
Arithmetic properties of lacunary sums of binomial coefficients Tamás Mathematics Department Occidental College 29th Journées Arithmétiques JA2015, July 6-10, 2015 Arithmetic properties of lacunary sums
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solving in Math (Math 43900) Fall 203 Week six (October ) problems recurrences Instructor: David Galvin Definition of a recurrence relation We met recurrences in the induction hand-out. Sometimes
More information35 Chapter CHAPTER 4: Mathematical Proof
35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21
More informationInfinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
More informationCounting. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Counting Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Counting Counting The art of counting is known as enumerative combinatorics. One tries to count the number of elements in a set (or,
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY YOU NEED TO PICK UP THE SYLLABUS, THE COURSE SCHEDULE, THE PROJECT INFO SHEET, TODAY S CLASS NOTES
More informationOn a Balanced Property of Compositions
On a Balanced Property of Compositions Miklós Bóna Department of Mathematics University of Florida Gainesville FL 32611-8105 USA Submitted: October 2, 2006; Accepted: January 24, 2007; Published: March
More informationMathematics Without Calculations It s a Beautiful Thing!
Sacred Heart University DigitalCommons@SHU Mathematics Faculty Publications Mathematics Department 8-4-2016 Mathematics Without Calculations It s a Beautiful Thing! Jason J. Molitierno Sacred Heart University,
More informationMATH 22. Lecture G: 9/23/2003 QUANTIFIERS & PIGEONHOLES
MATH 22 Lecture G: 9/23/2003 QUANTIFIERS & PIGEONHOLES But I am pigeon-livered, and lack gall To make oppression [and Math 22] bitter... Hamlet, Act 2, sc. 2 Copyright 2003 Larry Denenberg Administrivia
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationExample. How to Guess What to Prove
How to Guess What to Prove Example Sometimes formulating P (n) is straightforward; sometimes it s not. This is what to do: Compute the result in some specific cases Conjecture a generalization based on
More informationExam Practice Problems
Math 231 Exam Practice Problems WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the topics.
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Fall 018 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationSun Life Financial Canadian Open Mathematics Challenge Section A 4 marks each. Official Solutions
Sun Life Financial Canadian Open Mathematics Challenge 2015 Official Solutions COMC exams from other years, with or without the solutions included, are free to download online. Please visit http://comc.math.ca/2015/practice.html
More informationUNC Charlotte 2004 Algebra with solutions
with solutions March 8, 2004 1. Let z denote the real number solution to of the digits of z? (A) 13 (B) 14 (C) 15 (D) 16 (E) 17 3 + x 1 = 5. What is the sum Solution: E. Square both sides twice to get
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More information