Fundamental Counting Principle

10 soru

Soru 1Soru

A logistics firm generates a 4-character tracking code, c1c2c3c4c_1 c_2 c_3 c_4, for express parcels according to the following rules:
- The first character, c1c_1, must be a non-zero digit (11 through 99).
- The second character, c2c_2, must be a vowel chosen from the set {A, E, I, O, U}\{\text{A, E, I, O, U}\}.
- The third character, c3c_3, must be an even digit (0,2,4,6,80, 2, 4, 6, 8).
- The fourth character, c4c_4, must be a consonant chosen from the set {B, F, G, K, M, P}\{\text{B, F, G, K, M, P}\}.

If no digit may be repeated within the code, how many different tracking codes can be created?

Cevabı ve açıklamayı göster

Cevap: 1230

Cevap

1230
To find the total number of unique tracking codes, calculate the independent choices for letters and dependent choices for digits. For digits c1c_1 and c3c_3, if c1c_1 is odd (1,3,5,7,91, 3, 5, 7, 9), there are 5×5=255 \times 5 = 25 ways to choose c3c_3. If c1c_1 is even (2,4,6,82, 4, 6, 8), there are 4×4=164 \times 4 = 16 ways to choose c3c_3, giving 4141 valid digit pairs. Multiplying by the 55 vowel options for c2c_2 and 66 consonant options for c4c_4 yields 41×5×6=123041 \times 5 \times 6 = 1230.

Adım Adım Çözüm

1
Determine valid digit choices for c1c_1 and c3c_3 considering the non-repetition constraint
Split into Case 1 (c1c_1 is odd) and Case 2 (c1c_1 is even)
The availability of even digits for c3c_3 depends on whether c1c_1 uses an even or odd digit.
2
Calculate the number of ways to pick c1c_1 and c3c_3
Case 1 (c1{1,3,5,7,9}c_1 \in \{1, 3, 5, 7, 9\}): 5×5=255 \times 5 = 25 ways. Case 2 (c1{2,4,6,8}c_1 \in \{2, 4, 6, 8\}): 4×4=164 \times 4 = 16 ways. Total digit combinations = 25+16=4125 + 16 = 41.
If c1c_1 is odd, all 5 even digits remain for c3c_3. If c1c_1 is even, only 4 even digits remain for c3c_3.
3
Calculate the number of ways to pick letters c2c_2 and c4c_4
5 choices for c2c_2 and 6 choices for c4c_4, giving 5×6=305 \times 6 = 30 letter combinations.
Vowels and consonants are chosen independently from distinct sets without restrictions between them.
4
Multiply independent stage outcomes using the Fundamental Counting Principle
41×30=123041 \times 30 = 1230
The overall number of distinct codes is the product of digit pair combinations and letter pair combinations.

Anahtar Kavram

Fundamental Counting Principle with Conditional Restrictions
Soru 2Soru

A diner offers a three-course meal deal where a customer selects 11 appetizer from a choice of 44, 11 main dish from a choice of 55, and 11 dessert from a choice of 33. How many different three-course meal combinations can a customer order?

Cevabı ve açıklamayı göster

Cevap: 6060

Cevap

The total number of unique three-course meal combinations is 6060.
According to the Fundamental Counting Principle, when a process involves a series of independent decision stages, the total number of possible outcomes is the product of the number of choices available at each stage. Multiplying 44 appetizers by 55 main dishes and 33 desserts yields 4×5×3=604 \times 5 \times 3 = 60 distinct meal combinations.

Adım Adım Çözüm

1
Identify the number of independent choices available at each decision stage
Appetizer choices = 44, Main dish choices = 55, Dessert choices = 33
Each course selection represents an independent decision stage.
2
Apply the Fundamental Counting Principle by multiplying the number of options for all stages
4×5×3=604 \times 5 \times 3 = 60
The total number of multi-stage outcomes is the product of the number of options at each individual stage.

Anahtar Kavram

Fundamental Counting Principle
Soru 3Soru

A security system requires each employee to create a 6-character access code consisting of 3 non-zero digits followed by 3 letters from the standard 26-letter English alphabet. The access code must satisfy the following restrictions:

