20191018 22:52:59 0500  received badge  ● Famous Question (source) 
20190125 08:44:54 0500  received badge  ● Notable Question (source) 
20190125 08:44:54 0500  received badge  ● Popular Question (source) 
20190107 08:38:04 0500  received badge  ● Popular Question (source) 
20171211 07:09:46 0500  received badge  ● Notable Question (source) 
20170929 09:31:09 0500  received badge  ● Famous Question (source) 
20170802 16:28:12 0500  received badge  ● Famous Question (source) 
20170404 16:19:13 0500  received badge  ● Popular Question (source) 
20160929 08:00:38 0500  received badge  ● Popular Question (source) 
20160209 07:41:20 0500  received badge  ● Notable Question (source) 
20160209 07:41:20 0500  received badge  ● Popular Question (source) 
20151117 06:15:57 0500  received badge  ● Notable Question (source) 
20150724 06:55:00 0500  received badge  ● Popular Question (source) 
20150628 03:12:05 0500  received badge  ● Notable Question (source) 
20150628 03:12:05 0500  received badge  ● Popular Question (source) 
20150612 12:58:16 0500  received badge  ● Commentator 
20150612 12:58:16 0500  commented answer  About finding roots of polynomials in specific domains And what would be a command to check if R turned out to be empty? I need some kind of an error catching for that. 
20150612 12:57:23 0500  commented answer  About finding roots of polynomials in specific domains If you just wrote "p.roots()" would it give all the roots? (and not just the reals) 
20150612 12:56:35 0500  commented answer  About finding roots of polynomials in specific domains Thanks! Let me try this. 
20150611 16:31:40 0500  asked a question  About finding roots of polynomials in specific domains I have two polynomials $p(x)$ and $q(x)$ and I want to know if there are roots of the equation $\frac{p'}{p} = \frac{q'}{q}$ in the domain $(a,\infty)$ , where $a = max { roots(p), roots(q) } $ This is the same as asking for the roots of the polynomial, $p'q  pq' = 0$ in the same domain.

20150604 15:12:06 0500  asked a question  How does one detect cyclic vectors in SAGE? Given a vector $v$ and a matrix $A$ of dimension $n$, one would say that $v$ is a cyclic vector of $A$ if the following set is linearly independent ${ v,Av,A^2v,..,A^{n1}v }$. Is there a way to test this property on SAGE given a $v$ and a $A$? 
20150512 17:46:27 0500  commented answer  How to make "zip" work faster? I need to analyze each mapping one by one. So does "k = zip(B,i)" be exactly replaced by "k = izip(B,i)" ? 
20150512 17:43:20 0500  commented answer  How to make "zip" work faster? How is this S different from my S ? 
20150510 16:42:04 0500  asked a question  How to make "zip" work faster? I have these two finite sets $A$ and $B$ where the size of $A$ is typically much larger than the size of $B$. (typically $A is 200500$ and $B is 1050$) I am trying to enumerate all possible maps from $B$ to $A$ using the following idea  but this turns out to be very slow.

20150121 21:32:42 0500  received badge  ● Supporter (source) 
20150121 12:03:54 0500  asked a question  A problem with changing rings Why is this piece of code not working? I would have thought that I can get the exact roots of 
20150121 11:41:52 0500  commented answer  How to stop Sage from finding erroneous complex roots? @tmonteil The problem is that (even in your last segment) Sage seems to be finding complex roots! This is not possible! And is there a way to get this polynomial  the one I quoted in my question? (...the P that you have has constants as coeficients  what do you mean by "symbolic coefficients" ? ...) 
20150121 06:54:06 0500  marked best answer  Why doesn't Sage evaluate to zero on its own found roots? This gave, But then What is going on!? 
20150121 04:34:32 0500  received badge  ● Student (source) 
20150121 02:20:04 0500  marked best answer  How to pick out the largest root of an equation? I tried the following but it didn't work, p = x^2  7ax + 5; a=5; m = max((p == 0).solve([x])) 
20150120 23:06:19 0500  asked a question  How to stop Sage from finding erroneous complex roots? Consider the matrix, where w is the m^th of the k^th roots of unity, Then the characteristic polynomial of the above matrix is,
Now I try getting roots of the above by doing,

20150120 21:52:54 0500  asked a question  Why don't WolframAlpha's and Sage's answer match? Consider this input to WolframAlpha, The solutions it gives are, But the same equation on sage gives the roots, It seems that the first two roots given by WolframAlpha differ from the last two roots given by Sage. Why? 
20150120 21:41:01 0500  received badge  ● Scholar (source) 