NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

Size: px
Start display at page:

Download "NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) ="

Transcription

1 AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each, ad attempt to relate the two sets i a few differet ways.. Itroductio to the Schröder ad Ukow umbers Defiitio. A Schröder path is a lattice path that starts o the x-axis, eds o the x-axis, ever goes below the axis ad is costructed by the steps, ),, ) ad 2, 0). We will let R deote the umber of Schröder paths of legth 2. Defiitio 2. A peak is a up-step,, ), followed immediately by a dow-step,, ). We will say that the height of a peak is k if the top of the peak is at height k i the path. Defiitio 3. A set of umbers, which we will call the Ukow umbers, cout the umber of Schröder paths which have o peaks at height oe, ad o horizotal edges at height zero. We will let U deote the th Ukow umber, which couts such Schröder paths of legth 2. These types of paths will be referred to as Ukow paths. Defiitio 4. We will call a o-empty path prime i some set of paths S if it caot be factored ito smaller paths p ad p 2 such that both p ad p 2 are i S. 2. Some geeratig fuctios It is kow see []) that if ax) is a geeratig fuctio that couts some set of paths S that ca all be uiquely factored ito primes, ad if px) is the geeratig fuctio that couts the prime paths i S the ax) = px). To determie some formulas for the geeratig fuctio of the Schröder umbers, rx) = R x, lets look at the prime Schröder paths. We will cosider the primes of the Schröder paths to be ay path which starts ad eds o the x-axis ad ever touches it ibetwee. It is clear that a path of this type ca ot be factored further. We will weight each step i the geeratig fuctio for Schröder paths by x. We kow that a sigle horizotal step has legth 2 ad is prime. So the horizotal step is couted by x. Also, it is clear that a up-step followed by a arbitrary Schröder path of legth 2 2 followed by a dow-step is prime path of legth 2. It should be easy to covice yourself that these are the oly prime paths. This iterpretatio leads us to the geeratig fuctio of the prime Schröder paths px) = x xsx). Ad fially this gives us that Date: 5//2003.

2 2 NICK DUFRESNE We ca rearrage this to get that rx) = x xrx). 2.) rx) = xrx) xrx) ) Solvig 2.2) for rx) usig the quadratic formula ad selectig the solutio that gives a power series we get that rx) = x 6x x ) 2x Usig the same approach as for the Schröder umbers we ca discover some formulas for the geeratig fuctio for the Ukow umbers ux) = U x. We kow that the prime Ukow paths caot have ay horizotal steps o the x-axis or ay peaks of height. It is ot too difficult to see that the oly type of prime Ukow path is of the form up-step followed by a o-empty Schröder path followed by a dow-step. That is, a prime path of legth 2 is a up-step followed by a Schröder path of legth 2 2 followed by a dow-step, which is couted by R x sice there is a uique prime for every Schröder path of legth 2 2. This gives us that the geeratig fuctio for the primes is px) = =2 R x, or equivaletly px) = xrx) ). Usig the secod versio we see that this gives us ux) = xrx) ). 2.4) If we substitute 2.3) i for rx) we fid that ux) = 3x 6x x ) 2x3 2x) 3. Paths with a eve umber of peaks I this sectio we will see that half of the Ukow paths of legth 2 have a eve umber of peaks. To prove this lets cosider the subset S of the paths couted by U where we cosider oly paths with a eve umber of peaks. Now we eed to show that S is couted by U 2. To do this lets cosider ay path p i S. Lets take p to be the path of p where all peaks i p are replaced by horizotal steps. We kow that p is still a path couted by U, because if ay of the ew horizotal steps were at height zero that would imply that p had a peak at height. Now, lets say that p has horizotal steps. We ca replace ay umber of horizotal steps i p with peaks a up-step followed by a dow-step) ad the result is a path i U. This tells us that there are k) paths with k peaks resultig from p. So if is eve the umber of paths with a odd umber of peaks resultig from p is ) 3) ) which is equal to 0) 2) ) which is the umber of paths resultig from p with a eve umber of peaks. Ad if is odd similarly the umber of odd peaks resultig from p is ) 3) ) = 0) ) 2 ) which is agai the umber of paths with a eve umber of peaks resultig from p. Sice every path couted by U ca be reduced ito a path with oly horizotal steps, ad every path of this type results i a equal umber of paths with ad odd umber of peaks ad eve umber of peaks, we have that S is couted by U 2.

