@cegprakash My method is no different from anurag's.I am not saying to copy
numbers from oeis and use them in lookuo tables(I hate that,that's lame).I
was just saying if one is lazy and dont want to generate the formula,them
refer to the formula given on the webpage.
On Mon, Mar 21, 2011 at 6:18 P
@all : thank :)
On Mon, Mar 21, 2011 at 5:45 PM, cegprakash wrote:
> Anurag's method is better than saurabh's
>
> if u want to find the sum of digits from 1 to 1048
> just apply Anurag's method from 1 to 1039 and saurabh's method from
> 1040 to 1048
>
> --
> You received this message because yo
Anurag's method is better than saurabh's
if u want to find the sum of digits from 1 to 1048
just apply Anurag's method from 1 to 1039 and saurabh's method from
1040 to 1048
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this gro
@dave...plz read the q carefully before answering the q.
nice link anurag...:))
On Sun, Mar 20, 2011 at 11:03 PM, Dave wrote:
> @Akash: The sum of the numbers from 1 to n is S(n) = n*(n+1)/2. Thus,
> the sum of the numbers from a to b is S = S(b) - S(a-1) = ( b*(b+1) -
> a*(a-1) ) / 2.
>
> D
@Akash: The sum of the numbers from 1 to n is S(n) = n*(n+1)/2. Thus,
the sum of the numbers from a to b is S = S(b) - S(a-1) = ( b*(b+1) -
a*(a-1) ) / 2.
Dave
On Mar 20, 9:08 am, Akash Mukherjee wrote:
> Majid is a 3rd-grade elementary student and quite well in mathematics. Once,
> Majid's teac
