@@ -0,0 +1,1776 @@
+/**%0A * Purpose: Have the user enter a number and find %0A * all Prime Factors (if there are any) and display them.%0A */%0Apackage primeFactorization;%0A%0A%0A/**%0A * @author Julian D. Quitian%0A * @date 6/27/2015%0A */%0A%0Aimport java.util.ArrayList;%0Aimport java.util.List;%0Aimport java.util.Scanner;%0A%0Apublic class PrimeFactorization %7B%0A%09/**%0A%09 * @param number for which prime factorization will take place.%0A%09 * @return primeFactors list of prime factors of number.%0A%09 */%0A%09  public static List%3CInteger%3E primeFactorization(int number) %7B%0A%09%09  int n = number;%0A%09%09   List%3CInteger%3E factors = new ArrayList%3CInteger%3E();%0A%09%09   for (int i = 2; i %3C= n / i; i++) %7B%0A%09%09%09   while (n %25 i == 0) %7B%0A%09%09       factors.add(i);%0A%09%09       n /= i;%0A%09%09%09   %7D%0A%09%09    %7D%0A%09%09    if (n %3E 1) %7B%0A%09%09      factors.add(n);%0A%09%09    %7D%0A%09%09    return factors;%0A%09%09  %7D%0A%0A%0A%09/**%0A%09 * @param args%0A%09 */%0A%09public static void main(String%5B%5D args) %7B%0A%09%09%0A%09%09Scanner in = new Scanner(System.in);%0A%09%09int input;%0A%09%09%0A%09%09//Introduction Code%0A%09%09System.out.println(%22Welcome to Prime Factorizer!%22);%0A%09%09%0A%09%09//Used to assure that input is an integer between 0 and 15.%09%09%0A%09%09do%7B%0A%09%09%09System.out.print(%22Please enter the integer to be factorized: %22);%0A%09%09%09while(!in.hasNextInt())%7B%0A%09%09%09%09System.out.print(%22Please enter an integer greater than two. If %22%0A%09%09%09%09%09%09+ %22there is no output for a positive integer, please enter a smaller integer: %22);%0A%09%09%09%09in.next();%0A%09%09%09%7D%0A%09%09%09input=in.nextInt();%0A%09%09%7Dwhile(input %3C= 2);%0A%09%09%0A%09%09List%3CInteger%3E primeFactors = primeFactorization(input);%0A%09%09%0A%09%09System.out.print(input + %22 factorizes into the following numbers: %22);%0A%09%09for(int counter = 0; counter %3C primeFactors.size(); counter++)%0A%09%09%7B%0A%09%09%09if(counter == primeFactors.size() - 1)%0A%09%09%09%09System.out.print(primeFactors.get(counter) + %22.%22);%0A%09%09%09else%0A%09%09%09%09System.out.print(primeFactors.get(counter) + %22, %22);%0A%09%09%7D%0A%09%09in.close();%0A%09%7D%0A%7D%0A

Create PrimeFactorization.java