UPSC Prelims 2023 CSAT Q66 · Numeracy
A flag has to be designed with 4 horizontal stripes using some or all of the colours red, green and yellow. What is the number of different ways in which this can be done so that no two adjacent stripes have the same colour?
- a12
- b18
- c24
- d36
Show answer & explanationHide answer
The top stripe can be coloured in 3 ways, and each subsequent stripe can be coloured in 2 ways different from the stripe immediately above it, giving 3 × 2 × 2 × 2 = 24 total ways.
Statement-by-statement analysis
- This value of 12 is obtained if one incorrectly assumes that non-adjacent stripes cannot repeat colours, leading to 3 × 2 × 2 × 1.
- It over-constrains the problem by reducing options for the fourth stripe to only 1 choice.
- This result of 18 occurs due to miscalculating choices per stripe as 3 × 3 × 2 × 1.
- It fails to apply the adjacent-stripe restriction uniformly across all 4 positions.
- The top stripe can be coloured using any of the 3 available colours.
- Each subsequent stripe has 2 choices because it only cannot match the stripe directly above it, yielding 3 × 2 × 2 × 2 = 24 ways.
- This result of 36 is obtained by calculating 3 × 3 × 2 × 2.
- It incorrectly assumes that the second stripe has 3 choices, violating the rule that adjacent stripes must have different colours.
Concept to know
- Fundamental Principle of Multiplication states that if sequential choices have m, n, p, and q options, the total combinations are m × n × p × q.
- Stripe 1 has no previous stripe restricting it, so it can be coloured in 3 ways using Red, Green, or Yellow.
- Stripe 2 cannot have the same colour as Stripe 1, leaving 3 - 1 = 2 available choices.
- Stripe 3 cannot have the same colour as Stripe 2, leaving 3 - 1 = 2 available choices, as it can reuse Stripe 1's colour.
- Stripe 4 cannot have the same colour as Stripe 3, leaving 3 - 1 = 2 available choices, as it can reuse Stripe 2's colour.
- Multiplying the options for all four stripes gives 3 × 2 × 2 × 2 = 24 distinct ways.
Related facts for revision
- Closed Loop or Ring Colouring: If the top and bottom stripes must also have different colours, the problem converts to ring colouring where cases are split based on whether Stripe 1 and Stripe 3 have identical or different colours.
- Exact Colour Usage Constraint: If all 3 colours must be used at least once, calculate total valid ways and subtract configurations that use only 2 colours.
- Map Colouring Logic: The problem is a 1-dimensional graph colouring problem on a path graph with 4 vertices using 3 available colours.
- Inclusion-Exclusion Method: Used in complex arrangement problems where multiple restrictions overlap across positions.
Application of basic permutation rules and adjacent-element constraints in sequential independent decisions.
Trap: Misinterpreting adjacent as non-adjacent, leading students to believe that Stripe 3 cannot use the colour of Stripe 1, which wrongly reduces choices.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.