Thread: Calculate log base e by recursion function.

  1. #1
    Registered User alice's Avatar
    Join Date
    Mar 2004

    Calculate log base e by recursion function.

    I have to calculate the value of e


    I need to use recursion function.
    I can cal. the power of n(n!) but I dont have any idea on how to sum of them.

    Could someone give me hints on this. thk
    double exp(double term){
    int n;
      if (term==0)
         return 1;
      if (term==1)
         return 1;
      else {
         n= term * exp (term-1);
         return  1/n + 1/(exp(n-1));
    int main(){
     float r;
    Last edited by alice; 04-24-2004 at 04:16 AM.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Right Triangle Program
    By BSmith4740 in forum C# Programming
    Replies: 9
    Last Post: 02-27-2008, 12:24 AM
  2. is there a log base 2 function?
    By qubit67 in forum C Programming
    Replies: 3
    Last Post: 05-02-2007, 01:08 AM
  3. We Got _DEBUG Errors
    By Tonto in forum Windows Programming
    Replies: 5
    Last Post: 12-22-2006, 05:45 PM
  4. log function causing an error
    By jbsloan in forum C Programming
    Replies: 2
    Last Post: 06-20-2004, 08:27 PM
  5. Recursion function won't exit
    By cheesehead in forum C++ Programming
    Replies: 20
    Last Post: 10-30-2001, 03:58 PM