4. PERMUTATIONS AND COMBINATIONS Quick Review

Size: px
Start display at page:

Download "4. PERMUTATIONS AND COMBINATIONS Quick Review"

Transcription

1 4 ERMUTATIONS AND COMBINATIONS Quick Review A aagemet that ca be fomed by takig some o all of a fiite set of thigs (o objects) is called a emutatio A emutatio is said to be a liea emutatio if the objects ae aaged i a lie A liea emutatio is simly called as a emutatio 3 A emutatio is said to be a cicula emutatio if the objects ae aaged i the fom of a cicle (a closed cuve) 4 The umbe of (liea) emutatios that ca be fomed by takig thigs at a time fom a set of dissimila thigs ( ) is deoted by o (, ) o 5 The umbe of emutatios of dissimila thigs take at a time is equal to the umbe of ways of fillig of blak laces aaged i a ow by dissimila thigs 6 Fudametal coutig icile : If a oeatio ca be efomed i m ways ad a secod oeatio ca be efomed i ways coesodig to each efomace of the fist oeatio, the the two oeatios i successio ca be efomed i m ways 7 If i k oeatios, the fist oeatio ca be efomed i ways, the secod oeatio ca be efomed i ways, thid oeatio ca be efomed i 3 ways ad so o, the the k oeatios i successio ca be efomed i 3 k ways 8 = ( )( ) ( + ) 9 If is a o-egative itege, the factoial is deoted by! o ad defied as follows (i) 0! = ; (ii) If > 0 the! = ( )! 0 If is a ositive itege, the! is the oduct of fist ositive iteges ie,! = 3 =! ( )! The umbe of emutatios of dissimila thigs take all at a time is =! 3 ( ) ( ) = + 4 The umbe of ijectios (oe-oe fuctios) that ca be defied fom a set cotaiig elemets ito a set cotaiig elemets is 5 The umbe of bijectios (oe-oe oto fuctios) that ca be defied fom a set cotaiig elemets oto a set cotaiig elemets is! 6 The umbe of emutatios of dissimila thigs take at a time whe eetitio of thigs is allowed ay umbe of times is 7 The umbe of emutatios of dissimila thigs take ot moe tha at a time, whe each ( ) thig may occu ay umbe of times is 8 The umbe of fuctios that ca defied fom a set cotaiig elemets ito a set cotaiig elemets is

