![]() |
|
|
#12 |
|
Jul 2015
33 Posts |
Hi this is our solution
As can be seen there are some papers on it We reduced this months challenge to the generic coin weighting problem which is defined as the following with k=2: Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the same weight or not using the minimum possible number of weighings in a regular balance beam. This led us to various papers including: "COINS AND CONES" by Dmitry N. Kozlov and Van H. Vu that proves that the limit for 4 weighings is 30 coins. We also found two additional papers with further cooperation of Kozlov with Noga Alon. Apparently their "trivial" examples has proven to be hard to comprehend by many people but further research brought up the following solution for 30 people using groups of 4, 5, 6, 7, 8 people. G4 = ABCD G5 = EFGHI G6 = JKLMNO G7 = PQRSTUV G8 = WXYZ0123 Contests: ABCD EFGHI JKLMNO ; PQRSTUV WXYZ0123 ABCD PQRSTUV ; EFGHI JKLMNO JKLMNO PQRSTUV ; EFGHI WXYZ0123 ABCD WXYZ0123 ; EFGHI PQRSTUV |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| December 2017 | Batalov | Puzzles | 4 | 2018-01-04 04:33 |
| December 2015 | Xyzzy | Puzzles | 15 | 2016-01-06 10:23 |
| December 2014 | Xyzzy | Puzzles | 13 | 2015-01-02 19:41 |
| Conference in Amsterdam 1-2 December | fivemack | Information & Answers | 6 | 2011-12-12 13:13 |
| Server update in December | ltd | Prime Sierpinski Project | 4 | 2010-12-17 13:14 |