import java.util.Scanner;public class FindPrimes{ public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.println("Please enter a positive integer: "); int inputNumber = input.nextInt(); // Gets user to input integer int primeTester = 2; //has to be>0, 2 is considered the first prime int numberOfFactors; //has to be at least 2 every time int possibleFactor;//1 is always a factor; System.out.println("The prime numbers up to your integer (inclusive) are: "); while (primeTester <= inputNumber) { numberOfFactors = 0; possibleFactor = 1; while (possibleFactor <= primeTester) { if (primeTester % possibleFactor == 0) numberOfFactors++; possibleFactor++; if (numberOfFactors == 2) { System.out.println(primeTester); primeTester++; } } } }}