학과 세미나 및 콜로퀴엄
엄기윤 (KAIST)미분기하 세미나
On partition functions of determinantal point processes on polarized Kähler manifolds
Naing Zaw Lu (KAIST)기타
Introduction to Homotopical Algebra through Model Categories I
문하은 (서울대학교 통계학과)콜로퀴엄
A framework to infer de novo exonic variants when parental genotypes are missing enhances association studies of autism
우태윤 (KAIST)기타
Grothendieck groups of regular schemes 2
Taehee Kim (Konkuk University)위상수학 세미나
The 4-genus of knots
대학원생 세미나
SAARC 세미나
편미분방정식 통합연구실 세미나
IBS-KAIST 세미나
학술회의 및 워크샵
학생 뉴스
북마크
Research Highlights
게시판
동문 뉴스
Problem of the week
There are \(n+1\) hats, each labeled with a number from \(1\) to \(n+1\), and \(n\) people. Each person is randomly assigned exactly one hat, and each hat is assigned to at most one person (i.e., the assignment is injective). A person can see all other assigned hats but cannot see their own hat and the unassigned hat. Each person must independently guess the number on their own hat.
If everyone correctly guesses their own hat's number, they win; otherwise, they lose. They may discuss a strategy before the hats are assigned, but no communication is allowed afterward.
Determine a strategy that maximizes their probability of winning.