This document is available online at http://helios.hampshire.edu/jdavila/cs109/hw_2.htm
CS 109: Homework #2: Function decomposition.
Last Updated: September 28, 2000
This homework is due on Tuesday, October 10.
Write a program that asks the user to enter a positive integer, and outputs the number's prime factorization.
Remember, a number is prime if it can only be divided by 1 and itself.
As a manner of guide, I strongly suggest you use functions with the following signatures:
1) bool is_divisible_by(int, int);
2) bool is_prime(int);
3) maybe: int find_next_prime(int), which returns the smallest prime bigger than the number used as input.
Your project should be divided into several different files. At a minimum, you should have one file that contains the main program, one file that contains auxiliary functions, and one header file.