ruis
ruis
Is there another approach to this question without polygons? I get the following:
Total time: 28 minutes
28/2 = 14 pairs singing
From that I would have done nC2 = 14... Which leads to nowhere. I still struggle to understand nC2 - n = 14. Geometry is not my strength.
How can I anchor the restriction here? "Not standing next to each other" You always have 2 people next....
Favorable outcome / all possible ourcomes...14 is my favourable outcome right? I am getting super confused here.
Also, as they stand on a circunference, should we take into account circular arrangement type of Permutation? (n-1)!? Instead con Combination?
Is this a quality question? Should I stick only to practicing only official questions?
It took me a long time to understand that te restriction is -n. I got there by drawing difference scenarios. Still struggling with solvimg fast the green writing… I would just plug numbers and run
However I would have never been able to answer this qq under 2 mins. Would love to read other reasonings! Thank you everyone!!!
Posted from my mobile deviceFirst recognize that the number of pairs without restriction is
N!/2!(N-2)! = N(N-1)/2
The restriction is no pairs of people next to each other.
So just imagine them in a line of, say, 4 people.
The first person is paired with the second, second with third and third with fourth.
How many pairs is that ?
4-1 = 3, which is N-1.
But, in a circle, the last person can also be paired with the first, so that's another pair, so the total disallowed pairs is:
N
Answering the question then becomes:
{[(N(N-1)/2]-N}*2 = 28, or:
N^2-3N-28 = 0.
This factors into:
(N-7)(N+4) = 0 and:
N=7
Visualizing polygons is completely unnecessary.