Cognitive Scaffold

Preparing your thinking workspace

arrow_back_ios_new
MENTAL MODEL · M5205

Necklace Problem

Necklace Problem
TechnicalHigh supportMathematics
Included
account_tree

Version 1.0.0 · Updated 2026-07-28

CORE DEFINITION

Two thieves stole a necklace made of beads of different colors. How can they make two cuts so that each gets the same number of beads of each color? The Borsuk-Ulam theorem proves that this is always possible.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

Perfect division of complex interests. In resource allocation (such as inheritance, equity, territory), even if the composition of interests is extremely complex (multiple colors mixed), there always exists a mathematical solution that achieves fairness with only a few cuts. The key is to find the high-dimensional cutting plane.

anchor

Anchor fast decisions

The Borsuk-Ulam theorem guarantees that for a necklace made of beads of finitely many colors, there always exist two cuts that divide it into two pieces such that each person gets an equal number of beads of each color—complex mixed interests can be fairly divided with appropriate cuts.

MINIMUM ACTION

In progress 0/4

Practice this model in one real situation:

Check to track your progress (stored locally)
Learning progress0%
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more

Source support: Explicit

  • link
    en.wikipedia.orghttps://en.wikipedia.org/wiki/Necklace_problemZH · Explicit
    verified

RELATED MODELS