Maths Olympiad Prep

Library / /194 of 520

Combinatorics Difficulty 5.4 AIME, harder Find the answer

At a gathering, nn invitees arrived, including Mr. Balogh. Besides them, there is a journalist who wants to talk to Mr. Balogh. The journalist knows that no one knows Mr. Balogh, but Mr. Balogh knows everyone. The journalist can approach any of the invitees and ask if they know any other person.

a) Can the journalist definitely find Mr. Balogh with fewer than nn questions?

b) How many questions does the journalist need to find Mr. Balogh if they are lucky?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

The journalist, pointing to someone (let's call this person XX), asks another person (YY) if they know them. If the answer is YES, then XX cannot be Mr. Balogh, as no one knows him. If the answer is NO, then YY cannot be Mr. Balogh, as he knows everyone. Therefore, with each question, exactly one person is eliminated, and at the end, after n1n-1 questions, only one person remains, Mr. Balogh. Thus, he can definitely be found with n1n-1 questions.

He will be lucky if he can find Mr. Balogh with as few questions as possible. However, no matter how he proceeds, he can only find Mr. Balogh after eliminating n1n-1 people, and with each question, he can only eliminate one person, so he will always need n1n-1 questions.

Keve Kurucz (Révkomárom, Selye J. Gimn., 10th grade)

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.