- Sponsor
-
Notifications
You must be signed in to change notification settings - Fork 570
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
performance of checking if (c/d)^(a/b) is rational #10629
Comments
comment:1
Note the traceback:
so it is factoring. |
comment:7
Replying to @dandrake:
Can someone explain this further? I mean technically, factoring is overkill for this---if the exponent is a rational |
comment:9
Ah ok, it's not so important to decide whether rational or not, but to get the "rational power parts" in order to get a simplified expression of form |
Reviewer: Ralf Stephan, Karl-Dieter Crisman |
comment:10
Hmm, but one could possibly ask for it not to do that simplified form, to just always go straight to the symbolic ring... but in this case I agree that unless William really complains, we can close this. |
... and these start getting INSANELY SLOW. Why?
(This was found by Vladimir V. Bondarenko.)
Component: symbolics
Reviewer: Ralf Stephan, Karl-Dieter Crisman
Issue created by migration from https://trac.sagemath.org/ticket/10629
The text was updated successfully, but these errors were encountered: