IFOA_CAA_M0 practice question 4 of 15

A coin is tossed 7 times. Calculate the number of possible combinations that gives 4 heads and 3 tails.

Full set: 64 questions
Answer options
A: 35 Correct answer
B: 42
C: 210
D: 840
Correct Answer:
A. 35
Explanation

This problem requires calculating the number of ways to choose a subset of items from a larger set where the order of selection does not matter. This is a combination problem. The formula for combinations is C(n, k) = n! / (k!(n-k)!), where 'n' is the total number of items and 'k' is the number of items to choose. Here, n = 7 (total coin tosses) and k = 4 (number of heads). Applying the formula: C(7, 4) = 7! / (4! (7-4)!) C(7, 4) = 7! / (4! 3!) C(7, 4) = (7 × 6 × 5) / (3 × 2 × 1) = 35. Therefore, there are 35 possible combinations to get 4 heads and 3 tails.

Why Incorrect

B. 42: This is an incorrect calculation of the combination formula.
C. 210: This is the result of a permutation P(7,3) = 7!/4! = 210. Permutations are incorrect here as the order of identical outcomes (heads) does not matter.
D. 840: This is the result of a permutation P(7,4) = 7!/3! = 840. This is also incorrect because combinations, not permutations, are required for this problem.

References

1. MIT OpenCourseWare. (2014). 18.05 Introduction to Probability and Statistics, Spring 2014. Lecture 3 Notes: Counting: Permutations and Combinations. Page 3, Section 3, "Combinations". The notes explicitly define the combination formula C(n, k) = n! / (k!(n-k)!) for choosing k elements from a set of n without regard to order. [Available at: ocw.mit.edu]

2. Stanford University. (2023). CS109: Probability for Computer Scientists. Handout #4: Combinatorics. Page 2, "Combinations (Binomial Coefficients)". This document details the "n choose k" formula for counting unordered sets, which directly applies to this problem. [Available at: web.stanford.edu/class/cs109/]

3. Ross, S. M. (2019). A First Course in Probability (10th ed.). Pearson. Chapter 1, Section 1.3, "Combinatorial Methods". This textbook, widely used in university courses, explains the fundamental principles of combinations for counting the number of possible arrangements of objects.

Scroll to Top