3 AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS 3 Sice the Schröder paths have the same structure as the Ukow paths the same argumet applies for them. So we have that the umber of Schröder paths of legth 2 with a eve umber of peaks is R Paths with a iitial ru of up-steps of eve legth Defiitio 5. A ru is a series of cosecutive steps all of the same type. Similar to the previous sectio, we ca show that the umber of Ukow paths with a iitial ru of eve legth is couted by 2 U. To see this lets cosider the followig fuctio f from Ukow paths with a eve umber of iitial up-steps U eve to Ukow paths with a odd umber of iitial up-steps U odd. Take u to be some path i U eve with a iitial ru of legth 2k. We kow that the step followig the iitial ru must be either a dow-step or a horizotal step otherwise the step would be icluded i the ititial ru). If the step followig the iitial ru is a horizotal step, we replace it with a up-step followed by a dow-step a peak) to get u. Clearly this leaves u with a iitial ru of legth 2k so it is i U odd. If the step after the iitial ru is a dow-step we take u to be u where we replace the previous up-step ad the dow-step with a horizotal step. Note that this will ot place a horizotal step o the x-axis sice the iitial ru must have legth at least 2. This will leave u with a iitial ru of legth 2k so it will be i U odd. This process is uique so it is oe-to-oe. Also we ca see that applyig f to fu) gives back u, so for ay u i U odd we have fu ) is i U eve by a similar argumet as before) ad ffu )) = u. So f is oto. This implies that we have foud a bijectio betwee Ukow paths with a iitial ru of eve legth ad Ukow paths with a iitial ru of odd legth. So half of U couts U eve. Agai, because the Schröder paths have a similar structure to the Ukow paths this argumet holds for them also. So 2 R also couts Schröder paths with a iitial ru of eve legth. 5. A Recurrece Relatio for The Schröder Numbers From 2.3) we kow that rx) = R x = x 6x x 2. 2x For ease of calculatio let ax) = 2xrx). The a x) = ax)) x = 2 3 x) 6x x 2 6x x 2 Multiplyig a x) by it deomiator we see we are left with somethig similar to ax). We fid that 6x x 2 )a x) 3 x)ax) = 2 2x. 5.)

4 4 NICK DUFRESNE From this differetial equatio we ca derive a simple recurrece relatio for the Schröder umbers. To do this we should ote that the derivative of the geeratig fuctio rx) is r x) = R x. Let us defie R to be zero for less tha zero. Usig this fact ad that ax) = 2R x ad a x) = 2 )R x we ca ow write equatio 5.) to be 2x 2 = 6x x 2 ) 2 )R x 3 x) 2R x = = 2 )R x 2 )R x 2 )R x 2 2 )R x 6R x 2R x 2 )R 2 x 6R x 2R x 2 2R 2 x Now lookig at the coefficiets of x where > ) i this equatio we see that o the left side we get zero, ad o the right side we get [x ] 2 )R x [x ] 2R x [x ] 2 )R 2 x [x ] 6R x [x ] 2R 2 x = 2 2)R 2R 2 2)R 2 6R 2R 2 Now equatig both sides, dividig by 2 ad simplifyig we fid that From 2.5) we have )R = 6 3)R 2)R 2 5.2) 6. A Recurrece Relatio for The Ukow Numbers ux) = U x = 3x 6x x 2 6x 4x 2.

5 AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS 5 Agai, to make the calculatio a little easier we will take bx) = 6x 4x 2 )ux). Note that this makes ad bx) = 6U x 4U 2 x 6.) = =2 b x) = 6 )U x From the closed form of the geeratig fuctio ux) we see that 4 )U x 6.2) = b x) = 3 8x 3x 2 3 x) 6x x 2 This looks very similar to what we foud previously for the Schröder umbers. We fid that bx) satisfies differetial equatio 6x x 2 )b x) 3 x)bx) = 6 0x. We will defie U to be zero for less tha zero. Next substitutig i equatios 6.) ad 6.2) we fid that 6 0x = 6 )U x 4 )U x 36U x 24U 2 x 6 )U 2 x Now equatig the coefficiets of x i this equatio we fid that 4 )U 3 x. 3 3)U = 6 )U 9U 2 2 4)U ) 7. Combiig the Schroder ad Ukow Numbers We would like to be able to express the Schröder umbers i relatio to the Ukow umbers. Usig 2.3) ad 2.5) we see that 3 2x)ux) = rx) 2 Usig the same method i the previous two sectios to express relatios betwee coefficiets of x i both sides of the equatio we fid that R = 3U 2U 7.)

