2021-01-29 17:48:17 +0200 | received badge | ● Great Answer (source) |

2017-09-18 02:21:54 +0200 | received badge | ● Nice Answer (source) |

2016-10-17 20:31:27 +0200 | received badge | ● Good Answer (source) |

2016-10-17 20:24:51 +0200 | received badge | ● Nice Answer (source) |

2016-08-10 14:03:46 +0200 | received badge | ● Taxonomist |

2015-08-04 14:20:17 +0200 | received badge | ● Nice Answer (source) |

2015-02-26 14:32:07 +0200 | received badge | ● Nice Answer (source) |

2014-12-10 10:52:12 +0200 | received badge | ● Nice Answer (source) |

2014-02-07 09:25:25 +0200 | received badge | ● Guru (source) |

2014-02-07 09:25:25 +0200 | received badge | ● Great Answer (source) |

2013-11-18 13:48:45 +0200 | received badge | ● Nice Answer (source) |

2013-10-02 17:17:06 +0200 | received badge | ● Good Answer (source) |

2013-10-02 17:17:06 +0200 | received badge | ● Nice Answer (source) |

2013-10-02 17:17:06 +0200 | received badge | ● Great Answer (source) |

2013-10-01 01:18:41 +0200 | received badge | ● Good Answer (source) |

2013-07-27 21:42:20 +0200 | received badge | ● Great Answer (source) |

2013-07-03 22:07:46 +0200 | received badge | ● Good Answer (source) |

2013-06-28 03:50:26 +0200 | received badge | ● Nice Answer (source) |

2013-02-19 12:39:27 +0200 | received badge | ● Nice Answer (source) |

2013-02-18 16:15:12 +0200 | answered a question | Buchberger Algorithm The best option is to just use (more) |

2012-11-22 13:17:05 +0200 | received badge | ● Nice Answer (source) |

2012-11-22 13:17:05 +0200 | received badge | ● Good Answer (source) |

2012-11-22 13:17:05 +0200 | received badge | ● Great Answer (source) |

2012-10-26 01:06:09 +0200 | received badge | ● Good Answer (source) |

2012-10-23 11:04:30 +0200 | received badge | ● Nice Answer (source) |

2012-10-23 11:04:30 +0200 | received badge | ● Good Answer (source) |

2012-10-16 11:43:09 +0200 | received badge | ● Good Answer (source) |

2012-09-29 12:39:33 +0200 | received badge | ● Guru (source) |

2012-09-29 12:39:33 +0200 | received badge | ● Great Answer (source) |

2012-09-29 12:39:33 +0200 | received badge | ● Nice Answer (source) |

2012-09-29 12:39:33 +0200 | received badge | ● Good Answer (source) |

2012-09-08 18:58:54 +0200 | received badge | ● Nice Answer (source) |

2012-08-28 05:54:26 +0200 | answered a question | Can't thread with permutation groups? The problem is that the GAP interface is not threadsafe -- both threads are accessing the same GAP session. You could use the The result of the (decorated) try_method function is an iterator which will yield the results as soon as they are ready. In this case, we just need the first one. |

2012-06-14 03:04:51 +0200 | edited answer | Symbolic product in Sage? I found symbolic sum but not symbolic product in the reference files. I need to be able to classify a function of a erratic x which involve several symbolic foodstuffs from 1 to n or whatever. I then want to be able to do a derivative and a limit of this. I am trying out Sage because Mathematical doesn't seem to be able to handle this stuff exactly. I can define the function just fine but when I try to take the limit Mathematical can't seem to handle it. |

2012-06-14 03:04:13 +0200 | commented answer | How to "recover" real number from expression? Yeah, the name make s more sense when you're familiar with the underlying pynac library. Can you think of a better name that we could use as an alias? |

2012-06-13 23:11:32 +0200 | answered a question | How to "recover" real number from expression? You can use the |

2012-06-13 14:00:06 +0200 | received badge | ● Great Answer (source) |

2012-06-13 14:00:06 +0200 | received badge | ● Guru (source) |

2012-05-29 07:26:18 +0200 | received badge | ● Good Answer (source) |

2012-05-28 16:23:59 +0200 | received badge | ● Nice Answer (source) |

2012-05-28 15:14:39 +0200 | edited question | Spam.......... Spam.......... |

2012-05-27 23:32:42 +0200 | commented answer | Polynomial identity You can put this in ~/.sage/init.sage and it will be loaded each time you start Sage. You can also run "%cpaste" from the command line, paste the code in, and then put in "--" to finish the paste. |

2012-05-27 19:03:28 +0200 | answered a question | small group library You should be able to run to install it. |

2012-05-27 18:35:53 +0200 | answered a question | Polynomial identity Here is some code which "linearizes" your problem: The result is a vector space which gives you all of your solutions. Your example shows that (0,0,0) is the only answer. Another example: |

2012-05-26 01:32:08 +0200 | answered a question | How to find the path of the maximal distance between two vertices on a complete digraph? One way to do the general case uses the There is also a At the theoretical level, the problem is really easy for this specific graph since there are edges between all the vertices. Thus, you can just pick the endpoints and take any permutation of the remaining vertices (or subset of them) to get a path of a fixed length. |

2012-05-19 14:08:15 +0200 | commented question | Error compiling 5.0: scipy-0.9.p1 Can you post some more information from the log about how it failed? |

2012-05-18 18:27:22 +0200 | answered a question | how to use sage's f2py from linux command line? Try running from the command-line first. When you then run, it will pick up Sage's copy of f2py (which will use Sage's Python). |

2012-05-18 01:55:19 +0200 | received badge | ● Nice Answer (source) |

2012-05-18 01:55:19 +0200 | received badge | ● Good Answer (source) |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.