The thirteen dwarves sat down around a bonfire in a circle, and their leader Thorin proposed a challenge to pass the time:
Each dwarf would choose an integer so that for every group of three neighboring dwarves, the sum of their numbers must be exactly \(13\).
Could Thorin’s challenge be solved?