1. The first digit must be odd.
2. No two adjacent digits in the code can be identical.
3. The first letter must be a vowel (A,E,I,O,UA, E, I, O, U), the second letter must be a consonant, and the third letter cannot be identical to the first letter.

How many distinct access codes can be created under these rules?

Cevabı ve açıklamayı göster

Cevap: 840,000840,000

Cevap

840,000840,000
The total number of valid codes is obtained by multiplying the number of choices at each stage. For the digits: 55 (odd non-zero) ×8\times 8 (non-zero digit \neq 1st digit) ×8\times 8 (non-zero digit \neq 2nd digit) =320= 320. For the letters: 55 (vowels) ×21\times 21 (consonants) ×25\times 25 (any letter \neq 1st letter) =2,625= 2,625. The overall number of codes is 320×2,625=840,000320 \times 2,625 = 840,000.

Adım Adım Çözüm

1
Calculate the number of choices for the first 3 digit positions.
5 choices for the 1st digit, 8 choices for the 2nd digit, and 8 choices for the 3rd digit.
Non-zero odd digits are {1,3,5,7,9}\{1, 3, 5, 7, 9\} (5 choices). The 2nd digit can be any non-zero digit except the 1st digit (91=89 - 1 = 8 choices). The 3rd digit can be any non-zero digit except the 2nd digit (91=89 - 1 = 8 choices). Thus, 5×8×8=3205 \times 8 \times 8 = 320 digit combinations.
2
Calculate the number of choices for the 3 letter positions.
5 choices for the 1st letter, 21 choices for the 2nd letter, and 25 choices for the 3rd letter.
There are 5 vowels and 21 consonants in the 26-letter alphabet. The 1st letter has 5 choices. The 2nd letter has 21 choices (consonant). The 3rd letter can be any letter except the 1st letter (261=2526 - 1 = 25 choices). Thus, 5×21×25=2,6255 \times 21 \times 25 = 2,625 letter combinations.
3
Apply the Fundamental Counting Principle to find the total number of access codes.
320×2,625=840,000320 \times 2,625 = 840,000
Since choosing the digits and choosing the letters are independent stages of creating a code, multiply the total number of digit combinations by the total number of letter combinations.

Anahtar Kavram

Fundamental Counting Principle with Positional Restrictions
Soru 4Soru

A security analyst is designing a 4-character access code consisting of a digit, followed by two letters, followed by another digit. The code must be constructed according to the following rules:

- The first character must be a prime digit chosen from the set of single-digit integers {0,1,2,3,4,5,6,7,8,9}\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}.
- The second and third characters must be distinct uppercase letters selected from the set {A,B,C,D,E}\{A, B, C, D, E\}.
- The fourth character must be an odd digit chosen from the set of single-digit integers {0,1,2,3,4,5,6,7,8,9}\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}, such that it is not equal to the first digit.

How many different 4-character access codes can be created following these rules?

Cevabı ve açıklamayı göster

Cevap: 340

Cevap

340 access codes
The correct count of 340 is obtained by separating the problem into two distinct cases based on whether the prime first digit is even or odd. For the even prime digit (2), there are 5 possible odd digits for the fourth slot, yielding 100 codes. For the three odd prime digits (3, 5, 7), the fourth slot has 4 available choices to avoid duplicating the first digit, yielding 240 codes. Summing both cases gives 340.

Adım Adım Çözüm

1
Identify the set of prime single-digit integers.
The prime digits among 00 through 99 are 2,3,5,2, 3, 5, and 77 (a total of 44 options). Note that 22 is even, while 3,5,3, 5, and 77 are odd.
11 is not prime by definition, and 0,4,6,8,90, 4, 6, 8, 9 are composite or neither.
2
Calculate the number of ways to choose the two distinct letter characters.
5×4=205 \times 4 = 20 possible two-letter arrangements.
There are 55 choices for the second character and 44 remaining choices for the third character since they must be distinct.
3
Evaluate Case 1: The first digit is the even prime digit (22).
1×20×5=1001 \times 20 \times 5 = 100 codes.
There is 11 choice for the first digit (22). The odd digits available for the fourth character are 1,3,5,7,91, 3, 5, 7, 9 (55 choices). Since 22 is even, it never matches any odd digit.
4
Evaluate Case 2: The first digit is an odd prime digit (3,5,3, 5, or 77).
3×20×4=2403 \times 20 \times 4 = 240 codes.
There are 33 choices for the first digit. The odd digits available for the fourth character are 1,3,5,7,91, 3, 5, 7, 9 (55 total), but the fourth digit cannot equal the first digit, leaving 51=45 - 1 = 4 choices.
5
Sum the total codes across both mutually exclusive cases.
100+240=340100 + 240 = 340 total codes.
By the Fundamental Counting Principle and Addition Principle for disjoint sets.

