Created
October 5, 2012 18:17
-
-
Save nicolasfig/3841459 to your computer and use it in GitHub Desktop.
java: Calcula el numero euler basado en el factorial
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class Euler { | |
public static long fact(int x) { | |
long prod = 1; | |
for (int i = 1; i < x; i++) { | |
prod = prod * i; | |
} | |
return prod; | |
} | |
public static double euler(){ | |
double e = 0; | |
for (int i = 1; i < 50; i++) { | |
e = e+1 / (double) (fact(i)); | |
} | |
return e; | |
} | |
public static void main(String[] args) { | |
System.out.println("e = "+euler()); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hola.
Creo que el método para calcular el factorial (fact), presenta un error en el número de iteraciones.
Saludos!