rpinting primes code example
Example 1: Write a program that prints all prime numbers less than 1,000,000
public class Main {
public static void main(String[] args) {
for (int i = 2; i < 1_000_000; ++i) {
boolean isPrime = true;
int sqrt = (int)Math.ceil(Math.sqrt(i));
for (int divisor = 2; divisor <= sqrt; ++divisor) {
if (i % divisor == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
System.out.println(i);
}
}
}
}
Example 2: generate all prime number less than n java
import java.util.*;
public class Primecounter {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int num =0;
String primeNumbers = "";
boolean isPrime = true;
System.out.print("Enter the value of n: ");
System.out.println();
int n = scanner.nextInt();
for (int i = 2; i < n; i++) {
isPrime = true;
for (int j = 2; j <= i/2; j++) {
if (i%j == 0) {
isPrime = false;
}
}
if (isPrime)
System.out.print(" " + i);
}
}
}