We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website.
Please click on "Accept cookies" if you agree to the setting of cookies. Cookies that do not require consent remain unaffected by this, see
cookie policy and privacy policy.
DECLINE COOKIES

After a gymnastics meet, each gymnast shook hands once with every gymnast on every team (except herself). Afterwards, a coach came down and only shook hands with each gymnast from her own team. There were a total of 281 handshakes. What is the fewest number of handshakes the coach could have participated in?

KnockOut Oct 21, 2018

#2**+9 **

I honestly do not know. This is all the problem provided me with. So I'm guessing that team size does not necessarily matter, but I'm not sure.

KnockOut Oct 21, 2018

#4**+1 **

"There was a total of 281 handshakes. What is the fewest number of handshakes the **coach** could have participated in?"

Which coach?

Guest Oct 21, 2018

#5**+9 **

@Guest, so what this problem is trying to ask, is that there is one certain team, and the gymnasts from that certain team is doing handshakes with gymnasts from other teams. The "coach" is the coach from that certain team.

KnockOut Oct 21, 2018

#6**+9 **

Okay, so let me explain this problem better so that someone can explain the answer to me.

Alrighty.

So yes, the teams are supposed to be the same size. There are \(x\) number of teams, and \(y\) number of gymnasts on each team.

*EVERY* gymnast must shake hands with *EVERYONE* else except for herself.

After this handshaking process finished, a *single coach on a certain team* came down and only shook the hands of the gymnasts on that certain team with \(y\) gymnasts.

In total, there were 281 handshakes. We are trying to solve for the number of handshakes that the *single coach on that certain team* made, and since the coach only shook the hands of the gymnasts on her own team, I guess we are solving for \(y\).

So rewriting the problem, we get: Solve for the lowest possible value of \(y\).

KnockOut Oct 21, 2018

#9**+9 **

I'm just earning hints as we go. After I asked about what you said, it seems as if you are not supposed to consider the seperate teams as much, but instead the gymnasts by themselves.

The answer is \(\boxed 5\) but I need to type up an explanation now if someone can help.

KnockOut Oct 21, 2018

#11**+2 **

**Solution:**

_{(Adapted from dialogues with Lancelot Link)}

\(\text {Note the “handshake” formula: n(n – 1)/2 = h where (n) is the number of persons and (h) is the number of handshakes. }\\ \text {In this question the number of handshakes is depicted by }\\ \left . y + \dfrac {(xy)(xy-1)}{2} = 281 \right | \text { where (x) = number of teams, (y) = number of gymnasts. }\\ \text {Using (n) as the product of (xy) gives } y + \dfrac {n(n-1)}{2} = 281\\ \text {Find the largest integer for (n), such that }\dfrac {n(n-1)}{2} \lt 281\\ \tiny \text {(If you want to be lazy, look up OEIS A000217 “Triangular” numbers and count them. Or ...)}\\ \text {To “zero” in on the largest integer, choose a few arbitrary values for (n). }\\ n=20; n(n-1)/2 = 190\\ n=25; n(n-1)/2 = 300\\ n=24; n(n-1)/2 = 276 \leftarrow \text { This one. }\\ \;\\ y + 276 = 281\\ y = 281 – 276\\ y = 5\\ \)

GA

GingerAle Oct 21, 2018