All right, so here's my take on Encsé's infamous 9 Digit Problem. Let's first recap what the problem statement was:Find a number consisting of 9 digits in which each of the digits from 1 to 9 appears only once. This number must also satisfy these divisibility requirements: The number should be…
Utolsó kommentek