
Fundamental counting principle
Flashcard
•
Mathematics
•
12th Grade
•
Practice Problem
•
Hard
Wayground Content
FREE Resource
Student preview

15 questions
Show all answers
1.
FLASHCARD QUESTION
Front
What is the Fundamental Counting Principle?
Back
The Fundamental Counting Principle states that if there are 'm' ways to do one thing and 'n' ways to do another, then there are m × n ways to do both.
2.
FLASHCARD QUESTION
Front
How many 6-digit odd numbers can be formed if digits cannot be repeated?
Back
67200
3.
FLASHCARD QUESTION
Front
How many unique student IDs can be created with 2 letters followed by 4 digits if letters and digits can be repeated?
Back
6,760,000
4.
FLASHCARD QUESTION
Front
What is the total number of outcomes for picking a day of the week and a month of the year?
Back
84
5.
FLASHCARD QUESTION
Front
How many 10-digit telephone numbers can be formed if the first and fourth digits cannot be 0 or 1?
Back
6,400,000,000
6.
FLASHCARD QUESTION
Front
What is the formula for permutations of 'n' items taken 'r' at a time?
Back
P(n, r) = n! / (n - r)! where n is the total items and r is the items to choose.
7.
FLASHCARD QUESTION
Front
What is the formula for combinations of 'n' items taken 'r' at a time?
Back
C(n, r) = n! / [r!(n - r)!] where n is the total items and r is the items to choose.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?