Elo from LessWrong suggested this problem:
I write a sequence of n heads or tails on paper.
I then start flipping a sequence of n coins. If next coin does not match my sequence, I restart a new sequence of n coins.
What is the rule for the relationship between how many coins I need to flip to get the sequence I have pre-committed to and the length of the sequence of?
Discussion there:
http://lesswrong.com/r/discussion/lw/pg3/open_thread_september_25_october_1_2017/dxlt
3,7
1,1
37 and 11 are primes. As 31 and 71.
Can you produce a bigger one than 2×2? 5×5 perhaps, or even larger “prime crossword”? In decimal, binary, hexadecimal or whatever notation.
You might discuss it here:
http://lesswrong.com/r/discussion/lw/pf6/open_thread_september_18_september_24_2017/dxcr
What is the per year probability, that we will see a star-star occultation between two non-orbitinging stars, inside our Galaxy?
Discus!
http://lesswrong.com/r/discussion/lw/peg/open_thread_september_11_september_17_2017/dx11
protokol2020 