public class JieCheng { /** * @param args */ // 1/1!+1/2!+1/3!+.... public static float sum(int i) { float result = 1; for (int j = i; i > 1; i--) { result = result * i; } return 1 / result; } public static void main(String[] args) { // TODO Auto-generated method stub int index = 3;
float sum = 0;
for (int i = 1; i <= index; i++) { sum = sum + JieCheng.sum(i); } for (int i = 1; i <= index; i++) { System.out.println(JieCheng.sum(i)); if(i<index){ System.out.println("+"); }
public class JieCheng { /** * @param args */ // 1/1!+1/2!+1/3!+.... public static float sum(int i) { float result = 1; for (int j = i; i > 1; i--) { result = result * i; } return 1 / result; } public static void main(String[] args) { // TODO Auto-generated method stub int index = 3; float sum = 0; for (int i = 1; i <= index; i++) { sum = sum + JieCheng.sum(i); } for (int i = 1; i <= index; i++) { System.out.println(JieCheng.sum(i)); if (i < index) { System.out.println("+"); } } // System.out.println("-------------"); System.out.println("="); System.out.println(sum); System.out.println("-------------"); for (int i = 1; i <= index; i++) { if (i < index) { System.out.print("1/" + i + "! + "); } else { System.out.print("1/" + i + "! = " + sum); } } }}
* @param args
*/
// 1/1!+1/2!+1/3!+.... public static float sum(int i) { float result = 1; for (int j = i; i > 1; i--) {
result = result * i;
} return 1 / result;
} public static void main(String[] args) {
// TODO Auto-generated method stub int index = 3;
float sum = 0;
for (int i = 1; i <= index; i++) {
sum = sum + JieCheng.sum(i);
}
for (int i = 1; i <= index; i++) {
System.out.println(JieCheng.sum(i));
if(i<index){
System.out.println("+");
}
}
//System.out.println("-------------");
System.out.println("=");
System.out.println(sum);
}}
double r=0.0;
for(int i=1;i<=n;i++){
r+=(1.0/(get(i)));
}
return r;
}
private static double get(int i){
double r=1.0;
for(int j=1;j<=i;j++){
r*=j;
}
return r;
}
* @param args
*/
// 1/1!+1/2!+1/3!+.... public static float sum(int i) { float result = 1; for (int j = i; i > 1; i--) {
result = result * i;
} return 1 / result;
} public static void main(String[] args) {
// TODO Auto-generated method stub int index = 3; float sum = 0; for (int i = 1; i <= index; i++) {
sum = sum + JieCheng.sum(i);
}
for (int i = 1; i <= index; i++) {
System.out.println(JieCheng.sum(i));
if (i < index) {
System.out.println("+");
} }
// System.out.println("-------------");
System.out.println("="); System.out.println(sum);
System.out.println("-------------");
for (int i = 1; i <= index; i++) {
if (i < index) {
System.out.print("1/" + i + "! + ");
} else {
System.out.print("1/" + i + "! = " + sum);
}
} }}
假设要求计算到n!的话,主要部分如下
sum=0;x=1;
for(int i=1;i<=n;i++){
x=1*x;
sum=sum+1/x;
}
{
public static void main(String[] args)
{
new Test();
}
public Test()
{
double sum = 0;
for(int i = 1 ; i < 3 ; i++)
{
sum += 1.0/calFactorial(i);
}
System.out.println(sum);
} public double calFactorial(int i)
{
if(i == 1)
{
return 1;
}
else
{
return calFactorial(i - 1) * i;
}
}
}这个是用了递归的算法