6 6 NICK DUFRESNE 8. Combiatorial proof of Equatio 7.) To see that R = 3U 2U we will fid it easier to prove that R U = 2U 2U. Let us take S to be the set of paths couted by R U. We kow that the Ukow umbers cout Schröder paths with o horizotal steps at height 0 ad o peaks at height. This would imply that S couts that umber of Schroder paths of legth 2 with at least oe horizotal step at height 0 or peak at height. Cosider the last occurrece of either i the path. Let S be the paths that have the last occurrece as a horizotal step o the x-axis. Let S be the paths that have the last occurrece as a peak at height. Lets let T be the set of paths couted by 2U 2U. Ad let T be oe half of the paths couted by U U, ad T be the other half couted by U U makig each path distict). Now cosider the followig fuctio f. We take a path s i S. If s is i S the we remove the last horizotal step at height 0 i s ad isert a up-step at the start of the path ad a dow-step where we remove the horizotal step to get fs). Figure. Example s S to s T This leaves o more horizotal steps at height 0 or peaks at height sice they will all be moved up oe level. So fs) will be a path couted by U sice it is of legth 2 still uless the path before the horizotal step was empty, i which case we are left with a peak of height at the start. We ca chop the peak off ad the remaiig path is couted by U sice it has o peaks at height or horizotal steps at height 0 ad has legth 2 2. So fs) is i T. Now if s is i S we remove the last peak ad place the up-step of the peak at the begiig of s ad the dow-step remais where it is to get fs). If s is o-empty before the peak the this will be couted by U ad if ot it will be couted by U. Agai s is i T. We see that ay path fs) i T is uiquely determied by s sice it is s uiquely rearraged. So this tells us that f is oe-to-oe. We already have see that U couts Ukow paths of legth 2 2 with a peak attatched to the frot. So for q i T, we just take the first up-step ad dow-step that touch the x-axis ad we remove them. Where the dow-step was, we put either a horizotal step which correspods to a path i S if q is i T or we put a peak of height which correspods to a path i S if q is i T. So we kow every path i T comes from some path i S. So f is oto. This bijectio tells us that R U = 2U 2U. 9. A fial equatio relatig the Ukow ad Schröder umbers Usig what we foud rx) to be i 2.3) ad ux) to be i 2.5) we ca verify that 2 We ca rewrite this to be ux) x 2 2x 2x 2 xrx)) =. 9.) 2 ux) x 2 = 2x 2x 2 xrx). 9.2)

7 AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS 7 Usig 9.2) ad defiig R to be zero for less tha zero we fid that 2 U 2x = 2x 2x 2 R x. 9.3) We ca ow fid a iterpretatio of the paths that U 2 2x couts based o the primes give o the right side of equatio 9.3). We see that the prime paths are very similar to the prime paths of the Schröder umbers except we have ad additioal x ad a additioal 2x 2. Let u deote a up-step ad d deote a dow-step ad h deote a horizotal step. We ca take the prime Schröder paths ad add i a additioal prime of legth 2, du, ad two additioal primes of legth 4, dduu ad dhu. Figure 2. Additioal Primes Now we see that ay path s costructed of these primes will ever go below 2 below the x-axis. By addig o two up-steps at the begiig of such a path ad two dow-steps at the ed to get s we have a path of legth 2 4 that will be a Ukow path of legth 2 4. We see this is true sice if there is a horizotal step o the x-axis i s the there is a horizotal step at 2 below the x-axis i s, which is impossible from the primes we have chose. Also a peak at height i s is impossible from the primes. Figure 3. Example s to s The path s has the property that ay horizotal step at height must be preceeded by a dow step ad followed by a up-step caused by the prime of the form dhu. Also, if s touches the axis at ay poit ot the startig or edig poit) the the poit must be preceeded by two dow steps ad followed by two up steps, which is caused by the prime dduu. What 9.3) tells us is that Ukow paths with these properties of legth 2 4 are exactly half of the paths couted by U 2. Refereces [] Nick Dufrese, Geeratig Fuctios for Lattice Paths i a Free Mooid, March, 2003

