I encountered a quite interesting problem. The question is: How many ways you can make change for an amount N using monets of value A and B, knowing that GCD(A,B)=1.
Any idea how to solve this? It reminds me combinatorial class and generating functions. I would be grateful for any help!