Provided a recurrence relationship, I converted the equation assuming $T(n) = r(n)$, and found the roots to the quadratic equation.
root 1: $r_1 = 2+\sqrt{3}$
root 2: $r_2 = 2-\sqrt{3}$
Resulting in the equation with the form $T(n) = c_1(r_1)^n + c_2(r_2)^n$
$$T(1): 1 = c_1(2+\sqrt{3})^1 + c_2(2-\sqrt{3})^1$$
$$T(3): 3 = c_1(2+\sqrt{3})^3 + c_2(2-\sqrt{3})^3$$
How do I go about solving for $c_1$ and $c_2$ in this particular instance. I'm used to an initial condition being 0, eliminating one of the $c$'s, then plugging the remaining into the second equation. But I am stuck here.
My end goal is to result with a closed form solution to a recurrence relationship from $T(n)$.