Fun with Numbers: The Pan-Prime-Digit Cube Hypothesis

[David Hayden]

(08-21-2017 03:39 PM)pier4r Wrote:  Could you share the details?

The code is written in C++. The idea is to build up lists of larger and larger suffixes to possible solutions. The input file is text. The first line is the number N of digits in the OUTPUT. This line is followed by a bunch of lines that contain all possible suffixes of length N-1. It writes to the output a file in the same format, but for one larger suffix size. You can kick start it with the input file:

Quote:1
0

Which generates as its output:

Code:

2
3
5
7
8

This means that any solution must end in 3,5,7, or 8. This file can be used as the input file to 2-digit suffixes. The output of that run can find 3 digit suffixes etc.

If the program finds a solution along the way, it writes it to the standard error output.