The New Sudoku Players' Forum

[Mathimagics]

This is a standard Kakuro puzzle with a twist - the words must all be prime numbers.

That is, if the word size is 3 then "283" is allowed but not "285".

First a gentle introduction (for Bill Smythe )

KT0909_T004.jpg (33.84 KiB) Viewed 1526 times

Getting started:

• primes can only end in 1,3,7,9. So domains for last cells in any word are immediately restricted.

• this applies to all cells on the right and bottom edges

Solution

Hidden Text: Show

541x251
283x643
73x2417
12347xx
4513x71
31x1367
xxx7193

[Mathimagics]

Somewhat harder:

KT1111_P002.jpg (44.52 KiB) Viewed 1525 times

Solution:

Hidden Text: Show

4831x41xx
89127653x
13x391847
32941x971
x6475321x
241x46351
357421x29
x12938467
xx31x7193

[Mathimagics]

Challenger level: this almost certainly requires computer assistance.

You need:

• a table of compatible primes (ie. with distinct digits), or just a function to list the primes with a given set of digit value

• a function that can test for compatible primes with mask capability, eg ListPrimes("xx36x1")

Purists will object to this, but I had fun both setting up the masked search function itself, and then actually solving this puzzle, which still took over an hour.

P001.jpg (50.92 KiB) Viewed 1525 times

Solution:

Hidden Text: Show

4253x31xx
86352491x
13x257861
35281x643
x9714823x
241x86351
374291x79
x16539427
xx31x7193

[Mathimagics]

A table of compatible prime counts:

• word size 2: 20

• word size 3: 83

• word size 4: 395

• word size 5: 1610

• word size 6: 5045

• word size 7: 12850

• word size 8: 23082