Counting II 3, 7 3, 2 3, 9 7, 2 7, 9 2, 9

Similar documents
Module 8-7: Pascal s Triangle and the Binomial Theorem

1.2 Binomial Coefficients and Subsets

Counting Regions in the Plane and More 1

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Alpha Individual Solutions MAΘ National Convention 2013

The isoperimetric problem on the hypercube

EVALUATION OF TRIGONOMETRIC FUNCTIONS

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

Arithmetic Sequences

. Written in factored form it is easy to see that the roots are 2, 2, i,

State-space feedback 6 challenges of pole placement

Parabolic Path to a Best Best-Fit Line:

OCR Statistics 1. Working with data. Section 3: Measures of spread

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

Random Graphs and Complex Networks T

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Which movie we can suggest to Anne?

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

27 Refraction, Dispersion, Internal Reflection

BOOLEAN MATHEMATICS: GENERAL THEORY

Math Section 2.2 Polynomial Functions

Ch 9.3 Geometric Sequences and Series Lessons

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

Pattern Recognition Systems Lab 1 Least Mean Squares

Ones Assignment Method for Solving Traveling Salesman Problem

Algorithm Design Techniques. Divide and conquer Problem

Numerical Methods Lecture 6 - Curve Fitting Techniques

Descriptive Statistics Summary Lists

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Basic Design Principles

Lecture 9: Exam I Review

The VSS CCD photometry spreadsheet

6.854J / J Advanced Algorithms Fall 2008

Protected points in ordered trees

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

1 Graph Sparsfication

SEQUENCES AND SERIES

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1

Python Programming: An Introduction to Computer Science

Weston Anniversary Fund

A Resource for Free-standing Mathematics Qualifications

Lecture 28: Data Link Layer

Chapter 3 Classification of FFT Processor Algorithms

Lecture 5. Counting Sort / Radix Sort

Counting the Number of Minimum Roman Dominating Functions of a Graph

Lecture 5: Recursion. Recursion Overview. Recursion is a powerful technique for specifying funclons, sets, and programs

Performance Plus Software Parameter Definitions

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Intermediate Statistics

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

Floristic Quality Assessment (FQA) Calculator for Colorado User s Guide

Chapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Investigation Monitoring Inventory

MOTIF XF Extension Owner s Manual

Computational Geometry

Introduction to Sigma Notation

UNIT 1 RECURRENCE RELATIONS

Guide to Applying Online

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

Python Programming: An Introduction to Computer Science

Visualization of Gauss-Bonnet Theorem

Octahedral Graph Scaling

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Exercise 6 (Week 42) For the foreign students only.

Chapter 4 The Datapath

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

IMP: Superposer Integrated Morphometrics Package Superposition Tool

Civil Engineering Computation

Math 3201 Notes Chapter 4: Rational Expressions & Equations

EE123 Digital Signal Processing

MR-2010I %MktBSize Macro 989. %MktBSize Macro

Computers and Scientific Thinking

Mathematical Stat I: solutions of homework 1

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c

LU Decomposition Method

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

Normal Distributions

CS 683: Advanced Design and Analysis of Algorithms

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

condition w i B i S maximum u i

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Java Expressions & Flow Control

CMPT 125 Assignment 2 Solutions

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

New Results on Energy of Graphs of Small Order

CS 111 Green: Program Design I Lecture 27: Speed (cont.); parting thoughts

Binomial Coefficients and Subsets

Transcription:

Coutig II Sometimes we will wat to choose objects from a set of objects, ad we wo t be iterested i orderig them For example, if you are leavig for vacatio ad you wat to pac your suitcase with three of the seve pairs of shorts that you ow, the it does t matter i which order you pac the shorts All that matters is which three pairs you pac choose The umber of differet ways that objects ca be chose from a set of objects (whe order does t matter) is called choose It is writte i symbol form as Examples There are four differet ways that oe letter ca be chose from the set of four letters {e, f, g, a} Oe way is to choose the letter e Alteratively, you could also choose the letter f, or the letter g, or the letter a Sice there are optios for choosig oe object from a set of objects, we have Below is a list of all the possible ways that umbers ca be chose from the set of four umbers {,,, 9} There are six differet ways Thus,,,, 9,, 9, 9 Geeral formula To say that we are choosig ad orderig objects from a set of objects is to say that we are performig separate tass First is the tas of choosig objects from the set of objects, ad the umber of ways to perform that tas is Secod is the tas of orderig the objects after we ve chose them There are! ways to order objects Let s repeat that To choose ad order objects: First, choose the objects, the order the objects you chose Optios multiply, so the total umber of ways that we ca choose ad order objects from a set of objects is!

! We saw i the previous chapter that there are exactly ( )! ways to choose ad order objects from a set of objects Therefore,!! ( )! Dividig the previous equatio by!: Examples!!( )! There are differet ways to choose which of the pairs of shorts that you will tae o your vacatio!!( )! ()()(!)!! ()() () How may card poer hads are there if you play with a stadard dec of cards? You re coutig the umber of differet collectios of cards that ca be tae from a set of cards This umber is!!( )! ()()(9)(8)(!)!! ()()(9)(8) ()()(9)(8)!, 98, 9 You are at a DVD retal store You wat to ret DVDs The store has 8 differet DVDs to choose from There are 8 differet collectios of three movies that you could ret 8 8!!(8 )! 8(8)(8)(8!)! 8!, 8,, 8(8)(8)!, 9, 9, 9 * * * * * * * * * * * * *

