|
 |
On 23-9-2009 21:02, Warp wrote:
> andrel <a_l### [at] hotmail com> wrote:
>>>> 8 is less than 24
>>> So? How does that answer the question?
>
>> that is obvious, I would think.
>
> Care to explain? It's not obvious to me.
See Tim Cook.
>> Ok I read that wrong. Can you give an algorithm for 'and so on'?
>
> "I said it's <n> of <n*2-1>" with consecutive values of n.
where? This formula does not match your problem for n=1.
Strange bully to incrementally decrease his changes.
Or am I still not getting it?
>> No it has 2 both 10 and 5 have a factor of 5. So if you want your
>> algorithm:
>> sum_k floor(x/(5^k)) over all k from 1 till 5^k<=x
>
> But I want a closed-form function, not a recursive function or summation.
>
you said you didn't want a recursive function. You never said anything
about summations.
I am afraid we enter into a semantic discussion here, where I might take
another POV than you about what is a closed-form. I'll for the moment
assume that you had stated it as you have now modified it and think again.
Post a reply to this message
|
|
