tag:blogger.com,1999:blog-20124361.post7641832710534477919..comments2010-02-05T12:02:10.815-05:00Gurpreet Singh Modihttp://www.blogger.com/profile/16786250333251640920noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-20124361.post-86893368347201120782010-02-05T12:02:10.815-05:002010-02-05T12:02:10.815-05:00Hiii, Gurpreet<br /><br />me and some of my frnds hv started an E-magazine called Reader&#39;s Quotient it is totally for a noble cause, I came across ur blog in my quest to search excellent writers and felt worth inquire if u shall be willing to come along us ?<br /><br />If yes pls contact us on sangeeta.goswami@readersquotient.com<br /><br />regds sangeeta<br />www.readersquotient.comAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-20124361.post-76220155645719284152010-01-02T17:36:51.856-05:002010-01-02T17:36:51.856-05:00Yes, it can be done for factorial numbers too. You will need to multiply all the first number with all the digits of the second number and then add them. This will require 2 for loops, the outer loop will maintain the sum and the inner loop (similar to the current for loop) will compute the multiplications digit by digit.Gurpreethttp://www.blogger.com/profile/16786250333251640920noreply@blogger.comtag:blogger.com,1999:blog-20124361.post-27150535244469926402010-01-02T02:26:21.737-05:002010-01-02T02:26:21.737-05:00That is a cool program to calculate the fibonacci series for large numbers.<br /><br />Was wondering if the same can be done for the factorial of numbers as that series expands exponentially.Kevin Rodrigueshttp://kevinrodrigues.comnoreply@blogger.com