20200628, 11:49  #1 
Jul 2015
2×5 Posts 
IBM July 2020

20200721, 07:48  #2 
Oct 2017
2^{4}·5 Posts 
Does anyone of you know, how the new puzzlemaster reacts to submissions that aren‘t correct? Oded has answered every time very fast  that was a good way to help. But I guess that he wasn‘t obliged to do so.

20200722, 07:33  #3 
Jul 2015
2×5 Posts 
I got an answer after few days that my answer is correct

20200730, 05:33  #4 
Jan 2020
2·5 Posts 
Spinoff
A friend of mine suggested a nice "spinoff" puzzle.
If you solved July 2020 main problem by using three letters or more, and your dictionary includes letters "I", "B", and "M", then how many times does substring "IBM" appear in your solution? Let IBM(n) be the number of occurrences within nth string of your solution. Does this sequence follow some nice pattern? A trivial upper bound is IBM(n) <= LENGTH(n)/3 = FIBONACCI(n)*FIBONACCI(n+1)/3. A slightly sharper bound is given by RARE(n), the minimum among the occurrences of letters "I", "B", and "M". What about your ratio IBM(n) / LENGTH(n)? What about your ratio IBM(n) / RARE(n)? 
20200730, 05:57  #5 
Jan 2020
A_{16} Posts 
As LENGTH(n) grows exponentially, I think that it makes sense to compute the ratios for n up to 10, or their limits as n grows to infinity (only for the brave)
For my currently best solution, IBM / LENGTH > 0.2 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
July 2019  Xyzzy  Puzzles  33  20190808 09:38 
July 2015  Xyzzy  Puzzles  16  20150819 16:13 
July 2014  Xyzzy  Puzzles  6  20141102 19:05 
Happy July 4th  LaurV  Lounge  8  20120706 00:13 