I require solutions to equations of the following form: $x^{q}-x-c = 0$ where $q$ is a rational number very close to 1 with $q$ such that: $$q=\frac{p^k+1}{p^k}$$ $$q=\frac{p^k}{p^k-1}$$ $p$ prime, $c$ the log of an integer. I'm hoping to be using a workstation computer to solve several of these equations to a high degree of precision and output some results to file.
Mostly I simply want the high precision solutions, up to 15 significant digits to the right of mantissa if possible. However further understanding about methods and the 'nature and properties' of the solutions is appreciated. For example, in this post: Solving an equation with irrational exponents I believe the author of the accepted answer suggests that if the exponent is rational then it is an algebraic problem with an algebraic solution. If so how can I generally solve these equations algebraically? Other posts have mentioned Lagrange Inversion and Fox-Wright Psi function for 'integral' exponents with the possibility of extrapolating to real values due to continuity. See the 2nd comment in this post: Solving $a\ln\ln(x)=\ln\ln(bx)$ in terms of Lambert W function but my exponent is rational and very close to 1, so I'm not sure that would be the best approach here. I know that use of the word 'integral' may sometimes allow quotients as well - depending on circumstances.
If there's an algebraic solution, I may just implement that in the program. Otherwise which iterative or computational method might work best for this type of equation, as the problem requires confidence in the precision of the results.
edit: I realize this probably should've been two different questions. One concerning numerical methods and the other concerning properties of the solutions. I've since acquired an introductory textbook on algebraic number theory to help understand the solutions better.