Tessellate S.T.E.M.S. (2019) - Computer Science - School - Set 4 - Objective Problem 3

In a conference of 9 9 scientists every scientist handshakes with exactly two other scientists. In how many ways can this happen?


This problem is a part of Tessellate S.T.E.M.S (2019)

0 26144 46656 30016

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Gediminas Sadzius
Dec 24, 2018

When the 9 scientists arrive at the conference, they find tables in the conference room arranged in one of the following ways:

1) one large round table,

2) two round tables - one small table with 3 seats and one with 6 seats,

3) two round tables - one table with 4 seats and one with 5 seats,

4) three round tables with 3 seats each.

Each scientist finds an empty seat, sits and shakes hands with the neighbour to the left and to the right:

  • for the table arrangement 1), the number of ways to shake hands is 9!/9/2=20160,

  • for the table arrangement 2), the number of ways to shake hands is 9!/3!/(9-3)! * 6!/6/2 =5040,

  • for the table arrangement 3), the number of ways to shake hands is 9!/4!/(9-4)! * 5!/5/2 * 4!/4/2=4536,

  • for the table arrangement 4), the number of ways to shake hands is 9!/(3! * 3! * 3!)/3!=280.

So the total number of ways to shake hands is 20160+5040+4536+280= 30016 \boxed{30016} .

How did you do the calculation for arrangement 4?

Atomsky Jahid - 2 years, 5 months ago

Log in to reply

hi Atomsky, this is by grouping 9 objects into 3 groups of 3, using general formula (mn)!/((n!)^m*m!), where mn is the number of objects (=9= 3 * 3 in this case), m groups (=3), n objects per group (=3). cheers, Ged

Gediminas Sadzius - 2 years, 5 months ago

I believe the answer is wrong. It should be 40320 (8!). That is the number of permutations of 8 things. Imagine that the people are numbered from 0 to 8. They form a ring with "0" and shake hands left and right. There was nothing in the original problem about tables and the people restricted to shaking hands only within those tables after the initial sitting..

A Former Brilliant Member - 2 years, 3 months ago

Log in to reply

I have assumed that some people will only shake hands among themselves, by forming a "closed group". For example, 3 people will shake hands with each other. If all 9 sit in a ring, they can only shake hands with their neighbours, unless they stretch hand to the person sitting on the other side of their neighbour. True there was nothing about the tables in the definition of the problem; I have used this as an easier way to illustrate my calculation process.

Gediminas Sadzius - 2 years, 3 months ago

Log in to reply

I say again: There was nothing in the original problem about forming groups and the people restricted to shaking hands only within those groups after the initial division in groups. Not knowing the number or sizes of those groups makes it impossible to answer this problem correctly.

A Former Brilliant Member - 2 years, 3 months ago

2 pending reports

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...