KöMaL 2016 B4783
A flea is jumping on the vertices of a square . It starts at vertex , and in each jump he moves to an adjacent vertex with a probability of for each. The flea will stop when it has reached all vertices at least once. For each vertex, determine the probability of its being the last vertex.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.