Ponder This Challenge - March 2026 - Path game on a hole-riddled chessboard
- Ponder This
The decimal notation string of the number can be split in various ways: To and , to and , to , and , and to . For each way to split the number, we add up the obtained parts. For and , we obtain the number ; for and , we obtain the number ; for , , we obtain ; and for , we obtain itself. We denote this by:
For a general natural number , we define similarly as the set of all natural numbers that can be obtained by splitting and adding the decimal notation of . For example:
Given a set of integers and an integer we use the standard notation . (where · is the usual multiplication of numbers).
Your goal: Find the sum of all the natural numbers such that there exists for which and .
A bonus "*" will be given for finding the sum of all the natural numbers such that there exists for which and .
The numerical solutions are
160808197419276
26190672886645170
The solutions can be found by brute-force over all values of in the range, but there are nice optimizations to be found. Here is a simple an effective one suggestd by Todd Will:
First, note that since , the sum of digits (and groups of consecutive digits) of is equivalent modulo 10 to itself. Hence, if we have .
Similarily, implies , so we obtain meaning or , cutting down the search space.