2021-02-24 23:56:07 +0100 | received badge | ● Good Question (source) |

2021-02-24 19:04:09 +0100 | received badge | ● Nice Question (source) |

2021-02-24 09:28:08 +0100 | asked a question | Create quotient group of units of mod n I would like to work with the group $\mathbb{Z}_m^* / \langle p \rangle$. Do you know how I can create it? For example: But the last line raises a |

2020-05-02 10:19:11 +0100 | received badge | ● Popular Question (source) |

2020-04-09 08:49:18 +0100 | received badge | ● Notable Question (source) |

2020-04-09 08:49:18 +0100 | received badge | ● Popular Question (source) |

2019-12-05 12:56:01 +0100 | received badge | ● Nice Answer (source) |

2019-11-29 11:09:15 +0100 | received badge | ● Teacher (source) |

2019-11-29 11:09:15 +0100 | received badge | ● Necromancer (source) |

2019-11-27 16:34:18 +0100 | answered a question | importing .sage files Just to make @niles' answer more explicit: You can add the following function to the beginning of your main sage script. Then, to import all functions from my_lib.sage, you can do To import a particular function, say my_func, you can do (I created this function using this solution) |

2019-07-02 09:00:09 +0100 | asked a question | Octave-like plot function, or, how to plot sequence of points? Let's say I have the following set of points: (1, 2), (5, 8), (7, 13), (8, 10), (8.7, 9), (10, 6.3), (13, 2), (15, -1). I would like to plot a 2D graph passing through them. In octave, I can do the following: And I get this graph. How can I do something similar in sage? |

2019-02-13 16:38:18 +0100 | commented question | Compute xgcd over Gaussian integers @rburing I see. Thank you very for the comment. It was very useful! |

2019-02-13 10:26:39 +0100 | received badge | ● Editor (source) |

2019-02-13 10:25:35 +0100 | asked a question | Compute xgcd over Gaussian integers As you can see below, I can create the ring of Gaussian integers and compute the greatest common divisor of two elements: However, when I try to find $u, v \in \mathbf{Z}[i]$ such that $u\cdot F + v\cdot G = 1$ in $\mathbf{Z}[i]$ (that is, to run the extended GCD), I get the following error:
Do you know how I can find such $u$ and $v$? |

2018-12-04 16:06:03 +0100 | commented answer | Speed a function with hex grid and primes numbers It is really strange that it gets slower... Could you test something like abs(n-t).is_prime(proof=False) and see if it also takes 10 seconds? |

2018-02-21 10:30:23 +0100 | received badge | ● Citizen Patrol (source) |

2018-02-20 15:33:49 +0100 | asked a question | Speed up calculation of left kernel Is there any way to accelerate the calculation of the left kernel of a matrix? It could be by allowing sage to use more memory or using some parallelism, for instance. I have a 1230 x 74 dense matrix over Integer Ring and when I try to use the calculations doesn't finish (it has run for three days and then I interrupted the script). |

2017-11-06 09:46:16 +0100 | asked a question | Inverse of matrix over polynomial ring without changing ring Let $Rq$ be the ring of polynomials with coefficients in $\mathbb{Z} / q\mathbb{Z}$, for some $q$ prime. I have a matrix with coefficients in $Rq$ and I would like to find its inverse in $Rq$, but when I try to calculate its inverse, I got a matrix whose elements are fractions of polynomials. For instance, the following code has outputs like this:
Do you know how can I get an inverse matrix with entries also in $Rq$ instead of in that fractional field? |

2017-08-02 08:33:49 +0100 | commented answer | Equivalent of Polynomial.list() for expression involving generator of GaloisField That works! I had tried similar things, but not really that. Thank you! |

2017-08-02 08:33:15 +0100 | received badge | ● Scholar (source) |

2017-08-02 08:33:14 +0100 | received badge | ● Supporter (source) |

2017-08-02 00:54:06 +0100 | received badge | ● Student (source) |

2017-08-02 00:51:04 +0100 | asked a question | Equivalent of Polynomial.list() for expression involving generator of GaloisField I know that it is possible to use the method list() to get a list with the coefficients of a polynomial. For instance: I would like to do something like that with an expression involving a generator of a Galois Field. For example: So, ideally, I would like to do the following and get Is there any simple way to that? |

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.