Properties and Tests of Zeros of Polynomial Functions

Properties and Tests of Zeros of Polynomial Functions Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

PUTNAM TRAINING PROBABILITY

PUTNAM TRAINING PROBABILITY PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

Let us consider the following problem to warm up towards a more general statement.

Let us consider the following problem to warm up towards a more general statement. Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

MAT 271 Project: Partial Fractions for certain rational functions

MAT 271 Project: Partial Fractions for certain rational functions MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014

UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014 UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 6C Problem Set 4 Bejami Stahl November 6, 4 BOAS, P. 63, PROBLEM.-5 The Laguerre differetial equatio, x y + ( xy + py =, will be solved

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Worksheet on Generating Functions

Worksheet on Generating Functions Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,

More information

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0. THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

More information

6.003 Homework #3 Solutions

6.003 Homework #3 Solutions 6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

Curve Sketching Handout #5 Topic Interpretation Rational Functions

Curve Sketching Handout #5 Topic Interpretation Rational Functions Curve Sketchig Hadout #5 Topic Iterpretatio Ratioal Fuctios A ratioal fuctio is a fuctio f that is a quotiet of two polyomials. I other words, p ( ) ( ) f is a ratioal fuctio if p ( ) ad q ( ) are polyomials

More information

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours THE 06-07 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours Let x, y, ad A all be positive itegers with x y a) Prove that there are

More information

FLC Ch 8 & 9. Evaluate. Check work. a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) 3. p) q) r) s) t) 3.

FLC Ch 8 & 9. Evaluate. Check work. a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) 3. p) q) r) s) t) 3. Math 100 Elemetary Algebra Sec 8.1: Radical Expressios List perfect squares ad evaluate their square root. Kow these perfect squares for test. Def The positive (pricipal) square root of x, writte x, is

More information

Legendre-Stirling Permutations

Legendre-Stirling Permutations Legedre-Stirlig Permutatios Eric S. Egge Departmet of Mathematics Carleto College Northfield, MN 07 USA eegge@carleto.edu Abstract We first give a combiatorial iterpretatio of Everitt, Littlejoh, ad Wellma

More information

Sect 5.3 Proportions

Sect 5.3 Proportions Sect 5. Proportios Objective a: Defiitio of a Proportio. A proportio is a statemet that two ratios or two rates are equal. A proportio takes a form that is similar to a aalogy i Eglish class. For example,

More information

Lecture 4 The Simple Random Walk

Lecture 4 The Simple Random Walk Lecture 4: The Simple Radom Walk 1 of 9 Course: M36K Itro to Stochastic Processes Term: Fall 014 Istructor: Gorda Zitkovic Lecture 4 The Simple Radom Walk We have defied ad costructed a radom walk {X }

More information

You may work in pairs or purely individually for this assignment.

You may work in pairs or purely individually for this assignment. CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or

More information

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL

More information

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

More information

18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016

18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016 18th Bay Area Mathematical Olympiad February 3, 016 Problems ad Solutios BAMO-8 ad BAMO-1 are each 5-questio essay-proof exams, for middle- ad high-school studets, respectively. The problems i each exam

More information

PROPERTIES OF AN EULER SQUARE

PROPERTIES OF AN EULER SQUARE PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every

More information

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

Solutions to Final Exam

Solutions to Final Exam Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig

More information

Generating Functions. 1 Operations on generating functions

Generating Functions. 1 Operations on generating functions Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example

More information

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact

More information

Proof of Goldbach s Conjecture. Reza Javaherdashti

Proof of Goldbach s Conjecture. Reza Javaherdashti Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce

More information

David Vella, Skidmore College.

David Vella, Skidmore College. David Vella, Skidmore College dvella@skidmore.edu Geeratig Fuctios ad Expoetial Geeratig Fuctios Give a sequece {a } we ca associate to it two fuctios determied by power series: Its (ordiary) geeratig

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

