- #1
pi_kid
- 1
- 0
I'm having some trouble with a particular question brought up in class. It says given F(n)= to the total # of integer solutions what is the smallest n such that F(n)=24. I know how to find F(n) given n, but i can't figure out how to work backwards. Any hints would help.