tl;dr
But I saw this:
Time to put humans before business.
Time to put humans before oxygen, too? Silly stuff.
Thomas
Karma: 779
The bottom and the rightmost prime can both have only odd digits without 5. The probability for each prime to fit there is then only (2/5)^N times that. We can’t see them as independent random numbers.
Very well. What do you think, are there arbitrary large squares possible or not?
I think not. Even in binary notations NxN and above, probably don’t exist for an N, large enough.
Congratulation! It’s essential that you don’t tell the algorithm, at least for now. You have an extra solution, where every horizontal has its equal vertical. Which is perfectly okay, but I wonder if that is the property of your algorithm?
A problem to ponder this week.
Open thread, September 18 - September 24, 2017
My country isn’t from the list of the default choices. So I type it and pressed Enter. It’s all I remember.
Previous session is set to be finished.
Your browser reports that it was used previously to answer this survey. We are resetting the session so that you can start from the beginning.
Click here to start the survey.
I have just pressed Enter after my country’s name. Fix this!
There is a mountain on the Moon’s south pole, where the Sun is always shining. Except when it’s covered by Earth, which is rare and not for a long time. A great place for a palace of the Solar System’s Emperor.
Can’t use the Moon. It’s already booked and reserved for a computronium.
We have a problem.
Open thread, September 11 - September 17, 2017
Kepler’s law isn’t O=constant*A. This is very wrong, silly even.
No problem this week, just an appreciation for people of LessWrong who can be right, when I am wrong.
Open thread, September 4 - September 10, 2017
Say, that SB has only 10 tries to escape.
The DM (Dungeon Master) tosses his 10 coins and SB tosses her 20 coins, even before the game begins.
There are 2^30, which is about a billion possible outputs. More than half of them grants her freedom.
We compute her exit by—At the earliest x>y condition in each output bit string, the DM has also the freeing coin toss.
1._round_________________1____________________8______0.125
2._round________________15___________________64______0.234
3._round_______________164__________________512______0.32
4._round_____________1,585________________4,096______0.387
5._round____________14,392_______________32,768______0.439
6._round___________126,070______________262,144______0.481
7._round_________1,079,808____________2,097,152______0.515
8._round_________9,111,813___________16,777,216______0.543
9._round________76,095,176__________134,217,728______0.567
Your basic idea is right here. But … this product isn’t that straightforward.
Say it’s the 100th session. It is a lot of ways, that x becomes greater than y exactly this time. Especially if the formula is x>y+sqr(y) or something alike from the Chebyshev’s arsenal.
If the session is then 101st, this new small probability isn’t much smaller than it was in the 100th session.
Still, you may be right that the product (1-p_n)*(1-p_n+1) … converges to 1⁄2 at the most.
Well, I doubt it.
Well, I said something in line with “people may need some stuff to live and declaring that we should “put people before that stuff” is a silly way to present the situation”. Maybe not as silly as it’s a demagoguery.
But then I changed my mind and decided to not participate in a discussion at all. But somehow couldn’t erase this now empty box.