Project Euler Forum

Posted: **Sun Sep 23, 2018 7:00 am**

Posted: **Mon Sep 24, 2018 3:41 pm**

Yes, you are correct!

Posted: **Thu Sep 27, 2018 10:31 am**

Correct sequence, should looks like:

 
99999=>
1. 9999+9=10008=>
  2. 1+8 => 9

and f(99999,10)=2

Posted: **Thu Sep 27, 2018 10:52 am**

I don't understand where you think the problem is. No one has made any claims about f(10211914,10), and the problem statement does not give any algorithm.

With

Code: Select all

1. 1+0+2+1+1+91+4 = 100 => 
                           2. 1+0+0 = 1

you've shown that f(10211914,10) <= 2. But then where do you get

10211914 -9*floor(10211914/9) = 1

There's no mention of division or multiplication. You can only split the base-B representation of a number into chunks, and add those chunks together.

Project Euler Forum

Problem 637

Problem 637

Re: Problem 637

Re: Problem 637

Re: Problem 637