Anonymous at Sun, 26 May 2024 21:45:24 UTC No. 16194793

>>16194760
Who said it's unsolvable?

Anonymous at Sun, 26 May 2024 21:50:54 UTC No. 16194800

>>16194793
i did

Anonymous at Sun, 26 May 2024 22:59:50 UTC No. 16194905

It really is unsolved, not unsolvable. It could be unsolvable as far as I know.

Anonymous at Sun, 26 May 2024 23:09:19 UTC No. 16194919

>>16194760
And also useless

Anonymous at Mon, 27 May 2024 01:32:20 UTC No. 16195109

>>16194919
Someone put up a prize for 120 million Japanese Yen (US$765,480) not too bad, better than the pittance one gets for the Fields.

Anonymous at Mon, 27 May 2024 01:36:57 UTC No. 16195115

>>16195109
Isn't this problem notorious for being literally too hard for mathematicians or anyone else to even try to solve? You could probably put a billion dollar prize for it and it would still never be solved.

Anonymous at Mon, 27 May 2024 02:12:43 UTC No. 16195141

>>16194760
Every other even divides odd therefore there is exponential decay due to the over representation of even numbers to odd ones. The halving function happens 2/3rds of the time.

Anonymous at Mon, 27 May 2024 03:09:43 UTC No. 16195198

Easy Solution.
CHAIN LOGIC.

Remember the solution to the CHAIN Box Puzzle?
https://en.m.wikipedia.org/wiki/100_prisoners_problem

The director of a prison offers 100 death row prisoners, who are numbered from 1 to 100, a last chance. A room contains a cupboard with 100 drawers. The director randomly puts one prisoner's number in each closed drawer. The prisoners enter the room, one after another. Each prisoner may open and look into 50 drawers in any order. The drawers are closed again afterwards. If, during this search, every prisoner finds their number in one of the drawers, all prisoners are pardoned. If even one prisoner does not find their number, all prisoners die. Before the first prisoner enters the room, the prisoners may discuss strategy — but may not communicate once the first prisoner enters to look in the drawers. What is the prisoners' best strategy?

Solution
Strategy
edit
Surprisingly, there is a strategy that provides a survival probability of more than 30%. The key to success is that the prisoners do not have to decide beforehand which drawers to open. Each prisoner can use the information gained from the contents of every drawer they already opened to decide which one to open next. Another important observation is that this way the success of one prisoner is not independent of the success of the other prisoners, because they all depend on the way the numbers are distributed.[2]

Essentially, the numbers will automatically create loops chains to other numbers. If Box 16 has the number 23 on the lid, then Box 23 has 2 on the lid and so on, there's only a finite number of loops that can exist before you loop back to Box 16 again.

The Riddle That Seems Impossible Even If You Know The Answer
https://m.youtube.com/watch?v=iSNsgj1OCLA

It's topologically the SAME PROBLEM.
Every multiple of 3 has a chain loop. The variances only consist in loop lengths. Any hitting of a multiple of 3 equals hitting a checkpoint in the individual chain loops.