Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
A sock drawer has socks of exactly two types: comfortable socks, and non-comfortable socks. When choosing socks, one picks two socks at random (uniformly) from the drawer.
If and , the probability of choosing two comfortable socks is exactly . Assuming the sock drawer is magical and can contain and , we also get the probability of .
Your goal: find such that the probability for two comfortable socks is exactly , and such that this is the minimal solution with having at least 100 digits (minimal with respect to the size of ).
A bonus "*" will be given for finding the minimal D such that there are exactly 16 pairs giving the probability with having less than 100 digits.
November 2022 Solution:
One possible solution is
a =
578531456294544759193960639508933458692135986207286734779245556353330267012496957470063389129282
41502
b =
532012360194801766547790141073187864842946628525748481714720078933587785103495458094301593151732
52600116
For the bonus question we have D = 614.
One possible method of obtaining this solutions is by converting the equation to an
equation of the form .
Such an equation is called **Pell's equation** and there are standard method for
solving it and generating all the solutions.