1. Stella has 3 quarters and 4 dimes. How many different amounts can she form with these 7 coins, using at least one coin in each amount? The answer is 19, but how do you calculate it w/out having to list all the possibilities? 2. If N is any positive integer, how many consecutive integers following N are needed to insure that at least one of the integers is divisible by another positive integer m? I think the answer is m, but the solution said not to count N, so it would be m-1...don't know why you wouldn't count N.