Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
How many ways can 3 students be chosen from a set of 5?
Use C(n, k) = n! / (k!(n-k)!), where n is the total number and k is the number of choices.
If each student can pick one of 4 different books, how many choices are there for 3 students?
Use the Product Rule: 4^3.
How many ways can 2 employees be assigned to 3 different offices if they cannot share an office?
Recall the Product Rule.
Is it true that if you have 15 items in 10 boxes, at least one box must contain more than one item?
Think about how distribution must work.
In a network of 7 friends, where each pair is either friends or enemies, determine the minimum number of people needed to guarantee 3 mutual relationships.
Visualize relationships as graphs.
For valid passwords of lengths 6, 7, and 8 using specified character sets, solve for total valid combinations accounting for at least one digit.
Group by length for efficient counting.
4 more questions in this section. Enroll free to practise them all.
Enroll free