1 / 2

The Fundamental Principle of Counting

The Fundamental Principle of Counting. The Fundamental Principle of Counting. In a task, if there are n 1 ways to do one event, n 2 ways to do the second event, … , and n k ways to do the last event. Then the total number of different ways the task can occur is:

bardia
Télécharger la présentation

The Fundamental Principle of Counting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Fundamental Principle of Counting

  2. The Fundamental Principle of Counting In a task, if there are n1 ways to do one event, n2 ways to do the second event, … , and nk ways to do the last event. Then the total number of different ways the task can occur is: Ex: The cafeteria is selling three sandwiches (ham, beef, or turkey), five sides (potato, corn, broccoli, peas, or carrots), and two desserts (cake or pie). If you have to choose one of each, how many different sandwich/side/dessert choices are there? three five two Make a decision chart. Decision 1 Decision 2 Decision 3

More Related