PHY4905: Nearly-Free Electron Model (NFE)

PHY4905: Nearly-Free Electron Model (NFE) PHY4905: Nearly-Free Electro Model (NFE) D. L. Maslov Departmet of Physics, Uiversity of Florida (Dated: Jauary 12, 2011) 1 I. REMINDER: QUANTUM MECHANICAL PERTURBATION THEORY A. No-degeerate eigestates

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer. SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

Discrete Mathematics Recurrences

Discrete Mathematics Recurrences Discrete Mathematics Recurreces Saad Meimeh 1 What is a recurrece? It ofte happes that, i studyig a sequece of umbers a, a coectio betwee a ad a 1, or betwee a ad several of the previous a i, i

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Solutions to Problem Set 8

Solutions to Problem Set 8 8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +

More information

Revision Topic 1: Number and algebra

Revision Topic 1: Number and algebra Revisio Topic : Number ad algebra Chapter : Number Differet types of umbers You eed to kow that there are differet types of umbers ad recogise which group a particular umber belogs to: Type of umber Symbol

More information

C. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions

C. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions C. Complex Numbers. Complex arithmetic. Most people thik that complex umbers arose from attempts to solve quadratic equatios, but actually it was i coectio with cubic equatios they first appeared. Everyoe

More information

Unit 4: Polynomial and Rational Functions

Unit 4: Polynomial and Rational Functions 48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms. [ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Algebra II Notes Unit Seven: Powers, Roots, and Radicals

Algebra II Notes Unit Seven: Powers, Roots, and Radicals Syllabus Objectives: 7. The studets will use properties of ratioal epoets to simplify ad evaluate epressios. 7.8 The studet will solve equatios cotaiig radicals or ratioal epoets. b a, the b is the radical.

More information

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots. 15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic

More information

Ray-triangle intersection

Ray-triangle intersection Ray-triagle itersectio ria urless October 2006 I this hadout, we explore the steps eeded to compute the itersectio of a ray with a triagle, ad the to compute the barycetric coordiates of that itersectio.

More information

WHAT ARE THE BERNOULLI NUMBERS? 1. Introduction

WHAT ARE THE BERNOULLI NUMBERS? 1. Introduction WHAT ARE THE BERNOULLI NUMBERS? C. D. BUENGER Abstract. For the "What is?" semiar today we will be ivestigatig the Beroulli umbers. This surprisig sequece of umbers has may applicatios icludig summig powers

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

INTEGRATION BY PARTS (TABLE METHOD)

INTEGRATION BY PARTS (TABLE METHOD) INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary

More information

MA Lesson 26 Notes Graphs of Rational Functions (Asymptotes) Limits at infinity

MA Lesson 26 Notes Graphs of Rational Functions (Asymptotes) Limits at infinity MA 1910 Lesso 6 Notes Graphs of Ratioal Fuctios (Asymptotes) Limits at ifiity Defiitio of a Ratioal Fuctio: If P() ad Q() are both polyomial fuctios, Q() 0, the the fuctio f below is called a Ratioal Fuctio.

More information

0,1,1, 2,3,5,8,13, 21,

0,1,1, 2,3,5,8,13, 21, Catala umbers, Hael determiats ad Fiboacci polyomials Joha Cigler Faultät für Mathemati Uiversität Wie joha.cigler@uivie.ac.at Abstract I this (partly expository) paper we cosider some Hael determiats

More information

APPENDIX F Complex Numbers

APPENDIX F Complex Numbers APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

1 6 = 1 6 = + Factorials and Euler s Gamma function

1 6 = 1 6 = + Factorials and Euler s Gamma function Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio

More information

Calculus with Analytic Geometry 2

Calculus with Analytic Geometry 2 Calculus with Aalytic Geometry Fial Eam Study Guide ad Sample Problems Solutios The date for the fial eam is December, 7, 4-6:3p.m. BU Note. The fial eam will cosist of eercises, ad some theoretical questios,

More information

2.4 - Sequences and Series

2.4 - Sequences and Series 2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n.

COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n. COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION Abstract. We itroduce a method for computig sums of the form f( where f( is ice. We apply this method to study the average value of d(, where

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information