From The Sunday Times, 9th July 1989 [link]
Five families, each consisting of a mother, father, and one child, are near neighbours. The families have a lot in common, and, to give you some idea of the closeness, I will tell you that last Saturday all 15 family members went on an outing to the circus to celebrate young Laura’s 10th birthday.
The day before that, four of the mothers, Jenny, Lorna, Margaret and Norma, had been on a shopping spree together, and two of the fathers, Ken and John, had prepared a barbecue for all the others. Three of the children, Kevin, Marion and Nigel, are learning the piano under the same teacher.
Mike and Neil are the fathers of daughters. Young Jill, who is not Neil’s child, shares a birthday with Leo’s child (who has the same initial as Mike’s wife) and with Kate’s child (who has the same initial as Leo’s wife). The other two children share a birthday on a different date.
If I tell you that no two members of a family have the same first name initials as each other, you should be able to work out the name of John’s wife and who it was that shared Laura’s birthday last week.
There are now 1400 Teaser puzzles available on the site, so it seemed like an appropriate time to post Teaser 1400.
Between S2T2 and Enigmatic Code there are now 4056 puzzles available in total.
[teaser1400]
Jim Randell 1:30 pm on 17 November 2026 Permalink |
See also: Enigma 1712.
The first part can be solved using the program I wrote to solve this type of puzzle using exact multiset covers:
Solution: Using exactly 1 copy of each digit the minimal total is 567.
There are two sets of primes that achieve this total:
For the second part of the puzzle, we already know that the total must be no more than 567, so we can just consider primes up to that value.
For each digit, this Python program collects primes that include that digit (discarding primes where a lower prime can be used to cover the same digits). And then uses this collection to find minimal subsets that cover all the digits.
It runs in 67ms. (Internal runtime is 574µs).
from enigma import (Accumulator, irange, fset, primes, nsplitter, ordered, uniq, printf) # we know there are solutions with a sum of 567 M = 567 # target key digits = irange(0, 9) tgt = fset(digits) # generate candidate numbers (in order) def nums(): seen = set() for n in primes.between(2, M): ds = fset(nsplitter(n)) # skip numbers that can be covered by an earlier number if any(ds.issubset(x) for x in seen): continue seen.add(ds) yield (n, ds) # for each digit collect candidate numbers (in order) d2ns = dict((d, list()) for d in digits) for (n, ds) in nums(): for d in ds: d2ns[d].append((n, ds)) # map digits to number of candidates ncs = dict((k, len(v)) for (k, v) in d2ns.items()) def solve(r, ds, ns=list(), t=0): # are we done? if not ds: r.accumulate_data(t, ns) else: # choose a digit to cover d = min(ds, key=ncs.get) # consider numbers that include that digit for (n, xs) in d2ns[d]: if t + n > r.value: break solve(r, ds.difference(xs), ns + [n], t + n) # solve the puzzle, collecting minimal sets r = Accumulator(fn=min, value=M, collect=1) solve(r, tgt) # output solution if r.count: printf("min sum = {t}", t=r.value) for ns in uniq(ordered(*ns) for ns in r.data): printf("-> {ns}")Solution: Using at least 1 copy of each digit the minimal total is 307.
There are 6 sets of primes that achieve this total:
LikeLike