Anahtar Kavram

Fundamental Counting Principle with Conditional Restrictions and Case Analysis
Tahmini Süre:2m 0s
Soru 5Soru

An airline creates a 55-character identification code for each of its cargo routes. The characters in the code must satisfy the following sequential rules from left to right:

1. The first character must be a non-zero even digit.
2. The second and third characters must be distinct uppercase vowels chosen from the set {A,E,I,O,U}\{A, E, I, O, U\}.
3. The fourth character must be a single-digit prime number.
4. The fifth character must be a single digit (00 through 99) such that the sum of the first digit and the fifth digit is odd.

How many such unique identification codes can the airline create?

Cevabı ve açıklamayı göster

Cevap: 1600

Cevap

1,600 unique identification codes
To find the total number of unique identification codes, we evaluate the number of available options for each character position and multiply them together using the Fundamental Counting Principle:

1. First position (non-zero even digit): The even digits from 0 to 9 are 0,2,4,6,80, 2, 4, 6, 8. Excluding 0 leaves 44 options (2,4,6,82, 4, 6, 8).
2. Second and third positions (distinct vowels): There are 55 vowels (A,E,I,O,UA, E, I, O, U). The second position has 55 options, and the third position has 44 remaining options, yielding 5×4=205 \times 4 = 20 combinations.
3. Fourth position (prime digit): The single-digit primes are 2,3,5,72, 3, 5, 7, giving 44 options.
4. Fifth position (parity condition): The sum of the first digit and fifth digit must be odd. Since the first digit is an even number, the fifth digit must be an odd number to make the sum odd. The single-digit odd numbers are 1,3,5,7,91, 3, 5, 7, 9, giving 55 options.

Multiplying the choices for all positions gives:
4×20×4×5=1,6004 \times 20 \times 4 \times 5 = 1,600

Adım Adım Çözüm

1
Determine the number of valid choices for the 1st position (non-zero even digit).
4 choices (2,4,6,82, 4, 6, 8).
The digit 0 is excluded because the first character must be non-zero.
2
Determine the number of valid choices for the 2nd and 3rd positions (distinct vowels).
5×4=205 \times 4 = 20 choices.
There are 5 vowels available for the 2nd position, and 4 remaining vowels for the 3rd position since they must be distinct.
3
Determine the number of valid choices for the 4th position (prime digit).
4 choices (2,3,5,72, 3, 5, 7).
The single-digit prime numbers are 2, 3, 5, and 7.
4
Determine the number of valid choices for the 5th position (parity constraint).
5 choices (1,3,5,7,91, 3, 5, 7, 9).
The sum of an even integer and another integer is odd if and only if the second integer is odd. Since the 1st digit is guaranteed to be even, the 5th digit must be odd.
5
Apply the Fundamental Counting Principle across all 5 sequential stages.
4×20×4×5=1,6004 \times 20 \times 4 \times 5 = 1,600 unique codes.
Each stage represents an independent decision stage with a fixed number of valid choices.

Anahtar Kavram

Fundamental Counting Principle with Restricted Positions and Parity Rules
Tahmini Süre:2m 0s
Soru 6Soru

A tech company generates a 5-digit security badge number, represented as d1d2d3d4d5d_1 d_2 d_3 d_4 d_5, using digits from 00 to 99, inclusive. The badge numbers must satisfy the following constraints:
- The first digit, d1d_1, cannot be 00 or 11.
- The second and third digits, d2d_2 and d3d_3, must be distinct even digits.
- The fourth digit, d4d_4, must be an odd digit strictly greater than 33.
- The fifth digit, d5d_5, can be any digit except that it cannot be equal to d1d_1.

