On this page
In combinatorics, one of the classic problems involves hoisting different coloured flags on a vertical pole. By calculating the number of arrangements, you are using the fundamental principle of counting. When the order matters—like placing a red flag above a green one instead of green above red—you are working with permutations.
We can solve these problems step by step by looking at the "vacant positions" on the flagpole and multiplying the number of options available for each position.
How many signals can be made with exactly 2 flags?
Imagine you have 5 flags of different colours available and a vertical pole with space for just 2 flags. To find out how many different signals can be generated, you treat the pole as having two empty slots: an upper position and a lower position.
For the upper position, you can choose any of the 5 colours. Once that first flag is hoisted, you cannot use that same colour again, which leaves you with exactly 4 flags for the next spot. The lower position can then be filled with any of these remaining 4 colours.
According to the fundamental multiplication principle, you simply multiply the choices for each independent step. The number of possible signals using exactly two flags out of five is 5 × 4 = 20 (NCERT Class 11 Maths).
If you are dealing with similar problems like counting letters in the wrong envelopes or dividing people into groups, breaking the arrangement into independent steps always simplifies the maths.
Applying the permutation formula
While visualising empty slots works perfectly, you can also solve this using the standard mathematical formula for permutations, denoted as ⁿPᵣ. This formula calculates the number of ways to arrange r items chosen from a pool of n distinct items.
The mathematical definition of the permutation formula is ⁿPᵣ = n! / (n - r)!.
If we apply this to our 5 flags where we need to select exactly 2, we set n = 5 and r = 2. This gives us ⁵P₂ = 5! / (5 - 2)! = 5! / 3!. When we expand the factorials, we get (5 × 4 × 3 × 2 × 1) / (3 × 2 × 1). The 3, 2, and 1 cancel out, leaving us with exactly 5 × 4 = 20.
Learning to use both the slot-filling visualisation and the ⁿPᵣ formula acts as a great cross-check during exams.
How many signals can be made with at least 2 flags?
A common exam variation, such as Example 4 in the NCERT Class 11 Maths textbook, asks how many signals can be made if you must use *at least* 2 flags out of the 5 available.
"At least 2" introduces the addition principle. It means a valid signal could be made of 2 flags, *or* 3 flags, *or* 4 flags, *or* 5 flags. We calculate the combinations for each scenario individually and add them up.
Using 2 flags: As we found above, there are 5 × 4 = 20 signals.
Using 3 flags: There are 5 choices for the top, 4 for the middle, and 3 for the bottom slot. This yields 5 × 4 × 3 = 60 signals.
Using 4 flags: With four slots, you calculate 5 × 4 × 3 × 2 = 120 signals.
Using 5 flags: With all five slots filled, you calculate 5 × 4 × 3 × 2 × 1 = 120 signals.
By adding all these possibilities together (20 + 60 + 120 + 120), the total number of signals generated is 320.
Why does the order matter in this problem?
Flags on a vertical pole are read from top to bottom. A red flag above a blue flag sends a completely different message to ships or troops than a blue flag above a red flag. Because the order fundamentally changes the outcome, this is definitively a permutation problem.
If the problem did not care about the order—for instance, if you were just randomly picking flags to throw into a bag—it would be a combination problem. The distinction between permutations (order matters) and combinations (order does not matter) is the core of counting geometry. You can see this difference clearly in other standard questions, like why 10 people make 45 handshakes, where the order of shaking hands does not create a new pairing.
If you struggle with whether a problem needs permutations or combinations, the Fermi Concept Library clarifies these underlying counting principles. When a question feels overwhelming, try the Fermi Problem Library to see the step-by-step reasoning rather than just printing an answer.
