Sort 7 Discussions, By:
Please Login in order to post a comment
Does anyone else find the description highly complicated? I don't understand how the input values relate to the problem...
Indeed, for more clarity, I would rewrite the line 4 into:
... solutions of the equation f(n,1)=n are n= ....
and the line 7 into:
... the sum of all the solutions n for which ...
Look at the Project Euler problem itself. There is at least one typo as described above.
bayleef needs to spend time trying to get his explainations better
could any one explain this
Can anyone tell what the excatly function f(n,d) is ?
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.
I am not able to get problem exactely.
Can any one Around Here Who tell about problem statement clear to me just explain the problem not the solution.