How many different 5-digit badge numbers can be created under these rules?

Cevabı ve açıklamayı göster

Cevap: 4,320

Cevap

4,320
According to the Fundamental Counting Principle, the total number of configurations is the product of the number of options available at each stage. For the first position, excluding 0 and 1 leaves 8 possible digits. For the second position, any of the 5 even digits can be chosen. For the third position, one of the remaining 4 even digits must be selected to preserve distinctness. For the fourth position, the odd digits strictly greater than 3 are 5, 7, and 9, providing 3 options. Finally, for the fifth position, 9 digits remain available after excluding the specific digit chosen for the first position. Multiplying these independent counts gives 8 × 5 × 4 × 3 × 9 = 4,320.

Adım Adım Çözüm

1
Determine the number of available choices for the first digit, d1d_1.
8 choices
The available digits are 00 through 99 (10 total). Excluding 00 and 11 leaves {2,3,4,5,6,7,8,9}\{2, 3, 4, 5, 6, 7, 8, 9\}, which gives 102=810 - 2 = 8 choices.
2
Determine the number of available choices for the second and third digits, d2d_2 and d3d_3.
20 choices total for (d2,d3)(d_2, d_3)
The set of even digits is {0,2,4,6,8}\{0, 2, 4, 6, 8\}, containing 5 digits. There are 5 choices for d2d_2. Since d3d_3 must be distinct from d2d_2, there are 51=45 - 1 = 4 choices for d3d_3. Thus, there are 5×4=205 \times 4 = 20 choices.
3
Determine the number of available choices for the fourth digit, d4d_4.
3 choices
The set of odd digits is {1,3,5,7,9}\{1, 3, 5, 7, 9\}. Odd digits strictly greater than 33 are {5,7,9}\{5, 7, 9\}, which gives 3 choices.
4
Determine the number of available choices for the fifth digit, d5d_5.
9 choices
d5d_5 can be any digit from 00 through 99 except d1d_1. Out of 10 total digits, excluding 1 digit leaves 101=910 - 1 = 9 choices.
5
Apply the Fundamental Counting Principle to compute total combinations.
4,320
Multiply the number of independent choices across all 5 stages: 8×5×4×3×9=4,3208 \times 5 \times 4 \times 3 \times 9 = 4,320.

Anahtar Kavram

Fundamental Counting Principle with Multi-Stage Positional Restrictions
Soru 7Soru

A medical research laboratory creates a 4-digit identification code, d1d2d3d4d_1 d_2 d_3 d_4, for sample trays using digits selected from the set {1,2,3,4,5,6,7,8}\{1, 2, 3, 4, 5, 6, 7, 8\}. The digits in each code must satisfy the following conditions:
- The first digit, d1d_1, must be an odd prime number.
- The second digit, d2d_2, must be an even integer.
- All four digits in the code must be distinct.

How many different identification codes can be created under these rules?

Cevabı ve açıklamayı göster

Cevap: 360

Cevap

360
To form the 4-digit code, we calculate the number of options at each sequential stage. First, d1d_1 must be an odd prime from {1,2,3,4,5,6,7,8}\{1, 2, 3, 4, 5, 6, 7, 8\}, which gives 33 options (3,5,73, 5, 7). Second, d2d_2 must be an even integer from the set, giving 44 options (2,4,6,82, 4, 6, 8). Third, because all digits must be distinct, picking d1d_1 and d2d_2 uses 22 digits, leaving 82=68 - 2 = 6 choices for d3d_3 and 55 choices for d4d_4. By the Fundamental Counting Principle, the total number of codes is 3×4×6×5=3603 \times 4 \times 6 \times 5 = 360.

Adım Adım Çözüm