Pascal s Triagle We ca arrage the umbers ito a triagle I each row, the top umber of is the same The bottom umber of is the same i each upward slatig diagoal The triagle cotiues o forever The first 8 rows are show above This is called Pascal s triagle It is amed after a Frech mathematicia who discovered it It had bee discovered outside of Europe ceturies earlier by Chiese mathematicias Moder mathematics bega i Europe, so its traditios ad stories ted to promote the exploits of Europeas over others Some values of to start with is the umber of differet ways you ca select objects from a set of objects There is oly oe way to tae everythig you just tae everythig so Similarly, there is oly oe way to tae othig from a set just tae othig, that s your oly optio The umber of ways you ca select othig, aa objects, from a set is That meas Now we ca fill i the values for ad ito Pascal s triagle 8

There are differet ways to choose object from a set that has objects Thus, Similarly, there are exactly differet optios for choosig objects from a set of objects To see this, otice that decidig which of the objects that you will tae from a set of objects is the same as decidig which object you will leave behid So the umber of ways you ca tae objectsisthesameastheumberofwaysyoucaleaveobject That is to say, Hece, Oce we fill i this ew iformatio o Pascal s triagle it loos lie Before movig o, let s loo bac at the last rule that we foud: The argumet we gave there geeralizes, i that taig objects from 9

asetof objects is the same as leavig Therefore, What we saw earlier i the form was the special case of the formula whe Add the two umbers above to get the umber below Suppose that you have a set of differet rocs: big red bric, ad differet little blue marbles How may differet ways are there to choose +rocsfromthesetof rocs? Ay collectio of + rocs either icludes the big red bric, or it does t Let s first loo at those collectios of +objectsthatdo cotai a big red bric Oe of the +objectswewillchooseisabigredbric That s agive Thatmeasthatallwehavetodoisdecidewhich of the little blue marbles we wat to choose alog with the big red bric to mae up our collectio of +objects Thereare differet ways we could choose marbles from the total umber of littlebluemarbles Thus,thereare differet ways we could choose a set of +objectsfromoursetof rocs if we ow that oe of the objects we will choose is a big red bric Now let s loo at those collectios of + objects that do t cotai the big red bric The all +objectsthatwewillchoosearelittlebluemarbles There are littlebluemarbles,adtheumberofdifferet ways we could choose +ofthe littlebluemarblesis + Ay collectio of + rocs either icludes the big red bric, or it does t So to fid the umber of ways that we could choose +objects, wejust have to add the umber of possibilities that cotai a big red bric, to the umber of possibilities that do t cotai a big red bric That formula is + + + If ad,thetheaboveformulasaysthat + Looig at Pascal s triagle, you ll see that ad are the two umbers that are just above the umber Chage the values of ad ad chec that the above formula always idicates that to fid a umber i Pascal s triagle, just sum the two umbers that are directly above it

For example, + + ad + + We ow the atural umbers that are at the very tip of Pascal s triagle To fid the rest of the umbers i Pascal s triagle, we ca let that owledge tricle dow the triagle usig this latest formula that ay umber i the triagle is the sum of the two umbers above it Notice that Pascal s triagle is the same if you read it left-to-right, or right-to-left Covice yourself that this is a cosequece of the formula * * * * * * * * * * * * * Biomial Theorem For x, y R ad N, (x + y) i x i y i i

Example We ca use the biomial theorem ad Pascal s triagle to write out the product (x + y) The biomial theorem states that (x + y) x i y i i i x y + x y + x + x y + xy + x y + y x y The umbers,,,ad mae up the fourth row of Pascal s triagle, ad we ca see from the triagle that they equal,,, ad respectively Therefore, (x + y) x +x y +xy + y Biomial coefficiets Because of the biomial theorem, umbers of the form are called biomial coefficiets * * * * * * * * * * * * *

Exercises ) A small coutry has just udergoe a revolutio ad they commissio you to desig a ew flag for them The wat exactly colors used i their flag, ad they have give you colors of cloth that you are allowed to use How may differet color combiatios do you have to decide betwee? ) A sports team is sellig seaso ticet plas They have home games i a seaso, ad they allow people to purchase ticets for ay combiatio of home games How may ways are there to choose a collectio of home games? ) A bagel shop ass customers to create a Baer s Doze Variety Pac by choosig differet types of bagels If the shop has differet ids of bagels to choose betwee, the how may differet variety pacs does a customer have to choose from? ) To play the lottery you have to select out of 9 umbers How may differet ids of lottery ticets ca you purchase? ) Use the Biomial Theorem ad Pascal s triagle to write out the product (x + y) (Your aswer should have a similar form to the example that was doe before the exercises) ) Use the Biomial Theorem ad Pascal s triagle to write out the product (x + y) ) Fid (x +) usig the Biomial Theorem 8) Fid (x ) usig the Biomial Theorem