Re: Re (tilly) 1: Finding sum of all digits from 1 to 1 million.

a good exercise would be to write Perl code that efficiently calculates the sum of all of the digits in a range of integers.

Assuming sum(n) is the sum of all digits from 1 to n, sum_range(m, n) is the sum of all digits from m to n, and m < n, isn't the following true?

sum_range(m,n) = sum(n) - sum(m)
[download]

Or, did I totally get you wrong? /prakash

Comment on Re: Re (tilly) 1: Finding sum of all digits from 1 to 1 million. Select or Download Code

Replies are listed 'Best First'.
Re (tilly) 3: Finding sum of all digits from 1 to 1 million. by tilly (Archbishop) on Jan 24, 2002 at 01:06 UTC
Off by one error again, your formula drops m from the answer. (And the obvious fix will need more cases if your range potentially includes negative integers.) But still, you are essentially correct. After some wrapper logic, the problem really does boil down to being able to efficiently calculate the sum of the digits from 1 to n for any positive integer n.	[reply]


Clear questions and runnable code get the best and fastest answer
	PerlMonks