I feel a little silly making an appeal like this, but I'm stumped.
I'm trying to solve an equation for a variable. The equation has a bunch of stuff in it that makes it look messy, but they're really just parameters and can be easily subsumed so that the basic form of the equation is:
aX + bX1+c + d = 0, where 0 < c < 1, and the reciprocal of c is not necessarily an integer either.
Mathematica protests to me that it is not up to the task of solving this.
I've poked around and there are a couple work-arounds - usually involving some substitution - for solving a non-integer polynomials but (as far as I can tell - because I'm having trouble applying them to this problem) they all only really seem to work if the non-integer polynomial is less than one and this is definitely more than one.
Anyone know how to solve this (or a program that would be better at it than Mathematica)? If you've got such a program handy, a general solution to the equation above would work fine.
Thanks in advance - if this ever sees the light of day you will certainly be acknowledged, if you like. Something like "My dumb ass made it through a bunch of the math and was kicked over the finish line by X".
I am hoping that this is easy enough that someone will be able to answer but tough enough that I don't have to feel dumb for asking.
Yet Another GitHub Project Page Is Born
2 hours ago