Difference between revisions of "2022 USAMO Problems/Problem 6"
Hhuangterry (talk | contribs) (→Solution 1) |
(→Solution 1) |
||
| Line 5: | Line 5: | ||
==Solution 1== | ==Solution 1== | ||
| − | + | No Solution Yet | |
| − | |||
==See also== | ==See also== | ||
{{USAMO newbox|year=2022|num-b=5|after=Last Problem}} | {{USAMO newbox|year=2022|num-b=5|after=Last Problem}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 17:01, 13 November 2023
Problem
There are 
users on a social network called Mathbook, and some of them are Mathbook-friends. (On Mathbook, friendship is always mutual and permanent.)
Starting now, Mathbook will only allow a new friendship to be formed between two users if they have at least two friends in common. What is the minimum number of friendships that must already exist so that every user could eventually become friends with every other user?
Solution 1
No Solution Yet
See also
| 2022 USAMO (Problems • Resources) | ||
| Preceded by Problem 5 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
