You can obtain approximate solutions since, usually $r \ll 1$. For brevity, I shall use $P=PV$ and $F=FV$
$$P=C \,\frac{1-(1+r)^{-n}}{r}+F\,(1+r)^{-n}$$
Expand the rhs as an infinite sum
$$P=\sum_{k=0}^\infty \Bigg[F \binom{-n}{k}-C \binom{-n}{k+1}\Bigg]\,r^n$$ Truncate to some order and use series reversion to obtain
$$r \sim t + a_1\, t^2+a_2\, t^3+O(t^4)\qquad \text{with} \qquad t=\frac{2 (C n+F-P)}{n (C (n+1)+2 F)}$$
$$3 (C (n+1)+2 F)\,a_1=C n^2+3 (C+F)n+(2 C+3 F) $$
$$36 (C (n+1)+2 F)^2\,a_2=5 C^2 n^4+3 C (9 C+10 F)n^3+ \left(53 C^2+108 C F+48 F^2\right)n^2+3 (3 C+4 F) (5 C+6
F)n+\left(14 C^2+36 C F+24 F^2\right) $$
Try it with problems of your choice and, please, let me know how it works for you.
Edit
To make it more legible, consider the function
$$f(r)=C \,\frac{1-(1+r)^{-n}}{r}+F\,(1+r)^{-n}-P$$ We have
$$f(0)=C n+F-P $$ $$ f'(0)=-\frac{1}{2} n (C (n+1)+2 F)$$
$$f''(0)=\frac{1}{3} n (n+1) (C (n+2)+3 F)$$ $$f^{(3)}=-\frac{1}{4} n (n+1) (n+2) (C (n+3)+4 F)$$
$$f^{(4)}(0)=\frac{1}{5} n (n+1) (n+2) (n+3) (C (n+4)+5 F)$$ which show a very simple pattern.
Now, use the first iteration of the method which is one level above Householder's one (that is to say of order $5$) to get the following estimate of $r$
$$\frac{4 f(0) \left(f(0)^2 f^{(3)}(0)+6 f'(0)^3-6 f(0) f'(0) f''(0)\right)}{-24
f'(0)^4+f(0)^2 \left(f(0) f^{(4)}(0)-6 f''(0)^2\right)-8 f(0)^2 f^{(3)}(0) f'(0)+36
f(0) f'(0)^2 f''(0)}$$