5. Make shell function which can find the last three prime number lesser than 100. code example
Example: 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);
}
}
}