| 2026-01-16 14:19:01 +0100 | commented question | polynomials over integers modulo... OK cool, i'll do that! |
| 2026-01-13 15:18:48 +0100 | commented question | polynomials over integers modulo... PS from the message error it's clear that a certain "long" integer in the code should be "unsigned long" instead. |
| 2026-01-13 15:10:47 +0100 | asked a question | polynomials over integers modulo... polynomials over integers modulo... Just wanted to report a bug: it's impossible to work with polynomials with coefficie |
| 2024-08-30 09:46:33 +0100 | received badge | ● Notable Question (source) |
| 2024-08-30 09:46:33 +0100 | received badge | ● Popular Question (source) |
| 2024-08-20 07:30:02 +0100 | received badge | ● Popular Question (source) |
| 2023-09-18 18:21:48 +0100 | received badge | ● Nice Question (source) |
| 2023-08-31 14:07:14 +0100 | received badge | ● Good Question (source) |
| 2023-08-31 11:00:38 +0100 | received badge | ● Editor (source) |
| 2023-08-31 11:00:38 +0100 | edited question | checking if element of QQbar is in QQ checking if element of QQbar is in QQ I would like to know the most efficient way of checking whether a given element x |
| 2023-08-30 22:10:02 +0100 | commented question | checking if element of QQbar is in QQ They were obtained as rational points on a 0-dimensional variety (and then combined in various ways). I'm not sure how t |
| 2023-08-30 16:46:10 +0100 | asked a question | checking if element of QQbar is in QQ checking if element of QQbar is in QQ I would like to know the most efficient way of checking whether a given element x |
| 2023-07-10 10:55:07 +0100 | received badge | ● Nice Question (source) |
| 2023-07-07 16:02:41 +0100 | received badge | ● Student (source) |
| 2023-07-07 15:37:16 +0100 | asked a question | graph plot: size of arrow heads graph plot: size of arrow heads Hi ! I was wondering how I could reduce the size of arrow heads while plotting a direct |
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.