Vrijeme: 08:29
RAM, vidiš | RAM, look #1
Među
ljudi svake dvije osobe se ili poznaju ili ne poznaju. Poznanstva su uzajamna.
Koliko iznosi najmanja vrijednost od
tako da je neovisno o rasporedu poznanstava uvijek moguće naći skup od tri osobe koje se sve međusobno poznaju ili sve međusobno ne poznaju?
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
Koliko iznosi najmanja vrijednost od
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
Let there be
people. Every two people either know each other or they don't. Note: if person A knows person B, then person B also knows person A.
What is the minimum value of
so that one can always (regardless of who knows whom) find a group of three people who all either know each other or they all don't?
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
What is the minimum value of
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)