2024-04-25 01:55:36 +0200 | commented question | Is there a function in SageMath that gives the actual size of a variable not of a pointer to the variable? I used "getsizeof" function but the size it showed is very small comparing to the long of the equation is. Please provide an actual code illustrating the question. |
2024-04-23 23:32:46 +0200 | commented question | Is there a SageMath version of Mathematica's '//' shorthand? Let's wait clarification from OP. I read the question differently, and I do not understand why f(x^2 + x^3 - 31) is not |
2024-04-23 12:59:36 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 This suggests that it may be already challenging to get those graphs for order 11, while order 12 may be out of reach si |
2024-04-22 22:11:18 +0200 | commented question | Finding sup[er]groups of a group Just extend the set of generators with more and more elements to get larger groups. |
2024-04-22 21:53:55 +0200 | edited question | Finding minimum sub-algebra that contains a set Finding minimum sub-algebra that contains a set Hello, I'm trying to understand step 3 in the algorithm 1 provided in th |
2024-04-22 15:32:52 +0200 | commented question | Is there a SageMath version of Mathematica's '//' shorthand? Please provide a complete code example, including the definition of f. |
2024-04-21 18:40:57 +0200 | received badge | ● Nice Answer (source) |
2024-04-21 15:34:09 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 Did you get counts for graphs of order 10 or 11? |
2024-04-21 02:28:57 +0200 | commented answer | Underdertermined system of equations Errors may differ across the equations. x[-1] bounds their absolute values from above. |
2024-04-21 02:28:16 +0200 | commented answer | Underdertermined system of equations Errors may differ across the equations. x[-1] bounds them all. |
2024-04-21 02:27:57 +0200 | commented answer | Underdertermined system of equations Errors may differ across the equations. x]-1] bounds them all. |
2024-04-20 18:24:32 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 It can: $\{$ - use \\{ |
2024-04-20 18:24:26 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 It can: $\{$ - use \\\\{ |
2024-04-20 18:23:57 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 It can: $\{$ - use \\{ |
2024-04-20 18:23:47 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 It can: $\{$ - use \{ |
2024-04-20 18:23:24 +0200 | commented question | Generate all connected graphs of order 12 with matching number of 4 It can: $\{$ - just double \ |
2024-04-20 00:50:00 +0200 | answered a question | Underdertermined system of equations Here is an example, in which we use x[0], x[1], x[2] for a, b, c, and x[-1] for the (absolute) bound for errors. milp = |
2024-04-19 18:58:37 +0200 | received badge | ● Good Answer (source) |
2024-04-17 11:33:52 +0200 | received badge | ● Nice Answer (source) |
2024-04-17 02:43:22 +0200 | answered a question | integrate constantly asks for "zero or nonzero" assume(z1!=0) will do the job. |
2024-04-16 22:47:46 +0200 | edited answer | Thue-Mahler equation One can rely on the Thue equation solver present in PARI. Here is a sample code for solving the equation $f(x,y)=n$: de |
2024-04-16 22:40:32 +0200 | edited question | Underdertermined system of equations Undertermined system of equations Let's say we have 2 equations and 3 variables (N equations and M variables, where M &g |
2024-04-16 22:34:36 +0200 | edited answer | Thue-Mahler equation One can rely on the Thue equation solver present in PARI. Here is a sample code for solving the equation $f(x,y)=n$: de |
2024-04-16 13:13:26 +0200 | commented question | Underdertermined system of equations That's fine. MILP supports non-integer variables as well. |
2024-04-16 12:44:25 +0200 | commented question | Underdertermined system of equations This kind of problems can be solved with MILP - see details and examples at https://doc.sagemath.org/html/en/thematic_tu |
2024-04-15 15:07:05 +0200 | edited answer | How to stop code after a given time Here is a working example using function signal.alarm(): import time from signal import alarm def foo(i): sleep([1 |
2024-04-14 18:26:47 +0200 | answered a question | How to stop code after a given time Here is a working example using function signal.alarm(): import time from signal import alarm def foo(i): sleep([1 |
2024-04-14 00:00:07 +0200 | edited answer | How set and especially clear bits? If I guessed the meaning of your "n.set_bit(7)" correctly, then it can be achieved via Python's bitwise operator | as n |
2024-04-13 23:57:39 +0200 | commented answer | How set and especially clear bits? Or just ~(1r << n) (corrected). |
2024-04-13 23:57:18 +0200 | commented answer | How set and especially clear bits? Yes, this is what I meant, just forgot to remove int. |
2024-04-13 22:10:40 +0200 | commented answer | How set and especially clear bits? Or just ~int(1r << n). |
2024-04-13 19:34:49 +0200 | edited answer | How set and especially clear bits? If I guessed the meaning of your "n.set_bit(7)" correctly, then it can be achieved via Python's bitwise operator | as n |
2024-04-13 19:33:43 +0200 | edited answer | How set and especially clear bits? If I guessed the meaning of your "n.set_bit(7)" correctly, then it can be achieved via Python's bitwise operator | as n |
2024-04-13 19:33:10 +0200 | edited answer | How set and especially clear bits? If I guessed the meaning of your "n.set_bit(7)" correctly, then it can be achieved via Python's bitwise operator | as n |
2024-04-13 19:32:55 +0200 | edited answer | How set and especially clear bits? If I guessed the meaning of your "n.set_bit(7)" correctly, then it can be achieved via Python's bitwise operator | as |
2024-04-13 19:30:22 +0200 | answered a question | How set and especially clear bits? Test test test |
2024-04-11 20:29:17 +0200 | commented question | How to stop code after a given time As for alarm, it needs to be reset after each use by calling alarm() without arguments alarm(0), which will make it avai |
2024-04-11 18:14:18 +0200 | commented question | How to stop code after a given time My bad. I meant calling alarm(0), that is, with the zero argument, to reset the functionality. |
2024-04-10 16:11:01 +0200 | commented question | How to stop code after a given time As for alarm, it needs to be reset after each use by calling alarm() without arguments, which will make it available for |
2024-04-10 15:47:34 +0200 | commented question | How to stop code after a given time As for alarm, it's need to be reset after each use by calling alarm() without arguments, which will make it available fo |
2024-04-10 13:14:47 +0200 | commented question | How to stop code after a given time Check this out: https://ask.sagemath.org/question/10112 |
2024-04-10 01:37:03 +0200 | commented question | Substitution using function-call syntax and unnamed arguments has been removed. You can use named arguments instead Yes. issue #37776 is empty. Please edit it and add the content. |
2024-04-09 22:36:52 +0200 | commented question | Issue with GAP in SageMath 10.3 when using PyCharm, but no issue in JupyterLab You may like to check out this Q&A: https://ask.sagemath.org/question/38750 |
2024-04-09 22:28:06 +0200 | commented question | Is posssible debugging? How to use files? Check out this Q&A: https://ask.sagemath.org/question/39742 |
2024-04-09 22:00:16 +0200 | edited answer | How to get rid of a memory-leak when solving equations modulo an integer with sage? I'd suggest to report this issue to https://github.com/sagemath/sage/issues A surprising workaround for memory leak iss |
2024-04-09 21:59:19 +0200 | edited answer | How to get rid of a memory-leak when solving equations modulo an integer with sage? I'd suggest to report this issue to https://github.com/sagemath/sage/issues A surprising workaround for memory leak iss |
2024-04-09 21:57:18 +0200 | answered a question | How to get rid of a memory-leak when solving equations modulo an integer with sage? I'd suggest to report this issue to https://github.com/sagemath/sage/issues A surprising workaround for memory leak iss |
2024-04-09 06:26:27 +0200 | commented question | Issue with GAP in SageMath 10.3 when using PyCharm, but no issue in JupyterLab Perhaps you need to set up SAGE_GAP_COMMAND environment variable as described at https://www.jetbrains.com/help/pycharm/ |
2024-04-09 02:08:31 +0200 | edited question | Issue with GAP in SageMath 10.3 when using PyCharm, but no issue in JupyterLab Issue with GAP in SageMath 10.3 when using PyCharm, but no issue in JupyterLab Hi, I've been struggling for the past few |
2024-04-08 20:24:58 +0200 | commented question | Is posssible debugging? How to use files? You can load .sage files with load() function. |