Ma/CS 6a Class 24: More Generating Functions
|
|
- Chester Gardner
- 5 years ago
- Views:
Transcription
1 Ma/CS 6a Class 24: More Generating Functions Road signs from By Adam Sheffer Reminder: Generating Functions Given an infinite sequence of numbers a 0, a 1, a 2, the generating function of the sequence is the power series a 0 + a 1 x + a 2 x 2 + Example. Recall the Fibonacci numbers: F 0 = F 1 = 1 F i = F i 1 + F i 2. The corresponding generating function is 1 + x + 2x 2 + 3x 3 + 5x 4 + 1
2 Reminder: Using Generating Functions By rephrasing the solution to a problem as a generating function, we obtain a recursion relation such as A x = x + 5xA x 6x 2 A x. Solving the problem is equivalent to finding the power series representation of A x. Homogeneous Linear Recursion The generating function of the Fibonacci numbers A x = a 0 + a 1 x + a 2 x + satisfies a 0 = a 1 = 1. a i = a i 1 + a i 2 (for i 2). This is a special case of the homogeneous linear recursion (or HLR) defined as a 0 = c 0, a 1 = c 1,, a k 1 = c k 1. a n+k + d 1 a n+k d k a n = 0. 2
3 HLR Property Theorem. Given a generating function A x with an HLR recursion a n+k + d 1 a n+k d k a n = 0, we have A x = R x 1 + d 1 x + + d k x k, where R x is a polynomial and deg R x < k. Example: Fibonacci Numbers The generating function of the Fibonacci numbers A x = a 0 + a 1 x + a 2 x + satisfies a 0 = a 1 = 1. a i a i 1 a i 2 = 0 (for i 2). A x = 1 + x + x 2 a 0 + a 1 + x 3 a 1 + a 2 + = 1 + x 2 a 0 + a 1 x + a 2 x x a 0 + a 1 x + a 2 x 2 + = 1 + xa x + x 2 A x. 3
4 Fibonacci Numbers (cont.) We have A x = 1 + xa x + x 2 A x. That is, 1 A x = 1 x x 2. Proof of HLR Property We rewrite R x A x = 1 + d 1 x + + d k x k as R x = 1 + d 1 x + + d k x k A x = 1 + d 1 x + + d k x k ሺa 0 + a 1 x + a 2 x 2 4
5 The Auxiliary Equation The auxiliary equation of the HLR a 0 = c 0, a 1 = c 1,, a k 1 = c k 1. a n+k + d 1 a n+k d k a n = 0 is t k + d 1 t k d k = 0. If the auxiliary equation has k roots (not necessarily distinct), then we can rewrite it as t α 1 m 1 t α 2 m 2 t α s m s = 0, where m m s = k. Stronger HLR Property Theorem. Consider the sequence a 0, a 1,, that is defined by an HLR with auxiliary equation t α 1 m 1 t α 2 m 2 t α s m s = 0. Then a n = P 1 n α 1 n + P 2 n α 2 n + + P s n α s n, where P i n is a polynomial of degree at most m i 1. 5
6 Using the Stronger HLR Property Problem. Solve the following HLR. u 0 = 0, u 1 = 9, u 2 = 1, u 3 = 21. u n+4 5u n+3 + 6u n+2 + 4u n+1 8u n = 0. Solution. The auxiliary equation is t 4 5t 3 + 6t 2 + 4t 8 = 0. This can be rewritten as t 2 3 t + 1 = 0. By the theorem, we have u n = P 1 n α 1 n + P 2 n α 2 n = P 1 n 2 n + P 2 n 1 n. Solution (cont.) From the auxiliary equation t 2 3 t + 1 = 0, we know that u n = An 2 + Bn + C 2 n + D 1 n. From the initial values u 0 = 0, u 1 = 9, u 2 = 1, u 3 = 21, we get the system of equations C + D = 0, 2A + 2B + 2C D = 9, 16A + 8B + 4C + D = 1, 72A + 24B + 8C D = 21. 6
7 Concluding the Solution We have u n = An 2 + Bn + C 2 n + D 1 n. From the initial conditions, we obtain C + D = 0, 2A + 2B + 2C D = 9, 16A + 8B + 4C + D = 1, 72A + 24B + 8C D = 21. Solving these equations yield A = 1, B = 1, C = 3, D = 3. Therefore u n = n 2 n 3 2 n n. Pineapples Like Fibonacci Numbers! (the number of strips of each of the three types) 7
8 The Catalan Numers The Catalan numbers. An extremely useful sequence of numbers. In the exercises of the book Enumerative Combinatorics by Stanley, there are over 150 problems whose solution is the Catalan numbers. Obtained by Euler and Lamé (not Catalan!) Convex Polygons A polygon is convex if no line segment between two of its vertices intersects the outside of the polygon. Equivalently, every interior angle of a convex polygon is smaller than 180. Convex Not Convex 8
9 Triangulating of a convex Polygon A triangulation of a convex polygon P is the addition of non-crossing diagonals of P, partitioning the interior of P into triangles. Number of Triangulations Let c n denote the number of different triangulations of a convex polygon with n + 2 vertices. We set c 0 = 1. c 1 = 1. c 2 = 2. c 3 = 5. c 4 = 14. 9
10 A Recursive Relation We have initial values for c n. Now we need a recursive relation. Consider a side ab of an n-sided convex polygon P. In every triangulation, ab belongs to exactly one triangle Δ. The third vertex of Δ can be any of the other n 2 vertices of P. A Recursive Relation (cont.) The number of triangulations that contain the triangle abv 4 is c 2 c 3. The number of triangulations that contain the triangle abv 5 is c 1 c 4. Recursive relation: n 3 c n 2 = c i c n 3 i. i=0 10
11 Are the Catalans an HLR? We have the initial values c 0 = 1, c 1 = 1, c 2 = 2, c 3 = 5, c 4 = 14. We have the relation n 3 c n 2 = c i c n 3 i. i=0 Is this an HLR? No! This is not linear and number of elements in the recursion changes according to n. Solving the Recurence We have the generating series C x = c 0 + c 1 x + c 2 x 2 + We consider C x 2 = c 0 c 0 + c 0 c 1 + c 1 c 0 x + c 0 c 2 + c 1 c 1 + c 2 c 0 x 2 + Writing C x 2 = σ n d n x n, we get n d n = c i c n i, i=0 we have C x 2 = 1 + c 2 x + c 3 x
12 Solving the Recursion (cont.) We have C x 2 = 1 + c 2 x + c 3 x 2 +. That is, C x = 1 + xc x 2. Solving the Recursion (cont.) We have C x = 1 + xc x 2. Setting y = C x, we obtain the quadratic equation xy 2 y + 1 = 0, or C x = y = 1 ± 1 4x. 2x How can we handle 1 4x? 12
13 More Binomial Formulas Recall that x + 1 n = i 0 n i x i. m m m 1 m n+1 By defining = also for n n! negative m s, this formula is generalized also to negative powers. We can also consider values of m that are not integers! The binomial formula holds for fractional n (we will not prove this). Fractional Powers Using the fractional formula, we have 1 4x 1/2 1/2 = 4x i i = 1 + 1/2 1! This implies C x = 1 ± i=0 ሺ 4x) + 1 4x 2x = x 2 + 2! 1 ± σ 1/2 i=0 i 2x 4x i. 13
14 Two Solutions C x = 1 ± 1 4x 1 ± σ 1/2 i=0 4x i = i. 2x 2x Considering the plus and minus cases separately, we have C x = 1 1/2 2 ሺ 4) i x i 1. i i=1 C + x = 1 x + 1 1/2 2 i i=1 4 i x i. The Correct Solution C x = 1 1/2 2 n n=1 4 n x n 1. C + x = 1 x + 1 1/2 2 n n=1 4 n x n. Which one is the correct solution? We saw that x 1 is not well defined! c n = 1 1/2 n n + 1 = ሺ 4)n+1 2 n + 1! n
15 Tidying Up c n = ሺ 4)n+1 2 n + 1! n 1 2 = 2n n + 1! n 1 = 2n n + 1! ሺ2n)! n! 2 n = 1 n + 1 2n n. Happy Thanksgiving! 15
Logic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution
Logic and Discrete Mathematics Section 6.7 Recurrence Relations and Their Solution Slides version: January 2015 Definition A recurrence relation for a sequence a 0, a 1, a 2,... is a formula giving a n
More informationMa/CS 6a Class 25: Partitions
Ma/CS 6a Class 25: Partitions Explain the significance of the following sequence: un, dos, tres, quatre, cinc, sis, set, vuit, nou, deu... By Adam Sheffer Answer These are the Catalan numbers! (The numbers
More informationCatalan numbers Wonders of Science CESCI, Madurai, August
Catalan numbers Wonders of Science CESCI, Madurai, August 25 2009 V.S. Sunder Institute of Mathematical Sciences Chennai, India sunder@imsc.res.in August 25, 2009 Enumerative combinatorics Enumerative
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More informationGenerating Function Notes , Fall 2005, Prof. Peter Shor
Counting Change Generating Function Notes 80, Fall 00, Prof Peter Shor In this lecture, I m going to talk about generating functions We ve already seen an example of generating functions Recall when we
More informationMa/CS 6a Class 23: Generating Functions
Ma/CS 6a Class 23: Generating Functions By Adam Sheffer Recall: Power Series We define sums and products of power series as in the case of polynomials. A x = a 0 + a 1 x + a 2 x 2 + B x = b 0 + b 1 x +
More informationGenerating Functions
8.30 lecture notes March, 0 Generating Functions Lecturer: Michel Goemans We are going to discuss enumeration problems, and how to solve them using a powerful tool: generating functions. What is an enumeration
More informationCatalan Numbers. Richard P. Stanley. June 9, 2017
Catalan Numbers Richard P. Stanley June 9, 2017 An OEIS entry OEIS: Online Encylopedia of Integer Sequences (Neil Sloane). See http://oeis.org. A database of over 270,000 sequences of integers. An OEIS
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
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 informationContents. Counting Methods and Induction
Contents Counting Methods and Induction Lesson 1 Counting Strategies Investigations 1 Careful Counting... 555 Order and Repetition I... 56 3 Order and Repetition II... 569 On Your Own... 573 Lesson Counting
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationMa/CS 6a Class 19: Group Isomorphisms
Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x,
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 informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationGenerating functions in enumerative geometry
Generating functions in enumerative geometry Ragni Piene ICREM 5 Bandung, Indonesia October 22, 2011 Counting 1 Counting 2 Counting 3 Partitions Let n be a positive integer. In how many ways p(n) can we
More informationLivingston American School 4TH Quarter Lesson Plan
Livingston American School 4TH Quarter Lesson Plan Week 27 Week 28 Week 29 Week 30 Concept / Topic To Teach: Find the distance between two points and find the midpoint of the line segment Use the distance
More informationSolutions to Exercises Chapter 10: Ramsey s Theorem
Solutions to Exercises Chapter 10: Ramsey s Theorem 1 A platoon of soldiers (all of different heights) is in rectangular formation on a parade ground. The sergeant rearranges the soldiers in each row of
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationRiemann surfaces. Paul Hacking and Giancarlo Urzua 1/28/10
Riemann surfaces Paul Hacking and Giancarlo Urzua 1/28/10 A Riemann surface (or smooth complex curve) is a complex manifold of dimension one. We will restrict to compact Riemann surfaces. It is a theorem
More informationYear 1: Fall. HSA Topics - 2 Year Cycle
Year 1: Fall Primes and divisibility Derive divisibility rules for 2,3,5,6,9,10,11 Optional:Derive divisibility rules for larger primes such as 7, 13, 17, etc Show Euclid s proof of the infinitude of primes
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationNotes on the Catalan problem
Notes on the Catalan problem Daniele Paolo Scarpazza Politecnico di Milano March 16th, 2004 Daniele Paolo Scarpazza Notes on the Catalan problem [1] An overview of Catalan problems
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Spring 018 (instructor Val Tannen) Lecture 11 Tuesday, February 0 PROOFS: STRONG INDUCTION Example 1.1 Any integer n can be written as the product of one or more (not necessarily distinct) prime
More informationMa/CS 6b Class 15: The Probabilistic Method 2
Ma/CS 6b Class 15: The Probabilistic Method 2 By Adam Sheffer Reminder: Random Variables A random variable is a function from the set of possible events to R. Example. Say that we flip five coins. We can
More informationJumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese
Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October
More informationRecurrences COMP 215
Recurrences COMP 215 Analysis of Iterative Algorithms //return the location of the item matching x, or 0 if //no such item is found. index SequentialSearch(keytype[] S, in, keytype x) { index location
More informationA Variation of the nil-temperley-lieb algebras of type A
A Variation of the nil-temperley-lieb algebras of type A Niket Gowravaram Abstract We investigate a variation on the nil-temperley-lieb algebras of type A. This variation is formed by removing one of the
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2014 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationCBSE Class IX Syllabus. Mathematics Class 9 Syllabus
Mathematics Class 9 Syllabus Course Structure First Term Units Unit Marks I Number System 17 II Algebra 25 III Geometry 37 IV Co-ordinate Geometry 6 V Mensuration 5 Total 90 Second Term Units Unit Marks
More informationbesides your solutions of these problems. 1 1 We note, however, that there will be many factors in the admission decision
The PRIMES 2015 Math Problem Set Dear PRIMES applicant! This is the PRIMES 2015 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 2015. For complete rules,
More informationApproaches differ: Catalan numbers
ISSN: 2455-4227 Impact Factor: RJIF 5.12 www.allsciencejournal.com Volume 2; Issue 6; November 2017; Page No. 82-89 Approaches differ: Catalan numbers 1 Mihir B Trivedi, 2 Dr. Pradeep J Jha 1 Research
More informationSample. An Incremental Development. John H. Saxon, Jr. Third Edition. Used by Permission SAXON PUBLISHERS, INC.
An Incremental Development Third Edition John H. Saxon, Jr. SAXON PUBLISHERS, INC. Algebra 1: An Incremental Development Third Edition Copyright 2003 by Saxon Publishers, Inc. All rights reserved. No part
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 informationThe Essentials of CAGD
The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000
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 informationCBSE OSWAAL BOOKS LEARNING MADE SIMPLE. Published by : 1/11, Sahitya Kunj, M.G. Road, Agra , UP (India) Ph.: ,
OSWAAL BOOKS LEARNING MADE SIMPLE CBSE SOLVED PAPER 2018 MATHEMATICS CLASS 9 Published by : OSWAAL BOOKS 1/11, Sahitya Kunj, M.G. Road, Agra - 282002, UP (India) Ph.: 0562 2857671, 2527781 email: contact@oswaalbooks.com
More informationThe Advantage Testing Foundation Solutions
The Advantage Testing Foundation 2016 Problem 1 Let T be a triangle with side lengths 3, 4, and 5. If P is a point in or on T, what is the greatest possible sum of the distances from P to each of the three
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More informationUNC Charlotte Super Competition Level 3 Test March 4, 2019 Test with Solutions for Sponsors
. Find the minimum value of the function f (x) x 2 + (A) 6 (B) 3 6 (C) 4 Solution. We have f (x) x 2 + + x 2 + (D) 3 4, which is equivalent to x 0. x 2 + (E) x 2 +, x R. x 2 + 2 (x 2 + ) 2. How many solutions
More informatione x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form
Taylor Series Given a function f(x), we would like to be able to find a power series that represents the function. For example, in the last section we noted that we can represent e x by the power series
More informationNumber Theory and Algebraic Equations. Odile Marie-Thérèse Pons
Number Theory and Algebraic Equations Odile Marie-Thérèse Pons Published by Science Publishing Group 548 Fashion Avenue New York, NY 10018, U.S.A. http://www.sciencepublishinggroup.com ISBN: 978-1-940366-74-6
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationCh 5.7: Series Solutions Near a Regular Singular Point, Part II
Ch 5.7: Series Solutions Near a Regular Singular Point, Part II! Recall from Section 5.6 (Part I): The point x 0 = 0 is a regular singular point of with and corresponding Euler Equation! We assume solutions
More informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationMa/CS 6a Class 4: Primality Testing
Ma/CS 6a Class 4: Primality Testing By Adam Sheffer Reminder: Euler s Totient Function Euler s totient φ(n) is defined as follows: Given n N, then φ n = x 1 x < n and GCD x, n = 1. In more words: φ n is
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 informationAdvanced Counting Techniques
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Advanced Counting
More informationTrig Identities. or (x + y)2 = x2 + 2xy + y 2. Dr. Ken W. Smith Other examples of identities are: (x + 3)2 = x2 + 6x + 9 and
Trig Identities An identity is an equation that is true for all values of the variables. Examples of identities might be obvious results like Part 4, Trigonometry Lecture 4.8a, Trig Identities and Equations
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationCOURSE STRUCTURE CLASS IX Maths
COURSE STRUCTURE CLASS IX Maths Units Unit Name Marks I NUMBER SYSTEMS 08 II ALGEBRA 17 III COORDINATE GEOMETRY 04 IV GEOMETRY 28 V MENSURATION 13 VI STATISTICS & PROBABILITY 10 Total 80 UNIT I: NUMBER
More information2 Series Solutions near a Regular Singular Point
McGill University Math 325A: Differential Equations LECTURE 17: SERIES SOLUTION OF LINEAR DIFFERENTIAL EQUATIONS II 1 Introduction Text: Chap. 8 In this lecture we investigate series solutions for the
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationFigurate Numbers: presentation of a book
Figurate Numbers: presentation of a book Elena DEZA and Michel DEZA Moscow State Pegagogical University, and Ecole Normale Superieure, Paris October 2011, Fields Institute Overview 1 Overview 2 Chapter
More informationMathematics Class 9 Syllabus. Course Structure. I Number System 17 II Algebra 25 III Geometry 37 IV Co-ordinate Geometry 6 V Mensuration 5 Total 90
Mathematics Class 9 Syllabus Course Structure First Term Units Unit Marks I Number System 17 II Algebra 25 III Geometry 37 IV Co-ordinate Geometry 6 V Mensuration 5 Total 90 Second Term Units Unit Marks
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationPutnam Solutions, 2007
Putnam Solutions, 7 These solutions are based on discussions among our contestants (and our friends from Carlton College) Saturday afternoon and evening, with revisions as various errors were caught by
More informationCMSC Discrete Mathematics FINAL EXAM Tuesday, December 5, 2017, 10:30-12:30
CMSC-37110 Discrete Mathematics FINAL EXAM Tuesday, December 5, 2017, 10:30-12:30 Name (print): Email: This exam contributes 40% to your course grade. Do not use book, notes, scrap paper. NO ELECTRONIC
More informationChapter 7 Quadratic Equations
Chapter 7 Quadratic Equations We have worked with trinomials of the form ax 2 + bx + c. Now we are going to work with equations of this form ax 2 + bx + c = 0 quadratic equations. When we write a quadratic
More informationFunctions of Several Variables: Limits and Continuity
Functions of Several Variables: Limits and Continuity Philippe B. Laval KSU Today Philippe B. Laval (KSU) Limits and Continuity Today 1 / 24 Introduction We extend the notion of its studied in Calculus
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 informationQuestion 1. Find the coordinates of the y-intercept for. f) None of the above. Question 2. Find the slope of the line:
of 4 4/4/017 8:44 AM Question 1 Find the coordinates of the y-intercept for. Question Find the slope of the line: of 4 4/4/017 8:44 AM Question 3 Solve the following equation for x : Question 4 Paul has
More information2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016
6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge
More informationThe problematic art of counting
The problematic art of counting Ragni Piene SMC Stockholm November 16, 2011 Mikael Passare A (very) short history of counting: tokens and so on... Partitions Let n be a positive integer. In how many ways
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More information2015 IMO Shortlist. a k+1 a 2 k. (s r n)x r x s, 1 r<s 2n
IMO Shortlist 2015 Algebra A1 Suppose that a sequence a 1,a 2,... of positive real numbers satisfies a k+1 a 2 k ka k +(k 1) for every positive integer k. Prove that a 1 +a 2 +...+a n n for every n 2.
More information5.3 SOLVING TRIGONOMETRIC EQUATIONS
5.3 SOLVING TRIGONOMETRIC EQUATIONS Copyright Cengage Learning. All rights reserved. What You Should Learn Use standard algebraic techniques to solve trigonometric equations. Solve trigonometric equations
More informationDue to the detail of some problems, print the contests using a normal or high quality setting.
General Contest Guidelines: Keep the contests secure. Discussion about contest questions is not permitted prior to giving the contest. Due to the detail of some problems, print the contests using a normal
More informationN M L Nova S. Scotia League. Math. Game One SOLUTIONS
N M L Nova S Math Scotia League 11 1 Game One SOLUTIONS Team Question Solutions 1. Clearly there s nothing special about the number 11 in this contet. The question is really asking about the relative sizes
More informationNEWTON POLYGONS AND FAMILIES OF POLYNOMIALS
NEWTON POLYGONS AND FAMILIES OF POLYNOMIALS ARNAUD BODIN Abstract. We consider a continuous family (f s ), s [0,1] of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate.
More informationMa/CS 6a Class 18: Groups
Ma/CS 6a Class 18: Groups = Rotation 90 Vertical flip Diagonal flip 2 By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G, we
More informationAnimals and 2-Motzkin Paths
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 8 (2005), Article 0556 Animals and 2-Motzkin Paths Wen-jin Woan 1 Department of Mathematics Howard University Washington, DC 20059 USA wwoan@howardedu
More information15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012
1 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 01 1. Let f be the function such that f(x) = { x if x 1 x if x > 1 What is the total length of the graph of f(f(...f(x)...)) from x =
More informationMATH PRIZE FOR GIRLS. Test Version A
Advantage Testing Foundation Ath The Eighth rize For Annual irls MATH PRIZE FOR GIRLS Saturday, September 10, 2016 TEST BOOKLET Test Version A DIRECTIONS 1. Do not open this test until your proctor instructs
More informationCopyright 2016 Pearson Education, Inc. or its affiliates. All rights reserved. NES, the NES logo, Pearson, the Pearson logo, and National Evaluation
Mathematics (304) Copyright 2016 Pearson Education, Inc. or its affiliates. All rights reserved. NES, the NES logo, Pearson, the Pearson logo, and National Evaluation Series are trademarks, in the U.S.
More informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT40 Winter Semester 015/16 (Due to organisational reasons register for the course at TU and KFU) Edited by Mihyun Kang TU Graz Contents I Lectures
More informationMA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm
MA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm David L. Finn December 16th, 2004 Today, we introduce barycentric coordinates as an alternate to using
More informationFourth Lecture: 11/4
Fourth Lecture: 11/4 Definition 4.1. A sequence a n ) n=1 of complex numbers is said to be defined recursively, or to satsify a recurrence relation, if there exists a fixed k N, called the degree of the
More informationWarm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov
Writing more proofs Misha Lavrov ARML Practice 3/16/2014 and 3/23/2014 Warm-up Using the quantifier notation on the reference sheet, and making any further definitions you need to, write the following:
More informationTERMWISE SYLLABUS SESSION CLASS-IX SUBJECT : MATHEMATICS. Course Structure. Schedule for Periodic Assessments and CASExam. of Session
TERMWISE SYLLABUS SESSION-2018-19 CLASS-IX SUBJECT : MATHEMATICS Course Structure Units Unit Name Marks I NUMBER SYSTEMS 08 II ALGEBRA 17 III COORDINATE GEOMETRY 04 IV GEOMETRY 28 V MENSURATION 13 VI STATISTICS
More informationMATH Spring 2010 Topics per Section
MATH 101 - Spring 2010 Topics per Section Chapter 1 : These are the topics in ALEKS covered by each Section of the book. Section 1.1 : Section 1.2 : Ordering integers Plotting integers on a number line
More informationPassing from generating functions to recursion relations
Passing from generating functions to recursion relations D Klain last updated December 8, 2012 Comments and corrections are welcome In the textbook you are given a method for finding the generating function
More informationMa/CS 6b Class 12: Graphs and Matrices
Ma/CS 6b Class 2: Graphs and Matrices 3 3 v 5 v 4 v By Adam Sheffer Non-simple Graphs In this class we allow graphs to be nonsimple. We allow parallel edges, but not loops. Incidence Matrix Consider a
More informationMa/CS 6b Class 3: Stable Matchings
Ma/CS 6b Class 3: Stable Matchings α p 5 p 12 p 15 q 1 q 7 q 12 β By Adam Sheffer Neighbor Sets Let G = V 1 V 2, E be a bipartite graph. For any vertex a V 1, we define the neighbor set of a as N a = u
More informationAlgebraic Expressions
ALGEBRAIC EXPRESSIONS 229 Algebraic Expressions Chapter 12 12.1 INTRODUCTION We have already come across simple algebraic expressions like x + 3, y 5, 4x + 5, 10y 5 and so on. In Class VI, we have seen
More informationFrom the definition of a surface, each point has a neighbourhood U and a homeomorphism. U : ϕ U(U U ) ϕ U (U U )
3 Riemann surfaces 3.1 Definitions and examples From the definition of a surface, each point has a neighbourhood U and a homeomorphism ϕ U from U to an open set V in R 2. If two such neighbourhoods U,
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationJoe Holbrook Memorial Math Competition
Joe Holbrook Memorial Math Competition 8th Grade Solutions October 9th, 06. + (0 ( 6( 0 6 ))) = + (0 ( 6( 0 ))) = + (0 ( 6)) = 6 =. 80 (n ). By the formula that says the interior angle of a regular n-sided
More informationBasic Equation Solving Strategies
Basic Equation Solving Strategies Case 1: The variable appears only once in the equation. (Use work backwards method.) 1 1. Simplify both sides of the equation if possible.. Apply the order of operations
More informationA LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS
Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationTopology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7
Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Question 1: The goal of this exercise is to give some equivalent characterizations for the interior of a set. Let X be a topological
More informationPolynomial Interpolation Part II
Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session
More informationScott%County%Public%Schools%
!! & & Scott%County%Public%Schools%! Eighth&Grade&Mathematics& Revised&2013& & & Pacing&Guide&and&Curriculum&Map& Scott County Pacing Guide 8 th Grade Math Intro Unit - 4 days School Procedures Classroom
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More information2013 IMO Shortlist. a b c d 1
IMO Shortlist 2013 Algebra A1 A2 Letnbeapositiveintegerandleta 1,...,a n 1 bearbitraryrealnumbers. Define the sequences u 0,...,u n and v 0,...,v n inductively by u 0 = u 1 = v 0 = v 1 = 1, and u k+1 =
More informationGLOSSARY TERM DEFINITIONS
Course: 1205080 M/J Mathematics 3, Advanced RELATED GLOSSARY TERM DEFINITIONS (79) Absolute value: Algebraic expression: Angle: Approximate: Area: Benchmark: Central tendency: Congruent: Continuous data:
More informationMa/CS 6a Class 19: Isomorphisms and Subgroups
Ma/CS 6a Class 19: Isomorphisms and Subgroups By Adam Sheffer Reminder: A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G, we have x y G. Associativity.
More information