Not logged in.   Log in
From the people behind the Alan Turing Cryptography Competition.
You are reading the website of the 2019 edition of the MathsBombe Competition, which ended on Sunday 28th April at 11:59 pm
Home Register FAQ Rules For Teachers News Leaderboard Forum Archive

Puzzle 8

You select a set \(A=\{A_1,...,A_N\}\) of N different integers from the range 1 to 24. What is the minimum value of N such that for any choice of A there are two disjoint subsets of A with the same sum? Find also all selections A of size N-1 for which the sums of each subset are all different.

You should enter your answer in the form

N{selection 1}{selection 2} etc.

with no spaces, and where the selections are presented with the members in increasing numerical order. For example, if you think that the answer is 3 and your selections are {1,2} and {15,1} and {5,3} then you should enter

3{1,2}{1,15}{3,5}

Your answer:
No answers can currently be submitted as the competition is closed.
MathsBombe Competition 2019 is organised by the The School of Mathematics at the University of Manchester.
© The University of Manchester 2012–2019, All Rights Reserved
Contact us | Privacy notice