This is a simple Python script to address a problem I learned whilst taking discrete mathematics at MSU. The problem is simple: given 'n' dollars how many ways can you form that amount given only quarters, dimes, nickels, and pennies? The brute force script acomplishes this using brute force obviously. The divide and conquer algorithm solves the problem using a more mathematical approach working from the top down and is around 200 orders of magnitude more efficient than the brute force script. I plan to prove these numbers using pyPlots in the future.