2020-07-15 12:41:09 -0500 | received badge | ● Nice Answer (source) |

2016-12-09 05:09:57 -0500 | commented question | Issues with .99999999999... I believe this is due to number of precision http://doc.sagemath.org/html/en/reference/rings_numerical/sage/rings/real_mpfr.html It might be a good idea to work with RealField |

2016-11-20 16:23:02 -0500 | commented answer | why I can not get a numerical answer by show(integral(x^x,x,1,2)) Equivalently, feed the whole expression to $N$ sage: N(integral(x^x,x,1,2)) #2.0504462345347307 Also, the same syntax $N$ exists in |

2016-11-20 16:14:53 -0500 | received badge | ● Commentator |

2016-11-20 16:14:53 -0500 | commented answer | Finding prime factorization of ideals in number rings The theorem says a prime $p$ ramifies iff $p|\Delta$. However, this does NOT imply that a prime $p$ which does not ramify must inert, because there is a third case in which the prime splits. Look at problem for section 3.4, or for detailed treatment (Kummer-Dedekind theorem) see Stevenhagen's lecture notes Number Rings |

2016-10-27 12:16:44 -0500 | received badge | ● Enthusiast |

2016-10-26 13:32:50 -0500 | commented answer | Finding prime factorization of ideals in number rings a is the root of |

2016-10-21 10:00:48 -0500 | answered a question | Finding prime factorization of ideals in number rings Define your number field $\mathbb{Q}(\alpha), \alpha = \sqrt{2} + i$ . In your particular case |

2016-08-13 09:51:01 -0500 | commented question | Can I test that a Cayley table represents a group? The problem with Light's algorithm is that one needs to find generators before applying it, otherwise it would be more expensive than usual exhaustive search (from a memory point of view). That being said, I think it worth to implement those tests in sage. I might write a function in python which performs two tests based on arguments given. |

2016-08-12 16:26:29 -0500 | commented question | Can I test that a Cayley table represents a group? As mentioned here, there is a |

2016-08-03 12:01:54 -0500 | answered a question | Installing Cryptominisat Similar question has been asked but without a solution I installed sage through ubuntu PPA's and found an ## Step 0: Problem ## Step 1: Installing sufficient dependencies:According to
## Check pointNow, if you try: you will get a premission error. Even worse, trying sudo it would give you a root user error!
## Step 2: Change /usr/ib/sage and its subfolders' owner to you standard user$\color{red}{It\ is\ safer\ to\ revert\ ownership\ to\ the\ root}$ Execute Finally, Ta da |

2016-06-07 04:57:43 -0500 | received badge | ● Nice Answer (source) |

2016-05-28 13:24:04 -0500 | received badge | ● Teacher (source) |

2016-05-26 15:18:07 -0500 | commented answer | How to install seaborn in sagemath cloud? Not necessarily, you can install it locally. For this particular case, upload seaborn files into your cloud manually, then open terminal and run |

2016-05-26 15:04:06 -0500 | commented question | Simply trying to understand these lines of code I'll try to come back and read your post thoroughly. Meanwhile, this could be of interest http://doc.sagemath.org/html/en/refer... |

2016-05-26 14:31:19 -0500 | answered a question | How make Kummer extensions Note: I have NOT studied cyclotomic fields.
Also, if you check where
It seems an issue need to be solved.
$f$ was living in $\mathbb{Q}$,i.e. arithmetic on $f$ would be carry over $\mathbb{Q}$, writing Example: But, For more information see |

2016-04-27 13:07:54 -0500 | commented question | Coercion on continued fractions @mirgee Of course, you need to take of each case. I will try to implement this solution and post it here. I think if you manage to find an old version of sage then it is matter of copying and pasting. |

2016-04-21 05:57:08 -0500 | commented question | Coercion on continued fractions It might be interesting that an older version of sage supports addition and multiplication of continued fraction with each other as well with rational numbers. See William Stein's book Elementary Number Theory: Primes, Congruences, and Secrets. Another quick solution(as you mentioned) is to add sage's magical functions _add_ , _mul_, etc. to the class continued_fraction. It might goes as (for sure it is not an optimal solution): def _add_(self, other): check both types return continued_fraction(self.value + other) |

2016-01-10 08:53:04 -0500 | commented answer | Running Sage inside Python @gilieve I'd recommend Jupyter. |

2016-01-09 09:59:25 -0500 | answered a question | How to evaluate the infinite sum of 1/(2^n-1) over all positive integers? Another way to do that is by using SymPy: Give the result[1]:
I remember seeing a way to convert SymPy expression to SAGE format, but I don't know how exactly. [1] I apologize I typed another function in the command line which is $\frac{1}{x^2 -1}$. After realizing that, I tried to evaluate your function but ipython always crash. |

2016-01-09 04:13:28 -0500 | received badge | ● Famous Question (source) |

2016-01-06 05:08:52 -0500 | received badge | ● Popular Question (source) |

2016-01-06 05:08:52 -0500 | received badge | ● Notable Question (source) |

2016-01-04 13:13:58 -0500 | marked best answer | OverflowError: Python int too large to convert to C long in computing discrete logarithm I was trying to compute Discrete logarithm using sage built in method (Don't worry I am not breaking anyone encryption :)) Firstly I defined: Then tried to compute: After that this irritating error appeared: sage: %time discrete_log_rho(bet, K(2), K(2).order()) I can't get my head around this problem, I've tried to edit groups.py replacing xrange by itertools as suggested in hxxp://stackoverflow.com/questions/22114088/overflowerror-python-int-too-large-to-convert-to-c-long but the same problem still there!
First of all as error suggests that add the line (more) |

2016-01-04 13:13:58 -0500 | received badge | ● Supporter (source) |

2016-01-04 08:23:48 -0500 | received badge | ● Nice Question (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.