
- Resource Library
- Math
- Probability And Statistics
- Counting Principle
- Fundamental Counting Principle, Permutations, Combinations 2
Fundamental Counting Principle, Permutations, Combinations 2
Flashcard
•
Mathematics
•
7th - 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 different sundaes can be made with 3 ice cream flavors, 4 toppings, and 2 sauces?
Back
24 different sundaes (3 × 4 × 2 = 24).
3.
FLASHCARD QUESTION
Front
What is a permutation?
Back
A permutation is an arrangement of objects in a specific order.
4.
FLASHCARD QUESTION
Front
What is a combination?
Back
A combination is a selection of items without regard to the order in which they are arranged.
5.
FLASHCARD QUESTION
Front
How many unique 'words' can be formed from the letters in 'SPARTANS'?
Back
10,080 unique arrangements.
6.
FLASHCARD QUESTION
Front
What is the formula for permutations of 'n' items taken 'r' at a time?
Back
The formula is nPr = n! / (n - r)!.
7.
FLASHCARD QUESTION
Front
Evaluate 10P3.
Back
720.
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?