Calculate log base e by recursion function.

[alice]

I have to calculate the value of e

e=1+1/1!+1/2!+1/3!+1/4!+1/5!+1/6!+1/7!+1/8!........

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

#include<stdio.h>
#include<math.h>

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;

  r=exp(7);
 printf("Result=%f",r);
  getchar();


}