Coin Problem

Suppose you have an unlimited supply of $a$-dollar bills and $b$-dollar bills, where $\gcd(a,b)=1$. Find the largest integer amount of money that cannot be paid exactly using these two denominations. Compute it for $a=5$ and $b=7$.