Given that $f(6)=144$ and $f(n+3) = f(n+2) \cdot\Big(f(n+1)+f(n)\Big)$ $[$For $n = 1,2,3,4]$
Then find the value of $f(7)$.
The solution is not unique but all of them are positive integers.
I can't find a way out.
Asked
Active
Viewed 85 times
1
Ivan Neretin
- 12,835
Rezwan Arefin
- 3,106
- 1
- 14
- 39
-
Do you mean $f(n+3) = f(n+2)\times{f(n+1)+f(n)}$? – Mithlesh Upadhyay Jan 22 '16 at 13:43
-
3I doubt that the solution is unique without further informations. – Peter Jan 22 '16 at 13:46
2 Answers
3
Letting $a=f(1)$, $b=f(2)$, $c=f(3)$, $d=f(4)$, $e=f(5)$, $144=f(6)$, and $g=f(7)$ for notational simplicity, we have
$$\begin{align} d&=c(b+a)\\ e&=d(c+b)\\ 144&=e(d+c)\\ g&=144(e+d)\\ \end{align}$$
If I've done the algebra correctly, we can eliminate $d$ and $e$ leaving
$$144=c^2(a+b+1)(a+b)(b+c)$$ and $$g=144c(a+b+1)(a+b)$$
If we assume that $a$, $b$, and $c$ are positive integers, the first equation leaves only a handful of possibilities, such as $(a,b,c)=(7,1,1)$. In particular, since $a+b$ and $a+b+1$ must be consecutive divisors of $144$, $a+b$ can only be $2$, $3$, or $8$.
Barry Cipra
- 79,832
2
$f(5)$ is a large factor of $144$. That gives $f(3)+f(4)$, and $f(4)$ is a large factor of $f(5)$. There aren't too many choices to check.
Empy2
- 50,853