20190507 01:05:32 +0100  received badge  ● Necromancer (source) 
20170918 02:08:58 +0100  received badge  ● Nice Answer (source) 
20170325 17:50:35 +0100  received badge  ● Nice Answer (source) 
20150520 20:49:41 +0100  commented question  Elements in the lattice $A_n$ Sorry, misread your question. Here's some facts
So, a sketch of algorithm to generate one such vector would be :
To iterate over all such vectors, you can use Sage's 
20150519 14:23:21 +0100  commented question  Elements in the lattice $A_n$ I think you are looking for the integer partitions of k of length n+1. Have a look at the iterator 
20150331 17:23:16 +0100  answered a question  notebook versus terminal session The notebook is all about the web. Everything you can do at the terminal, you can do in the notebook. And _vice versa_. Some things, are just more nicely shared via a notebook. See http://nbviewer.ipython.org/ (not Sage, but close enough). Other good reasons to use notebooks :
Personally, I always use the terminal for personal or one shot computations, and Sage inside an IPython notebook for collaborating and sharing. 
20150228 16:33:00 +0100  commented question  Using from Python (breaking the monolith) I fully agree with you, and I am certainly not the only one. Unfortunately, Sage is a monolith, and there is little you can do right now. Making Sage more modular is one of the goals of this submitted EU project https://github.com/sagemath/granteurope, that will hopefully begin next september. 
20141228 15:26:38 +0100  answered a question  Variables in Sage You must have forgotten the multiplication sign In Sage 6.4.1 
20141130 21:50:26 +0100  commented answer  Why does Sage return negative number when evaluating 181.0%360 Exactly for the reason I said: so that the output is consistent with the output of In Python rounding is done to the lowest integer, so it makes sense to return 181, indeed In Mathematica, rounding is done to the closest integer, and indeed answers 541 on WolframAlpha. Oups! Guess Mathematica does not really care for mathematical consistency. 
20141124 18:00:29 +0100  commented answer  Lower prime divisor Didn't know about 
20141124 17:59:13 +0100  answered a question  Lower prime divisor It depends on the numbers you are factoring. Factorization algorithms for large numbers do not find factors in increasing order, thus you need to compute all factors in order to know which is smallest. If your number is small, or has very small factors, this might be faster : play around with 
20141123 19:43:29 +0100  answered a question  Why does Sage return negative number when evaluating 181.0%360 So that this code works From the sage docstring (which you can read by typing

20140919 16:25:39 +0100  answered a question  Converting polynomials between rings Because of the order you've defined the objects, 
20140830 00:47:38 +0100  received badge  ● Nice Answer (source) 
20140729 20:49:17 +0100  received badge  ● Nice Answer (source) 
20140722 14:55:31 +0100  received badge  ● Nice Answer (source) 
20140720 12:39:29 +0100  answered a question  "divides" in ring of integers With your input, returns which is fishy. 
20140719 02:40:34 +0100  commented answer  How Do I Extract Terms Containing Certain Coefficients From A Polynomial? Careful: there's an indentation level missing after the second for 
20140719 02:37:15 +0100  commented answer  How Do I Extract Terms Containing Certain Coefficients From A Polynomial? To convert back to polynomial, just sum() over the list. 
20140719 00:48:16 +0100  answered a question  How Do I Extract Terms Containing Certain Coefficients From A Polynomial? I am not sure how I should interpret your criterion: do you want to allow a variable to appear more than once in the same monomial? Supposing you do, and supposing There's certainly many other, but I am afraid none is going to be very simple. A word of explanation:
Thanks for this refreshing riddle :) 
20140718 16:37:45 +0100  commented answer  How th work with enumerable and infinite set This is now http://trac.sagemath.org/ticket/16676 
20140718 16:25:06 +0100  answered a question  How th work with enumerable and infinite set You just found a bug in Sage. Sage does not have enough knowledge to know that the set of rationals that are not prime numbers is infinite. If there was no bug, you'd have an error saying something like "Sage cannot compute the cardinality of B". However, if you type 
20140614 08:24:01 +0100  received badge  ● Nice Answer (source) 
20140613 08:34:34 +0100  answered a question  Find algebraic solutions to system of polynomial equations Yes, you can use Gröbner bases. Here is an example Tis is not implemented with coefficients in 
20140430 12:12:04 +0100  commented question  derivative of MPolynomial_polydict I'm sorry. This doesn't help either. If you want useful help, you must make an useful effort to isolate the potential bug. It is by putting less code, not more, that you will achieve this: I cannot guess what parameters to `lambda_siep` are going to trigger the bug. 
20140429 10:37:24 +0100  commented question  derivative of MPolynomial_polydict I cannot reproduce your problem. Please give a complete working example. How much is `n`? Who's `Y`? There's a missing braket in your definition of `R`. 
20140417 14:43:01 +0100  answered a question  Silverman Appendix G Don't think so. Maybe you'll have more interesting answers on the sagent list https://groups.google.com/forum/#!forum/sagent 
20140217 13:36:12 +0100  answered a question  Cutting unnecessary zeroes in float numbers You could just check that Or, instead of will format If you have a locale configured for French/Italian/whatever notation will automatically put a comma instead of a dot for you. 
20140210 15:48:53 +0100  answered a question  List members of each subgroup of integers modulo n
So, you may call 
20140206 15:34:33 +0100  commented question  Best practice: python vs sagepython This is not really a question. However, I don't see any reason to uninstall your system's copy of python. Just my 2 pence. 
20140125 14:57:14 +0100  answered a question  Difficulties evaluating an expression string
Depending on what you want to do, it may be more appropriate to use 
20140118 06:35:58 +0100  commented answer  Multivariate polynomials again: specifying variables I would have said that [c.polynomial(y) for c in p.polynomial(x)] is not too much typing to achieve want you want, but I just tried it and it looks buggy. I'll investigate further. 
20140116 20:35:56 +0100  answered a question  Multivariate polynomials again: specifying variables Symbolics have a method Multivariate polynomial rings have a method Both methods collect only with respect to one variable, so you may need to iterate. 
20140112 16:03:19 +0100  answered a question  Representing finite field elements in terms of subfield elements This is not supported yet. Your best option, for the moment, is use linear algebra: which, of course, says $a$ equals $1 + w_4(1+w_2)$. 
20140106 08:26:30 +0100  received badge  ● Enthusiast 
20140104 10:01:52 +0100  answered a question  A problem on Groebner Fans with more than 10 variables Surprisingly, as the error message says, some methods do not apparently work when some variable names are prefixes to others. Here's a nasty workaround ... you'll have to get creative when you go past 26 variables, though! 
20131227 04:19:21 +0100  answered a question  morphism between permutation group and matrix group Sage did not remove Gap's functionality, it simply did not interface to it. There seems to be no implementation of Homsets specific to groups, and in particular no implementation of morphisms specified via the images of the generators, like there is for rings, for example. I agree that the error message is not very informative. I see no easy workaround: either you define your own python functions, or you work directly with gap. This is probably worth a ticket on trac.sagemath.org. 
20131217 23:36:33 +0100  received badge  ● Nice Answer (source) 
20131217 17:15:50 +0100  answered a question  Does Sage "Show Its Work"? Sage is open source. A student, or anyone else, can learn how sage computes the answers by reading the source code. This can even be done interactively, by using the ( Admittedly, this will rarely give you a crystal clear explanation of the algorithm, as most of the time the work is done elsewhere (for example in some C library). 
20131217 06:33:16 +0100  answered a question  where candownload v5.13 ? mirror all is v5.12 I suppose you use the Windows version. Please wait a couple of days, as it takes some more work to create the virtual machine for Windows. 
20131205 23:32:59 +0100  received badge  ● Nice Answer (source) 