You are viewing a single comment's thread. Return to all comments →
Consider a list of all positive integers <= n written in base b.
f(n,d) is the total number of times the digit "d" appears in that list.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #156: Counting Digits
You are viewing a single comment's thread. Return to all comments →
Consider a list of all positive integers <= n written in base b.
f(n,d) is the total number of times the digit "d" appears in that list.