## Registered User | |
---|---|

member since | 2016-10-22 18:04:44 +0200 |

last seen | 2018-12-01 16:38:05 +0200 |

todays unused votes | 30 votes left |

21

0

- rings× 5
- gaussian× 4
- finite-field× 4
- gcd× 3
- xgcd× 3
- polynomial× 2
- primality× 2
- QuotientRing× 2
- subspace× 2
- gaussians× 2
- fixed-points× 2
- algebra× 1
- congruence× 1
- CRT× 1
- IntegerRing× 1

● Student
×
1 ● Editor
×
1 ● Supporter
×
1

● Nice Answer × 1 ● Famous Question × 3

● Popular Question × 8

● Teacher × 1 ● Self-Learner × 1

● Nice Answer × 1 ● Famous Question × 3

- Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field
- Implementing the AKS primality test
- Solving systems of congruences with Gaussian integers

- Computing the inverse in GF(p^k) using the extended euclides algorithm
- Solving systems of congruences with Gaussian integers
- Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field
- Implementing the AKS primality test
- Basic question about annihilator
- `Fraction must have unit denominator`when using polynomial.numerator()

● Popular Question × 8

- `Fraction must have unit denominator`when using polynomial.numerator()
- Computing the inverse in GF(p^k) using the extended euclides algorithm
- Solving systems of congruences with Gaussian integers
- Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field
- Implementing the AKS primality test
- Making a quotient with Gaussian elements
- 1^1 undefined
- Basic question about annihilator

- Computing the basis of the Frobenius function fixed point space
- Solving systems of congruences with Gaussian integers
- Gaussians as Euclidean Domain

● Teacher × 1 ● Self-Learner × 1

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.