HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Seven people stand in a queue. Two of them are Asha and Ben…
HardMathematicsHigh School (9–10)Algebra › Permutations and CombinationsNumericalConceptualA-LevelIGCSEIB

Seven people stand in a queue. Two of them are Asha and Ben…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Seven people stand in a queue. Two of them are Asha and Ben.

  1. In how many ways can the queue form if Asha and Ben are at the two ends, in either order?
  1. In how many ways can it form if Asha is somewhere ahead of Ben?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Choices made one after another multiply. n!=n(n−1)⋯1n! = n(n - 1)\cdots 1n!=n(n−1)⋯1 and 0!=10! = 10!=1. The number of ordered choices of rrr objects from nnn different objects is nPr=n!(n−r)!{}^{n}P_{r} = \dfrac{n!}{(n - r)!}nPr​=(n−r)!n!​. Fill a place that has a condition first.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Part (a), the ends. Asha and Ben take the two end places in 222 ways (Asha first, or Ben first).

Step 2. The middle. The other 555 people fill the 555 places in between: 5!=1205! = 1205!=120 ways.

Step 3. Multiply. 2×120=2402 \times 120 = 2402×120=240.

Step 4. Part (b), all queues. 7!=50407! = 50407!=5040.

Step 5. Symmetry. Swap Asha and Ben in any queue. This pairs each queue with one where the order of the two is reversed. So exactly half of the queues have Asha ahead: 50402=2520\dfrac{5040}{2} = 252025040​=2520.

Answer: (a) 240240240. (b) 252025202520.

Log in to save this for later
← All Problems
← A phone lock accepts a code of four digits taken from 1, 2, 3, 4, 5, 6, 7…A coach has 10 students and must choose a team of 4… →
More onAlgebra › Permutations and Combinations

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Factorials and permutationsCounting Arrangements and Selections

More on this topic

  1. A game writes a four-digit number using the digits 0, 1, 2, 3, 4, 5, each digit at most once…Hard
  2. Find the positive whole number n in each equation. ⁿP₂ = 90; ⁿC₃ = 56; ^(n + 2)C₂ = 21Medium
  3. Six friends sit in a row of six seats. Two of them are Dev and Eli…Medium
An ice cream shop has 8 flavours. A customer picks 3 different flavours for a cone, and the order…Easy
  • A teacher has 5 boys and 4 girls. The boys include Ravi and Sam…Hard
  • All problems on this topic →