Solve rewriteInverseFunction(IAST plusAST, int position)?
Issue #115
closed
In Solve rewriteInverseFunction(IAST plusAST, int position) why we use isFree for vars?
Comments (5)
-
reporter -
repo owner The isFree() case is at least the easiest case which should be tried first. Do you have some examples for other cases, which should work for you?
-
reporter Yes,i got it after i read more about the code!Sorry to bother you. But i try my best to find a solution for x+log(x+1)=1,i found nothing! Any sugesstion? Thanks !
-
repo owner At least you can try to get a numerical solution with FindRoot http://symjaweb.appspot.com/?ci=ta:Input:t:FindRoot(x%2BLog%20(x%2B1)-1%2C%7Bx%2C-10%2C10%7D)
-
repo owner - changed status to closed
Please use the Github issue tracker to open a new issue if this issue shouldn't be closed Github issues
- Log in to comment
@axelclk