Example/Example/src/Chapter2_Self_Test2.java at master · ResilientSpring/Example · GitHub

20 lines (11 loc) · 336 Bytes

// Write a program that finds all of the prime numbers between 2 and 100. 
public class Chapter2_Self_Test2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int[] primeNumbers;
		
		// Integers to be checked if it is a prime number.
		int i;
		
		for (i = 0; i <= 100 ; i++) {
		
		}

	}

}