Comments on XPloring around: Exploring Tail Recursion

I know I'm a little late to the game, but I'd like...

2010-01-04T00:16:31.132+05:30

I know I'm a little late to the game, but I'd like to offer my solution to the mix.

My colleague Ramesh Rajamani came up with this lit...

2009-06-27T13:20:47.524+05:30

My colleague Ramesh Rajamani came up with this little gem of a solution in Erlang.

-module (math2).
-export ([findNum/2]).

findNum(N,1) -> N;
findNum(N,D) ->
if N rem D == D-1 ->
findNum(N,D-1);
true ->
findNum(N+1, 18)
end

I'm not sure why, but the link above did not paste...

2009-05-11T01:16:46.075+05:30

I'm not sure why, but the link above did not paste properly. The final 245245 should just be 245. I'll try pasting it again and hope for the best.

http://erl.nfshost.com/2009/05/10/245/

Sriram, I posted what I think is a slightly more i...

2009-05-11T01:11:46.494+05:30

Sriram, I posted what I think is a slightly more idiomatic erlang solution, along with some comments, on my blog, at http://erl.nfshost.com/2009/05/10/245245/

@ ManojThanks.

2009-01-09T10:27:53.353+05:30

@ Manoj
Thanks.

seems you should have written divisor > 2 in the f...

2009-01-09T03:11:13.704+05:30

seems you should have written divisor > 2 in the for loop instead of divisor < 2