## Teaser 2783: Old boys’ banquet

**From The Sunday Times, 24th January 2016** [link]

George and Martha have arranged the seating plan for the annual Old Boys banquet; it involves a number of tables, each seating 50 diners. More than half the Old Boys are bringing one female guest each and the rest are coming alone. Martha wrote down three numbers, namely the number of Old Boys bringing a guest, the number of Old Boys coming alone, and the total number of Old Boys coming. George noted that the three numbers between them used each of the digits 0 to 9 exactly once.

How many Old Boys are bringing a guest, and how many are coming alone?

[teaser2783]

## Jim Randell 8:30 am

on13 September 2019 Permalink |If

sis the number of old boys without guests andgis the number with guests, then we have apandigitalsum of the form:where

s < g.Altogether there are 10 digits used so, alphametically, the sum is one of:

This Python program uses the [[ SubstitutedSum() ]] solver from the

enigma.pylibrary to examine solutions to both sums. It runs in 277ms.Run:[ @repl.it ]Solution:There are four possible solutions:I suspect the setter intended the final solution to be the correct answer, which is the only solution where the pandigital sum is of the form:

ABC + DEF = GHIJ.A suitable upper limit on the total number of old boys, total number of people, or number of tables would eliminate the other solutions.

However if we change the condition in the puzzle text to:

(i.e. we require

s > g).Then there is only a single solution to the puzzle:

Reversing the inequality at line 12 of the program will give this solution.

LikeLike

## GeoffR 1:59 pm

on14 September 2019 Permalink |LikeLike