Problem

Bleatrix Trotter the sheep has devised a strategy that helps her fall asleep faster. First, she picks a number N. Then she starts naming N, 2 × N, 3 × N, and so on. Whenever she names a number, she thinks about all of the digits in that number. She keeps track of which digits (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) she has seen at least once so far as part of any number she has named. Once she has seen each of the ten digits at least once, she will fall asleep.

Bleatrix must start with N and must always name (i + 1) × N directly after i × N. For example, suppose that Bleatrix picks N =…

jolf.js:3865 ~p ~pxP"200"x 1
jolf.js:3865 x ~pxP"200"x 2
jolf.js:3865 P ~pxP"200"x 3
jolf.js:3865 " ~pxP"200"x 4
jolf.js:3865 2 ~pxP"200"x 5
jolf.js:3865 0 ~pxP"200"x 6
jolf.js:3865 0 ~pxP"200"x 7
jolf.js:3865 " ~pxP"200"x 8
jolf.js:3865 x ~pxP"200"x 9
jolf.js:3865 undefined "~pxP"200"x" 10
jolf.js:3865 undefined "~pxP"200"x" 10

c*!]*^h9x~P1

parseInt(mul(mathC["]"](mul(pow(head(9),x),(1+Math.sqrt(5))/2)),1));