java实现判断一个数是否为素数

package com.chuandewang;import java.util.Scanner;public class Prime_number_count {public static void prime_count(int start, int end) {int count = 0;int sum = 0;for (int i = start; i <= end; i++) {boolean flag = false;for (int j = 2; j <= Math.sqrt(i); j++) {if (i % j == 0) {flag = true;break;}}if (flag == false) {count++;System.out.println("第 " + count + " 个素数为" + i);if (i % 10 == 1) {sum += i;}}}System.out.print("所有素数的和：" + sum);}public static void main(String[] args) {Scanner in = new Scanner(System.in);int m, n;System.out.print("请输入两个整数，第二个数比第一个数大 ：");m = in.nextInt();n = in.nextInt();prime_count(m, n);}}