Department Seminars and Colloquium
엄기윤 (KAIST)Differential Geometry
On partition functions of determinantal point processes on polarized Kähler manifolds
Naing Zaw Lu (KAIST)Etc.
Introduction to Homotopical Algebra through Model Categories I
Haeun Moon (Seoul National University (Department of Statistic)Colloquium
A framework to infer de novo exonic variants when parental genotypes are missing enhances association studies of autism
Taeyoon Woo (KAIST)Etc.
Grothendieck groups of regular schemes 2
Taehee Kim (Konkuk University)Topology Seminar
The 4-genus of knots
Graduate Seminars
SAARC Seminars
PDE Seminars
Ioan Bejenaru (UC San Diego)Partial Differential Equations
Global well-posedness and scattering for the massive Dirac-Klein-Gordon system in two dimensions.
은남현 (KAIST)Partial Differential Equations
Existence and uniqueness of global strong solutions for one-dimensional compressible navier-stokes equations
IBS-KAIST Seminars
Conferences and Workshops
Student News
Bookmarks
Research Highlights
Bulletin Boards
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.
KAIST Compass Biannual Research Webzine
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.