2 emutatio ad combiatio 9 The umbe of emutatios of thigs take all at a time whe of them ae all alike ad the! est all diffeet is! 0 If thigs ae alike of oe kid, thigs ae alike of secod kid, 3 thigs ae alike of thid kid ad so o, k thigs ae alike of k th kid i k thigs, the the umbe of ( k )! emutatios obtaied by takig all the thigs is!!! The umbe of cicula emutatios o diffeet thigs take at a time is The umbe of cicula emutatios of diffeet thigs take all at a time is ( )! 3 The umbe of cicula emutatios of thigs take at a time i oe diectio is 4 The umbe of cicula emutatios of thigs take all at a time i oe diectio is ( )! (+ ) 5 (i) + = (ii) (iii) = = + 6 If is a ositive itege ad is a ime umbe the the exoet of i! is whee [x] deotes the geatest itege x 7 The umbe of ways i which m (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs (m + ) ca be aaged i a ow so that o two thigs of secod kid come togethe is (m+ ) m! 8 The umbe of ways i which m (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs ca be aaged i a ow so that all the secod tye of thigs come togethe is! (m+)! 9 The umbe of ways i which (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs ca be aaged i a ow alteatively is!! 30 Sum of the umbes fomed by takig all the give digits (excludig 0) is (Sum of all the digits) ( )! ( times) 3 Sum of the umbes fomed by takig all the give digits (icludig 0) is (Sum of all the digits) [( )! ( times) ( )! ( ( ) times)] 3 Sum of all -digit umbes fomed by takig the give digits (without zeo) is (sum of all the digits) ( times) 33 Sum of all the -digit umbes fomed by takig the give digits (icludig 0) is (sum of all the digits) [ ( times) { ( ) times}] k

3 emutatio ad combiatio 34 The umbe of ways i which m (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs, (m ) ca be aaged i a cicle so that o two thigs of secod kid come togethe is (m )! m 35 The umbe of ways i which m (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs ca be aaged i a cicle so that all the secod tye of thigs come togethe is m!! 36 The umbe of ways i which m (fist tye of diffeet) thigs ad (secod tye of diffeet) thigs ca be aaged i the fom of galad so that all the secod tye of thigs come togethe is m!!/ 37 A selectio that ca be fomed by takig some o all of a fiite set of thigs (o objects) is called a combiatio 38 Fomatio of a combiatio by takig elemets fom a fiite set A meas ickig u a elemet subset of A 39 The umbe of combiatios of dissimila thigs take at a time is equal to the umbe of elemet subsets of a set cotaiig elemets 40 The umbe of combiatios of dissimila thigs take at a time is deoted by C o C(, ) o C o 4 C =!!( )! 4 ( )( )( ) C = + =! 3 43 C = C 44 ( ) + C 45 If C = C s, the = s o + s = ( 3) 46 The umbe of diagoals i a egula olygo of sides is C = 47 The umbe of ways i which (m + ) thigs ca be divided ito two diffeet gous of m ad ( m + )! thigs esectively is m!! 48 The umbe of ways i which thigs ca be divided ito two equal gous of thigs each is ()!!(!) 49 The umbe of ways i which ( + + k ) thigs ca be divided ito k diffeet gous of ( k )! thigs, thigs, 3 thigs, k thigs esectively is!!k! 50 The umbe of ways i which k thigs ca be divided ito k equal gous of thigs each is (k)! k k!(!) 5 The total umbe of combiatios of ( + q) thigs take ay umbe at a time whe thigs ae alike of oe kid ad q thigs ae alike of a secod kid is ( + ) (q + ) 3

4 4 emutatio ad combiatio 5 The total umbe of combiatios of + q thigs take ay umbe at a time, icludes the case i which othig will be selected 53 The total umbe of combiatios of ( + q) thigs take oe o moe at a time whe thigs ae alike of oe kid ad q thigs ae alike of a secod kid is ( + )(q + ) 54 The total umbe of combiatios of ( k ) thigs take ay umbe at a time whe thigs ae alike of oe kid, thigs ae alike of a secod kid, k thigs ae alike of kth kid, is ( + ) ( + ) ( k + ) 55 The total umbe of combiatios of ( k ) thigs take oe o moe at a time whe thigs ae alike of oe kid, thigs ae alike of a secod kid, k thigs ae alike of kth kid, is ( + ) ( + ) ( k + ) 56 The total umbe of combiatios of diffeet thigs take ay umbe at a time is 57 The total umbe of combiatios of diffeet thigs take oe o moe at a time is 58 C + C + C + C = 0 α α αk 59 If is a ositive itege, the ca be uiquely exessed as = k whee,, k ae imes i iceasig ode ad α, α, α k ae o-egative iteges This eesetatio of is called ime factoisatio of i caoical fom o ime owe factoisatio of α α αk 60 The umbe of ositive divisos of a ositive itege = k (the ime factoisatio) is (α + )(α + )(α 3 + ) (α k + ) 6 (i) C = (+ ) C (ii) = + (iii) C = Cs = s o + s = + 6 (i) = (ii) = (iii) = C ( ) C ( ) 63 The umbe of aallelogams fomed whe a set of m aallel lies ae itesectig aothe set m of aallel lies is C C 64 If thee ae oits i a lae o thee of which ae o the same staight lie excetig oits which ae colliea, the (i) the umbe of staight lies fomed by joiig them is C + C (ii) the umbe of tiagles fomed by joiig them is C3 C3 65 The umbe of ways that soveeigs ca be give away whe thee ae k alicats ad ay (+ k ) alicat may have eithe 0,,, 3, 4, 5 o soveeigs is Ck 66 (i) The umbe of ways i which exactly lettes ca be laced i wogly addessed eveloes whe lettes ae uttig i addessed eveloes is ( )!! 3!! (ii) The umbe of ways i which diffeet lettes ca be ut i thei addessed eveloes so that all the lettes ae i the wog eveloes =! ( )!! 3!! 67 (i) The umbe of ways of asweig oe o moe of questios is (ii) The umbe of ways of asweig oe o moe of questios whe each questio have a alteative is 3

5 emutatio ad combiatio (iii) The umbe of ways of asweig all of questios whe each questio have a alteative is k k k 68 The umbe of distict ositive itegal divisos of whee,,, ae imes i ascedig ode, is (k + )(k + ) (k + ) k k k 69 The sum of distict ositive itegal divisos of whee,,, ae imes i ascedig ode, is k + k + k + 5

4. PERMUTATIONS AND COMBINATIONS

4. PERMUTATIONS AND COMBINATIONS 4. PERMUTATIONS AND COMBINATIONS PREVIOUS EAMCET BITS 1. The umbe of ways i which 13 gold cois ca be distibuted amog thee pesos such that each oe gets at least two gold cois is [EAMCET-000] 1) 3 ) 4 3)

More information

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample Uodeed Samples without Replacemet oside populatio of elemets a a... a. y uodeed aagemet of elemets is called a uodeed sample of size. Two uodeed samples ae diffeet oly if oe cotais a elemet ot cotaied

More information

MATH Midterm Solutions

MATH Midterm Solutions MATH 2113 - Midtem Solutios Febuay 18 1. A bag of mables cotais 4 which ae ed, 4 which ae blue ad 4 which ae gee. a How may mables must be chose fom the bag to guaatee that thee ae the same colou? We ca

More information

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n! 0 Combiatoial Aalysis Copyight by Deiz Kalı 4 Combiatios Questio 4 What is the diffeece betwee the followig questio i How may 3-lette wods ca you wite usig the lettes A, B, C, D, E ii How may 3-elemet

More information

The Pigeonhole Principle 3.4 Binomial Coefficients

The Pigeonhole Principle 3.4 Binomial Coefficients Discete M athematic Chapte 3: Coutig 3. The Pigeohole Piciple 3.4 Biomial Coefficiets D Patic Cha School of Compute Sciece ad Egieeig South Chia Uivesity of Techology Ageda Ch 3. The Pigeohole Piciple

More information

Using Counting Techniques to Determine Probabilities

Using Counting Techniques to Determine Probabilities Kowledge ticle: obability ad Statistics Usig outig Techiques to Detemie obabilities Tee Diagams ad the Fudametal outig iciple impotat aspect of pobability theoy is the ability to detemie the total umbe

More information

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology Disc ete Mathem atic Chapte 3: Coutig 3. The Pigeohole Piciple 3.4 Biomial Coefficiets D Patic Cha School of Compute Sciece ad Egieeig South Chia Uivesity of Techology Pigeohole Piciple Suppose that a

More information

Counting Functions and Subsets

Counting Functions and Subsets CHAPTER 1 Coutig Fuctios ad Subsets This chapte of the otes is based o Chapte 12 of PJE See PJE p144 Hee ad below, the efeeces to the PJEccles book ae give as PJE The goal of this shot chapte is to itoduce

More information

On composite conformal mapping of an annulus to a plane with two holes

On composite conformal mapping of an annulus to a plane with two holes O composite cofomal mappig of a aulus to a plae with two holes Mila Batista (July 07) Abstact I the aticle we coside the composite cofomal map which maps aulus to ifiite egio with symmetic hole ad ealy

More information

The number of r element subsets of a set with n r elements

The number of r element subsets of a set with n r elements Popositio: is The umbe of elemet subsets of a set with elemets Poof: Each such subset aises whe we pick a fist elemet followed by a secod elemet up to a th elemet The umbe of such choices is P But this

More information

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a BINOMIAL THEOREM hapte 8 8. Oveview: 8.. A epessio cosistig of two tems, coected by + o sig is called a biomial epessio. Fo eample, + a, y,,7 4 5y, etc., ae all biomial epessios. 8.. Biomial theoem If

More information

ICS141: Discrete Mathematics for Computer Science I

ICS141: Discrete Mathematics for Computer Science I Uivesity of Hawaii ICS141: Discete Mathematics fo Compute Sciece I Dept. Ifomatio & Compute Sci., Uivesity of Hawaii Ja Stelovsy based o slides by D. Bae ad D. Still Oigials by D. M. P. Fa ad D. J.L. Goss

More information

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a 8. Oveview: 8.. A epessio cosistig of two tems, coected by + o sig is called a biomial epessio. Fo eample, + a, y,,7 4, etc., ae all biomial 5y epessios. 8.. Biomial theoem BINOMIAL THEOREM If a ad b ae

More information

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T BINOMIAL THEOREM_SYNOPSIS Geatest tem (umeically) i the epasio of ( + ) Method Let T ( The th tem) be the geatest tem. Fid T, T, T fom the give epasio. Put T T T ad. Th will give a iequality fom whee value

More information

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS Joual of Pue ad Alied Mathematics: Advaces ad Alicatios Volume 0 Numbe 03 Pages 5-58 ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS ALI H HAKAMI Deatmet of Mathematics

More information

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers) Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.

More information

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P.

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P. Pogessio Sequece & Seies A set of umbes whose domai is a eal umbe is called a SEQUENCE ad sum of the sequece is called a SERIES. If a, a, a, a 4,., a, is a sequece, the the expessio a + a + a + a 4 + a

More information

Mapping Radius of Regular Function and Center of Convex Region. Duan Wenxi

Mapping Radius of Regular Function and Center of Convex Region. Duan Wenxi d Iteatioal Cofeece o Electical Compute Egieeig ad Electoics (ICECEE 5 Mappig adius of egula Fuctio ad Cete of Covex egio Dua Wexi School of Applied Mathematics Beijig Nomal Uivesity Zhuhai Chia 363463@qqcom

More information

MATH /19: problems for supervision in week 08 SOLUTIONS

MATH /19: problems for supervision in week 08 SOLUTIONS MATH10101 2018/19: poblems fo supevisio i week 08 Q1. Let A be a set. SOLUTIONS (i Pove that the fuctio c: P(A P(A, defied by c(x A \ X, is bijective. (ii Let ow A be fiite, A. Use (i to show that fo each

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 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

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r.

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r. Solutios to MAML Olympiad Level 00. Factioated a) The aveage (mea) of the two factios is halfway betwee them: p ps+ q ps+ q + q s qs qs b) The aswe is yes. Assume without loss of geeality that p

More information

Permutations and Combinations

Permutations and Combinations Pemutatios ad ombiatios Fudametal piciple of coutig Pemutatio Factoial otatio P!! ombiatio This uit facilitates you i, statig the fudametal piciple of coutig. defiig pemutatio ad combiatio. usig factoial

More information

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8.

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8. Mathematics. Solved Eamples JEE Mai/Boads Eample : Fid the coefficiet of y i c y y Sol: By usig fomula of fidig geeal tem we ca easily get coefficiet of y. I the biomial epasio, ( ) th tem is c T ( y )

More information

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD MIXED -STIRLING NUMERS OF THE SEOND KIND DANIEL YAQUI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD Abstact The Stilig umbe of the secod id { } couts the umbe of ways to patitio a set of labeled balls ito

More information

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method CHAPTER 5 : SERIES 5.1 Seies 5. The Sum of a Seies 5..1 Sum of Powe of Positive Iteges 5.. Sum of Seies of Patial Factio 5..3 Diffeece Method 5.3 Test of covegece 5.3.1 Divegece Test 5.3. Itegal Test 5.3.3

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

RECIPROCAL POWER SUMS. Anthony Sofo Victoria University, Melbourne City, Australia.

RECIPROCAL POWER SUMS. Anthony Sofo Victoria University, Melbourne City, Australia. #A39 INTEGERS () RECIPROCAL POWER SUMS Athoy Sofo Victoia Uivesity, Melboue City, Austalia. athoy.sofo@vu.edu.au Received: /8/, Acceted: 6//, Published: 6/5/ Abstact I this ae we give a alteative oof ad

More information

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences Chapte : Theoy of Modula Aithmetic 8 Sectio D Chiese Remaide Theoem By the ed of this sectio you will be able to pove the Chiese Remaide Theoem apply this theoem to solve simultaeous liea cogueces The

More information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

Math 166 Week-in-Review - S. Nite 11/10/2012 Page 1 of 5 WIR #9 = 1+ r eff. , where r. is the effective interest rate, r is the annual

Math 166 Week-in-Review - S. Nite 11/10/2012 Page 1 of 5 WIR #9 = 1+ r eff. , where r. is the effective interest rate, r is the annual Math 66 Week-i-Review - S. Nite // Page of Week i Review #9 (F-F.4, 4.-4.4,.-.) Simple Iteest I = Pt, whee I is the iteest, P is the picipal, is the iteest ate, ad t is the time i yeas. P( + t), whee A

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

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

Homework 9. (n + 1)! = 1 1

Homework 9. (n + 1)! = 1 1 . Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves

More information

Intermediate Math Circles November 4, 2009 Counting II

Intermediate Math Circles November 4, 2009 Counting II Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

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

STUDY PACKAGE. Subject : Mathematics Topic : Permutation and Combination Available Online :

STUDY PACKAGE. Subject : Mathematics Topic : Permutation and Combination Available Online : fo/u fopkjr Hkh# tu] ugha vkjehks dke] foifr s[k NksM+s rqjar e/;e eu dj ';kea iq#"k flag ladyi dj] lgrs foifr vusd] ^cuk^ u NksM+s /;s; dks] j?kqcj jk[ks VsdAA jfpr% ekuo /kez iz.ksrk l~xq# Jh j.knksm+klth

More information

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca

More information

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow KEY Math 334 Midtem II Fall 7 sectio 4 Istucto: Scott Glasgow Please do NOT wite o this exam. No cedit will be give fo such wok. Rathe wite i a blue book, o o you ow pape, pefeably egieeig pape. Wite you

More information

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.)

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.) BINOMIAL THEOREM SOLUTION. (D) ( + + +... + ) (+ + +.) The coefficiet of + + + +... + fo. Moeove coefficiet of is + + + +... + if >. So. (B)... e!!!! The equied coefficiet coefficiet of i e -.!...!. (A),

More information

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as Math 7409 Hoewok 2 Fall 2010 1. Eueate the equivalece classes of siple gaphs o 5 vetices by usig the patte ivetoy as a guide. The cycle idex of S 5 actig o 5 vetices is 1 x 5 120 1 10 x 3 1 x 2 15 x 1

More information

Using Difference Equations to Generalize Results for Periodic Nested Radicals

Using Difference Equations to Generalize Results for Periodic Nested Radicals Usig Diffeece Equatios to Geealize Results fo Peiodic Nested Radicals Chis Lyd Uivesity of Rhode Islad, Depatmet of Mathematics South Kigsto, Rhode Islad 2 2 2 2 2 2 2 π = + + +... Vieta (593) 2 2 2 =

More information

Model Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions

Model Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical,

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version equeces ad eies Auchmuty High chool Mathematics Depatmet equeces & eies Notes Teache Vesio A sequece takes the fom,,7,0,, while 7 0 is a seies. Thee ae two types of sequece/seies aithmetic ad geometic.

More information

EVALUATION OF SUMS INVOLVING GAUSSIAN q-binomial COEFFICIENTS WITH RATIONAL WEIGHT FUNCTIONS

EVALUATION OF SUMS INVOLVING GAUSSIAN q-binomial COEFFICIENTS WITH RATIONAL WEIGHT FUNCTIONS EVALUATION OF SUMS INVOLVING GAUSSIAN -BINOMIAL COEFFICIENTS WITH RATIONAL WEIGHT FUNCTIONS EMRAH KILIÇ AND HELMUT PRODINGER Abstact We coside sums of the Gaussia -biomial coefficiets with a paametic atioal

More information

Chapter 1 : Combinatorial Analysis

Chapter 1 : Combinatorial Analysis STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig

More information

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to Compaiso Fuctios I this lesso, we study stability popeties of the oautoomous system = f t, x The difficulty is that ay solutio of this system statig at x( t ) depeds o both t ad t = x Thee ae thee special

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

Technical Report: Bessel Filter Analysis

Technical Report: Bessel Filter Analysis Sasa Mahmoodi 1 Techical Repot: Bessel Filte Aalysis 1 School of Electoics ad Compute Sciece, Buildig 1, Southampto Uivesity, Southampto, S17 1BJ, UK, Email: sm3@ecs.soto.ac.uk I this techical epot, we

More information

05/11/2016. MATH 154 : Lecture 20

05/11/2016. MATH 154 : Lecture 20 05/11/2016 MATH 154 Lecture 20 m Elemets Showed ( mtl Last Time Itroductio to ( likely amiliar basic coutig priciples rom the poit o view o discrete uctios Cosidered iite sets M{ 1 } ad N{ 1 } ad Fu (

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

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

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Multivector Functions

Multivector Functions I: J. Math. Aal. ad Appl., ol. 24, No. 3, c Academic Pess (968) 467 473. Multivecto Fuctios David Hestees I a pevious pape [], the fudametals of diffeetial ad itegal calculus o Euclidea -space wee expessed

More information

1 Counting and Stirling Numbers

1 Counting and Stirling Numbers 1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to

More information

2012 GCE A Level H2 Maths Solution Paper Let x,

2012 GCE A Level H2 Maths Solution Paper Let x, GCE A Level H Maths Solutio Pape. Let, y ad z be the cost of a ticet fo ude yeas, betwee ad 5 yeas, ad ove 5 yeas categoies espectively. 9 + y + 4z =. 7 + 5y + z = 8. + 4y + 5z = 58.5 Fo ude, ticet costs

More information

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : ,

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : , MB BINOMIAL THEOREM Biomial Epessio : A algebaic epessio which cotais two dissimila tems is called biomial epessio Fo eample :,,, etc / ( ) Statemet of Biomial theoem : If, R ad N, the : ( + ) = a b +

More information

International Journal of Mathematics Trends and Technology (IJMTT) Volume 47 Number 1 July 2017

International Journal of Mathematics Trends and Technology (IJMTT) Volume 47 Number 1 July 2017 Iteatioal Joual of Matheatics Teds ad Techology (IJMTT) Volue 47 Nube July 07 Coe Metic Saces, Coe Rectagula Metic Saces ad Coo Fixed Poit Theoes M. Sivastava; S.C. Ghosh Deatet of Matheatics, D.A.V. College

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

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

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x] [ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all

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

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

PROGRESSION AND SERIES

PROGRESSION AND SERIES INTRODUCTION PROGRESSION AND SERIES A gemet of umbes {,,,,, } ccodig to some well defied ule o set of ules is clled sequece Moe pecisely, we my defie sequece s fuctio whose domi is some subset of set of

More information

Bernoulli, poly-bernoulli, and Cauchy polynomials in terms of Stirling and r-stirling numbers

Bernoulli, poly-bernoulli, and Cauchy polynomials in terms of Stirling and r-stirling numbers Novembe 4, 2016 Beoulli, oly-beoulli, ad Cauchy olyomials i tems of Stilig ad -Stilig umbes Khisto N. Boyadzhiev Deatmet of Mathematics ad Statistics, Ohio Nothe Uivesity, Ada, OH 45810, USA -boyadzhiev@ou.edu

More information

Merge and Quick Sort

Merge and Quick Sort Merge ad Quick Sort Merge Sort Merge Sort Tree Implemetatio Quick Sort Pivot Item Radomized Quick Sort Adapted from: Goodrich ad Tamassia, Data Structures ad Algorithms i Java, Joh Wiley & So (1998). Ruig

More information

Permutations, Combinations, and the Binomial Theorem

Permutations, Combinations, and the Binomial Theorem Permutatios, ombiatios, ad the Biomial Theorem Sectio Permutatios outig methods are used to determie the umber of members of a specific set as well as outcomes of a evet. There are may differet ways to

More information

Strong Result for Level Crossings of Random Polynomials. Dipty Rani Dhal, Dr. P. K. Mishra. Department of Mathematics, CET, BPUT, BBSR, ODISHA, INDIA

Strong Result for Level Crossings of Random Polynomials. Dipty Rani Dhal, Dr. P. K. Mishra. Department of Mathematics, CET, BPUT, BBSR, ODISHA, INDIA Iteatioal Joual of Reseach i Egieeig ad aageet Techology (IJRET) olue Issue July 5 Available at http://wwwijetco/ Stog Result fo Level Cossigs of Rado olyoials Dipty Rai Dhal D K isha Depatet of atheatics

More information

f(x)g(x) dx is an inner product on D.

f(x)g(x) dx is an inner product on D. Ark9: Exercises for MAT2400 Fourier series The exercises o this sheet cover the sectios 4.9 to 4.13. They are iteded for the groups o Thursday, April 12 ad Friday, March 30 ad April 13. NB: No group o

More information

Recursion. Algorithm : Design & Analysis [3]

Recursion. Algorithm : Design & Analysis [3] Recusio Algoithm : Desig & Aalysis [] I the last class Asymptotic gowth ate he Sets Ο, Ω ad Θ Complexity Class A Example: Maximum Susequece Sum Impovemet of Algoithm Compaiso of Asymptotic Behavio Aothe

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

Ground Rules. PC1221 Fundamentals of Physics I. Uniform Circular Motion, cont. Uniform Circular Motion (on Horizon Plane) Lectures 11 and 12

Ground Rules. PC1221 Fundamentals of Physics I. Uniform Circular Motion, cont. Uniform Circular Motion (on Horizon Plane) Lectures 11 and 12 PC11 Fudametals of Physics I Lectues 11 ad 1 Cicula Motio ad Othe Applicatios of Newto s Laws D Tay Seg Chua 1 Goud Rules Switch off you hadphoe ad page Switch off you laptop compute ad keep it No talkig

More information

The Basic Space Model

The Basic Space Model The Basic Space Model Let x i be the ith idividual s (i=,, ) reported positio o the th issue ( =,, m) ad let X 0 be the by m matrix of observed data here the 0 subscript idicates that elemets are missig

More information

Lecture 24: Observability and Constructibility

Lecture 24: Observability and Constructibility ectue 24: Obsevability ad Costuctibility 7 Obsevability ad Costuctibility Motivatio: State feedback laws deped o a kowledge of the cuet state. I some systems, xt () ca be measued diectly, e.g., positio

More information

Disjoint Sets { 9} { 1} { 11} Disjoint Sets (cont) Operations. Disjoint Sets (cont) Disjoint Sets (cont) n elements

Disjoint Sets { 9} { 1} { 11} Disjoint Sets (cont) Operations. Disjoint Sets (cont) Disjoint Sets (cont) n elements Disjoit Sets elemets { x, x, } X =, K Opeatios x Patitioed ito k sets (disjoit sets S, S,, K Fid-Set(x - etu set cotaiig x Uio(x,y - make a ew set by combiig the sets cotaiig x ad y (destoyig them S k

More information

Lecture 4: Grassmannians, Finite and Affine Morphisms

Lecture 4: Grassmannians, Finite and Affine Morphisms 18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about

More information

Cardinality Homework Solutions

Cardinality Homework Solutions Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =

More information

BINOMIAL THEOREM & ITS SIMPLE APPLICATION

BINOMIAL THEOREM & ITS SIMPLE APPLICATION Etei lasses, Uit No. 0, 0, Vadhma Rig Road Plaza, Vikas Pui Et., Oute Rig Road New Delhi 0 08, Ph. : 9690, 87 MB Sllabus : BINOMIAL THEOREM & ITS SIMPLE APPLIATION Biomia Theoem fo a positive itegal ide;

More information

REVIEW FOR CHAPTER 1

REVIEW FOR CHAPTER 1 REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)

More information

Conditional Convergence of Infinite Products

Conditional Convergence of Infinite Products Coditioal Covegece of Ifiite Poducts William F. Tech Ameica Mathematical Mothly 106 1999), 646-651 I this aticle we evisit the classical subject of ifiite poducts. Fo stadad defiitios ad theoems o this

More information

arxiv: v1 [math.co] 23 Mar 2016

arxiv: v1 [math.co] 23 Mar 2016 The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops

More information

What is Probability?

What is Probability? Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t ow what will happe o ay oe experimet, but has a log ru order. The cocept of probability

More information

Books Recommended for Further Reading

Books Recommended for Further Reading Books Recommeded for Further Readig by 8.5..8 o 0//8. For persoal use oly.. K. P. Bogart, Itroductory Combiatorics rd ed., S. I. Harcourt Brace College Publishers, 998.. R. A. Brualdi, Itroductory Combiatorics

More information

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

On a Smarandache problem concerning the prime gaps

On a Smarandache problem concerning the prime gaps O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps

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

THE ANALYTIC LARGE SIEVE

THE ANALYTIC LARGE SIEVE THE ANALYTIC LAGE SIEVE 1. The aalytic lage sieve I the last lectue we saw how to apply the aalytic lage sieve to deive a aithmetic fomulatio of the lage sieve, which we applied to the poblem of boudig

More information

First selection test, May 1 st, 2008

First selection test, May 1 st, 2008 First selectio test, May st, 2008 Problem. Let p be a prime umber, p 3, ad let a, b be iteger umbers so that p a + b ad p 2 a 3 + b 3. Show that p 2 a + b or p 3 a 3 + b 3. Problem 2. Prove that for ay

More information

Relations Among Algebras

Relations Among Algebras Itroductio to leee Algebra Lecture 6 CS786 Sprig 2004 February 9, 2004 Relatios Amog Algebras The otio of free algebra described i the previous lecture is a example of a more geeral pheomeo called adjuctio.

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

Lecture 1. January 8, 2018

Lecture 1. January 8, 2018 Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

AIEEE 2004 (MATHEMATICS)

AIEEE 2004 (MATHEMATICS) AIEEE 004 (MATHEMATICS) Impotat Istuctios: i) The test is of hous duatio. ii) The test cosists of 75 questios. iii) The maimum maks ae 5. iv) Fo each coect aswe you will get maks ad fo a wog aswe you will

More information

The Discrete Fourier Transform

The Discrete Fourier Transform (7) The Discete Fouie Tasfom The Discete Fouie Tasfom hat is Discete Fouie Tasfom (DFT)? (ote: It s ot DTFT discete-time Fouie tasfom) A liea tasfomatio (mati) Samples of the Fouie tasfom (DTFT) of a apeiodic

More information