2023-01-10 10:07:33 +0200 | commented question | Solve inequation composed of FractionFieldElement This equation cannot be presented as a polynomial: sage: f = x^2/(x+1) >= 0 sage: expand(f) x^2/(x + 1) >= 0 sage |
2023-01-10 10:07:15 +0200 | commented question | Solve inequation composed of FractionFieldElement This equation cannot be presented as a polynomial: sage: f = x^2/(x+1) >= 0 sage: expand(f) x^2/(x + 1) >= 0 sage |
2023-01-08 19:31:19 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 19:31:12 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 19:30:36 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 19:30:20 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 17:09:40 +0200 | commented answer | How to speed up this code I've done everything I could, please use the code which works best for you. |
2023-01-08 17:08:50 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 17:07:53 +0200 | commented answer | How to speed up this code I've done everything I could for you, please use the code which works best for you. |
2023-01-08 16:13:21 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 16:07:06 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 16:06:55 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 16:06:10 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 15:57:50 +0200 | commented question | Solve inequation composed of FractionFieldElement The polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = RF[] result = sol |
2023-01-08 15:55:50 +0200 | commented question | Solve inequation composed of FractionFieldElement How you defined the polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = R |
2023-01-08 15:54:28 +0200 | commented question | Solve inequation composed of FractionFieldElement How you defined the polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = R |
2023-01-08 15:54:04 +0200 | commented question | Solve inequation composed of FractionFieldElement How you defined the polynomial ring is the problem, without it, it runs perfectly: RF = RealField(300) #P.<x> = R |
2023-01-06 23:06:56 +0200 | received badge | ● Nice Answer (source) |
2023-01-05 19:36:32 +0200 | commented answer | How to speed up this code Alright, I couldn't contain myself and had one last idea, using Sage's very own 'parallel' module, please check it out, |
2023-01-05 19:32:19 +0200 | commented answer | How to speed up this code Alright, I couldn't contain myself and had one last idea, using Sage's very own 'parallel' module, please check it out, |
2023-01-05 19:31:56 +0200 | commented answer | How to speed up this code Alright, I couldn't contain myself and had one last idea, using Sage's very own 'parallel' module, please check it out. |
2023-01-05 19:30:41 +0200 | edited answer | How to speed up this code I couldn't run your original code as-is, I had to make some modifications to it. After that I've made some more (mostly |
2023-01-05 17:27:29 +0200 | commented answer | How to speed up this code Yup, I noted that, but as it seems, I can't make this code faster and still work reliably. These two codes are my best o |
2023-01-05 16:36:12 +0200 | commented answer | How to speed up this code Yup, I noted that, but as it seems, I can't make this code to be faster and still work reliably. These two codes are my |
2023-01-05 16:22:58 +0200 | commented answer | How to speed up this code The previously mentioned code is now the second code in my answer. I think this is the end of the road for me; also, I w |
2023-01-05 16:18:41 +0200 | received badge | ● Commentator |
2023-01-05 16:18:41 +0200 | commented answer | How to speed up this code The previously mentioned code is now the second code in my answer. |
2023-01-05 16:17:37 +0200 | commented answer | How to speed up this code I don't know. At some point I've introduced an ifninite loop but couldn't find to so I took a step back and went back to |
2023-01-05 16:14:42 +0200 | edited answer | How to speed up this code I couldn't run your original code as-is, I had to make some modifications to it. After that I've made some more (mostly |
2023-01-05 14:26:03 +0200 | commented answer | How to speed up this code Thanks, I didn't notice. However, I can't seem to run the input you gave me (an example run before the problem): user@h |
2023-01-05 14:02:23 +0200 | commented answer | How to speed up this code No, what I meant is the actual code (that's what I wrote :)), what you changed in the script. The original, what I'm usi |
2023-01-05 13:59:31 +0200 | commented answer | How to speed up this code No, what I meant is the actual code (that's what I wrote, too :)), what you changed in the script. The original, what I' |
2023-01-05 12:37:34 +0200 | commented answer | How to speed up this code I just ran my latest code (with the original data in your very first script, you can see I never changed it), please see |
2023-01-05 12:18:24 +0200 | commented answer | How to speed up this code I just ran my latest code (with the original data in your very first script), please see that I experience no issues: u |
2023-01-05 12:17:27 +0200 | commented answer | How to speed up this code I just ran my latest code (with the original data in your very first script), please see that I experience no issues: u |
2023-01-05 12:14:25 +0200 | commented answer | How to speed up this code I just ran my latest code (with the original data in your very first script), please see that I experience no issues: u |
2023-01-05 09:59:20 +0200 | commented answer | How to speed up this code Are you quite sure you ran the new code? I ran it with test numbers and received no errors whatsoever. However, I've ad |
2023-01-05 09:58:56 +0200 | edited answer | How to speed up this code I couldn't run your original code as-is, I had to make some modifications to it. After that I've made some more (mostly |
2023-01-05 09:58:11 +0200 | commented answer | How to speed up this code Are you quite sure you ran the new code? I ran it with test numbers and received no errors whatsoever. However, I've ad |
2023-01-04 23:35:35 +0200 | commented answer | Finding subset of lists with common entries I've edited the code, please try that (I'm not at a computer at the moment so I couldn't try, I just hope it does work a |
2023-01-04 22:14:55 +0200 | commented answer | How to speed up this code Sorry about that, the 'a' and 'b' variables were defined out of scope, now I've edited the code again (also could ran th |
2023-01-04 22:13:07 +0200 | commented answer | How to speed up this code Sorry about that, the 'a' and 'b' variables were defined out of scope, now I've edited the code again (also ran, it did |
2023-01-04 22:11:27 +0200 | edited answer | How to speed up this code I couldn't run your original code as-is, I had to make some modifications to it. After that I've made some more (mostly |
2023-01-04 22:03:02 +0200 | commented answer | Finding subset of lists with common entries I've edited the code, please try that (I'm not at a computer so I couldn't try, I just hope it does work as you expected |
2023-01-04 22:02:43 +0200 | commented answer | Finding subset of lists with common entries I've edited the code, please try that (I'm not at a computer so I couldn't try, I just hope it does work as you expected |
2023-01-04 21:59:43 +0200 | commented answer | Finding subset of lists with common entries I've edited the code, please try that (I'm not at a computer so I couln't try, I just hope it does work as you expected) |
2023-01-04 21:59:01 +0200 | edited answer | Finding subset of lists with common entries Give this one a try: def find_common_lists(lists): common_lists = [] for i in range(len(lists)): for j |
2023-01-04 20:04:49 +0200 | answered a question | Finding subset of lists with common entries Give this one a try: def find_common_lists(lists): common_lists = [] for i in range(len(lists)): for j |
2023-01-03 19:01:38 +0200 | commented answer | How to speed up this code There was indeed a typo in the beginning of the code. The itertools module was indeed missing, sorry about them (I'm wor |
2023-01-03 18:04:58 +0200 | commented answer | How to speed up this code There was indeed a typo in the beginning of the code, sorry about that. The itertools module was indeed missing, sorry a |