I have developed an interest in generalisations of the fibonacci sequence, from tribonacci sequence up to what I'll coin the 'infinibonacci' sequence.
I'm aware that these nth-bonacci sequences require roots of matched nth-degree polynomials in the form $x^n - (x^{n-1} + x^{n-2} + \dots +x^0)=0$ and that 5th-degree polynomials are not guaranteed to be solvable, but I'm wondering if there is a systematic way of showing whether these particular polynomials are solvable by root extraction?
I am prepared to learn anything required to understand the result but am currently starting from smart 2nd year undergraduate level. Thanks.
You can test its Galois group using this online Magma calculator. For example, to test the solvable but irreducible quintic $x^5-5x+12=0$, use the command,
Copy and paste. One then finds the order is $10$, hence that quintic is solvable. (All groups with order $<60$ is solvable, but there are solvable groups with order $>60$.)
For the pentanacci,
It says it is the symmetric group $S_5$. And for higher $n$-nacci (I tried up to $n=12$), we get $S_n$ which are not solvable for $n\geq5$.
P.S. If you are testing other equations, don't forget the asterisk (*) between the numerical coefficient and the variable, like this: 5*x. (I learned that after a while.)