Start learning →

What is a combination?

AA selection in which order does not matter
BA selection in which every order counts once
CA selection made only from distinct objects
DA selection that must use all n objects
Answer & Solution
Correct answer: A. A selection in which order does not matter
1. A combination picks a group of objects without caring how they are arranged. 2. Choosing items 1, 2, 3 is therefore the same combination as choosing items 2, 3, 1. 3. That is why a combination count is always smaller than the matching permutation count. 4. A selection where order matters is a permutation, so that option describes the opposite idea. _Source: OpenStax Algebra and Trigonometry (CC BY 4.0), Ch 13 "Sequences, Probability and Counting Theory", section 13.5 Counting Principles_
Practise this question with Quill — B.Sc Mathematics →

Keep practising Sequences, Probability and Counting Theory

Browse all Sequences, Probability and Counting Theory questions for B.Sc Mathematics, or explore more Mathematics topics.

Start a Sequences, Probability and Counting Theory lesson →
Related questions