Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1991_06_01_rabinowitz_gilbert: Rabinowitz and Gilbert's recurrence of 1991: for every positive real w, a Graham-Pollak floor recurrence with multipliers a and 2/a whose differences u_{2n+1} - 2u_{2n-1} are the binary digits of w; refereed in Math. Mag.
2005_05_24_stoll: Stoll's theorems of 2005 and 2006: for every positive real w and every base g at least 2, Graham-Pollak floor recurrences whose differences u_{2n+1} - g u_{2n-1} are the base-g digits of w, in infinitely many choices.
Linked from (1)
Graph