Use a recurrence relation to find the number of ways that stamps that have a value of 1 cent , 2 cents and a 3 cents can add up to eight cents.(adsbygoogle = window.adsbygoogle || []).push({});

How exactly do you go about solving a problem like this with out writing a program to find all the possibilities?

The answer given is 81, but I have know Idea how to get it.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Recurrence relation

**Physics Forums | Science Articles, Homework Help, Discussion**