2017-04-14 03:20:38 -0500 | received badge | ● Popular Question (source) |

2014-07-05 16:24:13 -0500 | answered a question | Does sage have facilities to help prove theorems? It seems that you are asking whether Sage can think. It cannot. We are fortunately still not there. That would be very dangerous for human kind, as has been recently remarked by Stephen Hawking, among other people. There are many people trying to make it happen, though, but it still seems quite far. |

2012-01-28 17:57:32 -0500 | received badge | ● Nice Answer (source) |

2011-12-21 05:54:58 -0500 | received badge | ● Teacher (source) |

2011-12-20 05:43:07 -0500 | received badge | ● Editor (source) |

2011-12-20 05:41:12 -0500 | answered a question | Defining a function of the form $f(x_1,x_2,...,x_n)=\sum_{i=0}^n x_i$ What about this? Assume $x$ is a list. Then: (I just think it's easier to remember than the answer by DSM.) |

2011-12-09 08:38:51 -0500 | received badge | ● Supporter (source) |

2011-12-09 08:29:22 -0500 | commented question | Sage crashes when inverting a large matrix - alternatives? Thanks for the comments. I am sorry I did not come back before. (The reason was basically that I did not get notified of your comments by the system.) I do not know how the binary was compiled because I am using the version installed in the university's server. I will try to provide a concrete example, the way Simon King has suggested below. |

2011-11-22 06:32:49 -0500 | received badge | ● Student (source) |

2011-11-21 06:46:14 -0500 | asked a question | Sage crashes when inverting a large matrix - alternatives? I'm trying to find the inverse of a 50x50 dense matrix of rational numbers. The matrix is created using the method I'm doing this at the university, so the number of processors and RAM both seem to be infinite. I wonder if there is an alternative. For example, I could try to invert the matrix in Mathematica or Maple. Is there an easy way to interface with them? Thank you! |

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.