q. A total of thirteen pennies is put into three piles so
that each pile has a different number of pennies.
Obviously, this can be done in several ways. Here’s the
challenge – what is the fewest possible number of
pennies in the largest pile of any of the possible
combinations?