# Generalising Urgent Meetings

First see the following problem ::

There are M people at a conference. Initially nobody at the conference knows the name of anyone else. The conference holds several N - person meetings in succession, in which each person at the meeting learns (or relearns) the name of the other people present in that meeting. What is the minimum number of meetings needed until every person knows everyone elses name?

I found that if M = 2N and N is divisible by 2 , then answer is 6 ; if M = 3N and N is divisible by 3 , then answer is 12..

In other words if M is an integral multiple (let the integer be G) of N, and N is divisible by that same integer (G), then the answer can be found out easily (unless the integer is large i.e. of 2 digits in which case the cases will become numerous).

Is there any easy way of computing if G > 10 ?

Can I generalise it for (say) M = 4N + 5 or M = 5N - 4 ?

Can I generalise it for any M , N ?

Note by Santanu Banerjee
6 years, 7 months ago

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
• Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$

Sort by:

The actual problem was ::

There are 32 people at a conference. Initially nobody at the conference knows the name of anyone else. The conference holds several 16-person meetings in succession, in which each person at the meeting learns (or relearns) the name of the other fteen people. What is the minimum number of meetings needed until every person knows everyone elses name? Answer: 6 .

- 6 years, 7 months ago