matematicasRec

class Matematicas_recursivo

{

public int Factorial_r(int n)

{

int f = 1;

if (n == 0 || n == 1)

return f;

else

f = n * Factorial_r(n - 1);

return f;

}

public int sumatoria_r(int n1)

{

int s = 1;

if (n1 == 0)

return s;

else

s = n1 + sumatoria_r(n1 - 1);

return s;

}

//static public void Invertir_R(int n)

//{

// if (n >= 10)

// Invertir_R(n / 10);

//}

static public int Fibonacci_R(int n)

{

if (n <= 2)

return 1;

else

return Fibonacci_R(n - 1) + Fibonacci_R(n - 2);

}

}

}