1
Determine the number of valid choices for the first digit (d1d_1)
3 choices (3,5,73, 5, 7)
The odd prime numbers in the given set {1,2,3,4,5,6,7,8}\{1, 2, 3, 4, 5, 6, 7, 8\} are 3,5,3, 5, and 77. Note that 11 is not prime and 22 is an even prime.
2
Determine the number of valid choices for the second digit (d2d_2)
4 choices (2,4,6,82, 4, 6, 8)
The even integers in the given set are 2,4,6,2, 4, 6, and 88. Notice that the set of choices for d1d_1 and d2d_2 are disjoint.
3
Determine the number of valid choices for the third digit (d3d_3) and fourth digit (d4d_4)
6 choices for d3d_3 and 5 choices for d4d_4
Since all 4 digits must be distinct, 2 distinct digits have already been used for d1d_1 and d2d_2. From the original set of 8 digits, 82=68 - 2 = 6 digits remain for d3d_3, and then 55 digits remain for d4d_4.
4
Apply the Fundamental Counting Principle to calculate the total number of codes
3×4×6×5=3603 \times 4 \times 6 \times 5 = 360
The overall number of distinct multi-stage decisions is found by multiplying the number of choices available at each stage.

Anahtar Kavram

Fundamental Counting Principle with Restricted and Non-Repeating Selections
Tahmini Süre:2m 0s
Soru 8Soru

A furniture manufacturer allows customers to customize a dining set by selecting options from four categories:
- Tabletop shape: rectangular, oval, or round (3 choices)
- Wood finish: oak, walnut, cherry, or maple (4 choices)
- Leg design: tapered, hairpin, or turned (3 choices)
- Number of chairs: 4, 6, or 8 (3 choices)

However, due to space constraints, a round tabletop cannot be paired with a set of 8 chairs. How many distinct dining set configurations can a customer assemble?

Cevabı ve açıklamayı göster

Cevap: 96

Cevap

96 distinct dining set configurations can be assembled.
To find the number of valid dining set configurations, calculate total unrestricted choices using the Fundamental Counting Principle: multiplying 3 tabletop shapes, 4 wood finishes, 3 leg designs, and 3 chair count options gives 108 total combinations. Next, count the prohibited combinations consisting of a round tabletop (1 option) paired with 8 chairs (1 option) across all 4 finishes and 3 leg designs, giving 1 × 4 × 3 × 1 = 12 restricted combinations. Subtracting 12 restricted combinations from 108 total combinations yields 96 valid configurations.

Adım Adım Çözüm

1
Calculate total possible combinations without restrictions
3 × 4 × 3 × 3 = 108 combinations
By the Fundamental Counting Principle, multiplying the number of available options across all independent decision stages gives the total number of unrestricted arrangements.
2
Calculate the number of invalid configurations violating the space constraint
1 × 4 × 3 × 1 = 12 invalid combinations
Restricted configurations consist of 1 tabletop shape (round), 4 wood finishes, 3 leg designs, and 1 chair quantity selection (8 chairs).
3
Subtract the invalid combinations from the total unrestricted combinations
108 - 12 = 96 valid configurations
Subtracting the prohibited configurations from the total possible combinations yields the count of permissible configurations.

Anahtar Kavram

Fundamental Counting Principle with Subtraction of Restricted Cases
Soru 9Soru

An artisan tea shop allows customers to order a custom tea blend prepared through three sequential choices:

1. Base Tea: Choose 11 of 44 available tea types (Black, Green, Oolong, or White).
2. Flavor Infusion: Choose 11 of 55 available herbal flavors. However, if Black tea is chosen as the base, only 33 of these 55 herbal flavors can be selected.
3. Sweetener: Choose 11 of 33 natural sweeteners (Honey, Stevia, or Maple Syrup), or choose to have no sweetener.

How many different custom tea blends can a customer create?

Cevabı ve açıklamayı göster

Cevap: 7272

Cevap

72 different custom tea blends can be created.
To solve this counting problem with conditional restrictions, break the calculation into two mutually exclusive cases based on the base tea chosen:

1. Case 1: Black Tea Base
- Base tea options: 11 (Black)
- Flavor infusion options: 33 (restricted subset)
- Sweetener options: 44 (33 sweeteners + 11 option for no sweetener)
- Combinations = 1×3×4=121 \times 3 \times 4 = 12

