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.
| 2022-10-10 15:48:53 +0200 | received badge | ● Popular Question (source) |
| 2021-04-19 22:40:10 +0200 | received badge | ● Good Question (source) |
| 2021-04-18 22:24:27 +0200 | received badge | ● Nice Question (source) |
| 2021-04-18 20:23:56 +0200 | commented answer | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Done: https://trac.sagemath.org/ticket/31686 |
| 2021-04-18 12:56:40 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem |
| 2021-04-18 12:53:20 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem There se |
| 2021-04-18 12:52:46 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem There se |
| 2021-04-18 12:51:45 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem sage: p |
| 2021-04-18 12:51:10 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem sage: p |
| 2021-04-18 12:48:35 +0200 | received badge | ● Editor (source) |
| 2021-04-18 12:48:35 +0200 | edited question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessary hard factoring problem sage: p = |
| 2021-04-18 12:48:15 +0200 | asked a question | Computing the factored multiplicative order of an extension field tries to solve an unnecessarily hard factoring problem Computing the multiplicative order of an extension field tries to solve an unnecessary hard factoring problem sage: p = |
| 2021-04-18 12:04:01 +0200 | commented answer | Segmentation fault calling is_irreducible() $ ldd /usr/lib/python3/dist-packages/sage/rings/polynomial/polynomial_zz_pex.cpython-39-x86_64-linux-gnu.so linux-vdso. |
| 2021-04-18 11:52:28 +0200 | commented answer | Segmentation fault calling is_irreducible() It seems I installed sagemath from testing (i.e. apt-get install -t testing sagemath). Sorry for the confusion. I realiz |
| 2021-04-18 11:51:19 +0200 | commented question | Segmentation fault calling is_irreducible() Correction: I actually installed from testing; see comment below. |
| 2021-04-18 11:50:02 +0200 | commented answer | Segmentation fault calling is_irreducible() It seems I installed sagemath from testing (i.e. apt-get install -t testing sagemath). Sorry for the confusion. |
| 2021-04-17 11:11:26 +0200 | received badge | ● Good Question (source) |
| 2021-04-17 10:16:11 +0200 | received badge | ● Supporter (source) |
| 2021-04-17 10:04:52 +0200 | commented question | Segmentation fault calling is_irreducible() The OS-packaged sage is using Python 3.9.2, if that helps. Anything I can do to help debug the package? |
| 2021-04-17 09:55:29 +0200 | commented question | Segmentation fault calling is_irreducible() Debian Buster, installed using sudo apt-get install sagemath. It's not reproducible in Sage compiled from source: ┌─── |
| 2021-04-17 09:54:29 +0200 | commented question | Segmentation fault calling is_irreducible() Debian Buster, installed using sudo apt-get install sagemath. It's not reproducible in Sage compiled from source: $ ./ |
| 2021-04-17 09:53:30 +0200 | commented question | Segmentation fault calling is_irreducible() Debian Buster, installed using sudo apt-get install sagemath. It's not reproducible in Sage compiled from source: $ ./ |
| 2021-04-17 08:43:46 +0200 | received badge | ● Nice Question (source) |
| 2021-04-17 00:59:55 +0200 | received badge | ● Student (source) |
| 2021-04-17 00:53:38 +0200 | asked a question | Segmentation fault calling is_irreducible() Segmentation fault calling is_irreducible() sage: R.<X> = PolynomialRing(GF(17^2)) sage: (X^2).is_irreducible() -- |
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.