20220502, 15:31  #1 
"Max"
Jun 2016
Toronto
2^{5}×29 Posts 
May 2022

20220502, 15:37  #2 
"Max"
Jun 2016
Toronto
1110100000_{2} Posts 
It seems that the May challenge is too easy.
Python produces the first solution for the regular challenge in under a second, and the the first bonus "*" solution in under 3 minutes on one core. 
20220502, 16:58  #3  
Jan 2017
149 Posts 
Quote:
By the way, the way to present the problem feels slightly weird to me  the introduction about how every size 2n set contains a size n subset with sum divisible by n doesn't seem to have all that much to do with actual problem. The added constraint removes most of the similarity, as there generally isn't a solution any more for arbitrary lists (consider a list starting with a pair of ones and the rest zeros). 

20220502, 17:12  #4 
Jun 2012
Boulder, CO
409 Posts 
Also feels too simple... my dumb (recursive) Python program is about 15 lines and produces a solution for the first part in a few milliseconds, the second one in 3 seconds.

20220505, 15:35  #5  
"Max"
Jun 2016
Toronto
2^{5}×29 Posts 
Quote:
A 300 loop usually guarantees a solution for both (regular and bonus *) challenges. 

20220506, 19:37  #6 
Sep 2017
7·19 Posts 

20220511, 14:07  #7 
"Max"
Jun 2016
Toronto
2^{5}·29 Posts 

20220511, 14:09  #8 
"Max"
Jun 2016
Toronto
2^{5}×29 Posts 
The first names are posted, seven of my students among them: https://research.ibm.com/haifa/ponde...s/May2022.html.

20220512, 06:25  #9  
Jul 2015
3·11 Posts 
Quote:
Last fiddled with by tgan on 20220512 at 06:26 

20220512, 07:03  #10  
Sep 2017
7×19 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
April 2022  Xyzzy  Puzzles  7  20220604 19:54 
February 2022  tgan  Puzzles  21  20220323 21:59 
March 2022  Xyzzy  Puzzles  7  20220321 10:45 
January 2022  Xyzzy  Puzzles  25  20220214 01:08 