2. Case 2: Non-Black Tea Base (Green, Oolong, or White)
- Base tea options: 33
- Flavor infusion options: 55 (all available)
- Sweetener options: 44
- Combinations = 3×5×4=603 \times 5 \times 4 = 60

Adding the combinations from these two mutually exclusive cases yields 12+60=7212 + 60 = 72 total custom tea blends.

Adım Adım Çözüm

1
Identify total options available for the sweetener stage.
There are 33 sweetener choices plus 11 choice for 'no sweetener', making 3+1=43 + 1 = 4 total options for Stage 3.
Choosing 'no sweetener' is a distinct decision outcome that must be counted.
2
Calculate the number of blends when Black tea is chosen as the base.
Number of Black tea blends = 1 (Black base)×3 (flavors)×4 (sweetener choices)=121 \text{ (Black base)} \times 3 \text{ (flavors)} \times 4 \text{ (sweetener choices)} = 12.
When Black tea is chosen, only 33 flavor infusions are permitted.
3
Calculate the number of blends when any non-Black tea is chosen as the base.
Number of non-Black tea blends = 3 (Green, Oolong, White bases)×5 (flavors)×4 (sweetener choices)=603 \text{ (Green, Oolong, White bases)} \times 5 \text{ (flavors)} \times 4 \text{ (sweetener choices)} = 60.
There are 33 non-Black base choices, and each can be paired with any of the 55 flavor infusions.
4
Sum the combinations from both mutually exclusive cases.
Total blends = 12+60=7212 + 60 = 72.
Since selecting Black tea and selecting non-Black tea are mutually exclusive cases, their individual counts are added.

Anahtar Kavram

Fundamental Counting Principle with Conditional Restrictions
Tahmini Süre:1m 45s
Soru 10Soru

An architectural firm offers custom townhouse design packages created by making sequential choices across three stages: Exterior Facade Material (4 choices), Floor Plan Layout (5 choices), and Interior Lighting Scheme (6 choices).

However, two design constraints apply:
1. If the first exterior facade material option is chosen, the fifth floor plan layout option cannot be selected.
2. The sixth interior lighting scheme option can only be selected if the fifth floor plan layout option is chosen.

How many different valid townhouse design packages can a client create?

Cevabı ve açıklamayı göster

Cevap: 98

Cevap

The total number of valid townhouse design packages is 98.
The solution splits the decision process into two mutually exclusive scenarios based on whether the 5th layout option is chosen. In Case 1 (5th layout chosen), 3 facade choices × 1 layout choice × 6 lighting choices yields 18 valid packages. In Case 2 (1st through 4th layout chosen), 4 facade choices × 4 layout choices × 5 lighting choices yields 80 valid packages. Adding these mutually exclusive totals gives 18 + 80 = 98 valid design packages.

Adım Adım Çözüm

1
Analyze the decision tree by splitting into mutually exclusive cases based on whether Floor Plan Layout Option 5 is selected.
Two distinct cases are established: Case 1 (Layout Option 5 selected) and Case 2 (Layout Options 1–4 selected).
The constraints depend directly on whether Floor Plan Layout Option 5 is chosen.
2
Calculate valid combinations for Case 1 (Layout Option 5 selected).
Facade choices = 3 (excluding Option 1), Layout choices = 1 (Option 5), Lighting choices = 6 (including Option 6). Total = 3 × 1 × 6 = 18 packages.
Constraint 1 eliminates 1 facade option, while Constraint 2 allows all 6 lighting options.
3
Calculate valid combinations for Case 2 (Layout Option 5 NOT selected).
Facade choices = 4, Layout choices = 4 (Options 1–4), Lighting choices = 5 (excluding Option 6). Total = 4 × 4 × 5 = 80 packages.
Constraint 1 does not apply, but Constraint 2 prevents selecting Lighting Option 6.
4
Sum the valid outcomes from both mutually exclusive cases.
18 + 80 = 98 valid packages.
By the Addition Principle of Counting, non-overlapping cases are added together.

Anahtar Kavram

Fundamental Counting Principle with Constrained Cases
Fundamental Counting Principle Alıştırma Soruları — GMAT | Examkin