We still haven't proven whether every finite list of numbers can always be rearranged into a sequence where every partial sum avoids a specific forbidden value.

open Global / Unspecified, Global WS01309

Combinatorial arrangement problems like this remain surprisingly resistant to full general solutions despite their simple appearance. This connects recreational mathematics with deeper unresolved questions in combinatorics.

mathematics-logic global-unspecified every haven proven whether finite list numbers always rearranged sequence know possible resolved philosophy-ethics mathematical

Category: Mathematics Logic

Added by: The Internet (the_lurker)

Created at: 2026-07-19T16:18:35Z

Click to copy citation

WS01309 | World Solve | https://worldsolve.org/index.php?view=problem&id=1309

Related Problems

We still haven't proven whether it's possible to construct a complete and general theory predicting the exact number of distinct solutions to any well-defined combinatorial puzzle.

WS01355 · Match Score: 30%

We still haven't resolved whether every finite set of straight lines drawn on a plane must always create at least one region shaped like a specific simple polygon.

WS01287 · Match Score: 24%

We haven't proven whether there's a general method for determining the exact number of ways any given shape can be divided into smaller identical pieces.

WS01296 · Match Score: 24%

We haven't determined whether every finite geometric shape can always be perfectly reconstructed from a limited set of simple measurements.

WS01302 · Match Score: 23%

We still haven't proven whether every sufficiently large prime number can be written as the sum of three smaller prime numbers in a predictable, structured way.

WS01272 · Match Score: 23%