/* 

This program asks the user for a number and computes all the divisors
greater than 1 of that number. Moreover, for each divisor, it computes
how many times it divides that number.  Thus, the program computes
what is called a factorization of the number.

If the number has no other divisor than itself, it displays a message to 
the user that the number is prime.

For example, if the user enters number 72, the program displays:

72 = 2^3 * 3^2
Goodbye. 

For example, if the user enters number 17, the program displays 

17 = 17
17 is prime. 
Goodbye. 



Laura Toma
csci107
*/


public class Divisors {

	static ReadStream r = new ReadStream();	


	public static void main (String args[]) {
		
		//describe the program to the user
		describeProgram(); 

		//get a number from the user
		int x; 
		x = getNumber();

		//compute and print a factorization of x
		factor(x);

	} //end of main


	static void describeProgram () {


		
	}

	/* ask the user for a number and return it */
	static int getNumber() {



	}

	/* Compute a factorization of a. That is, find all divisors
	 * (greater than 1) of number a. For each divisor, find its
	 * multiplicity.  If the number has no divisors other itself,
	 * print that the number is prime. */
	static void factor(int a) {



	}

}//end of class