Question

N9 8 Турнир по шахматам проходит по следующей системе: каждый из 13 учеников школы «Белая ладья» должен сыграть один раз с каждым из 30 учеников школы «Черный слон», т.е. всего должно быть проведено 390 партий. В каждый момент времени проводится не более одной партии. После п партий болельщик Саша, который смотрел все партии и знает всех участников, воскликнул: «Я точно могу назвать одного из участников следующей партии!» При каком наименьшем п такое могло случиться? Число? СРОЧНОО​

Answer 1

Ответ:

29

Пошаговое объяснение: хз

Answer 2

To determine the minimum number of games that must have been played for Sasha to confidently name one of the participants in the next game, we need to consider the total number of possible pairings.

Given that there are 13 students from the "White Rook" school and 30 students from the "Black Bishop" school, the total number of possible pairings is the product of the number of students from each school: 13 * 30 = 390.

Since only one game can be played at a time, after p games have been played, there will be p pairings that have already taken place. Sasha claims that he can confidently name one of the participants in the next game. This means that he must have observed all the previous games and knows all the participants.

To determine the minimum value of p, we need to find the smallest value of p such that Sasha can confidently name one of the participants in the next game. This occurs when Sasha has observed all possible pairings except for one.

Since there are 390 total pairings, Sasha can confidently name one of the participants in the next game after observing 389 games. Therefore, the minimum value of p is 389.

Answer: 389