package blog; public class math { public static void main(String[] args) { //1.整数n的阶乘 int n =5; int result = factorial(n); System.out.println(n+"的阶乘为:"+result); //2.大于x的最小的质数 int x = 200; Prime(x); } static int factorial(int n) { int c = 1; for(int i=1;i<=n;i++) { c *= i; } return c; } static void Prime(int n) { for(int i=n+1;;i++) { boolean l = true; for(int k=2;k<i;k++) { if(i % k == 0) { l = false; break; } } if(l) { System.out.println("大于"+n+"的最小质数为:"+i); break; } } } }
原文:https://www.cnblogs.com/wangsihui/p/11877621.html