Challenge: The Coin Change Problem

Problem statement

Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), write some code to calculate the number of ways to represent $n$ ...