Jsevillamol's profile - overview

● Popular Question   × 8

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

● Nice Answer   × 1

• Computing the basis of the Frobenius function fixed point space

● Self-Learner   × 1

• Computing the basis of the Frobenius function fixed point space

● Teacher   × 1

• Computing the basis of the Frobenius function fixed point space

● Nice Question   × 3

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

● Scholar   × 1

• Basic question about annihilator

● Supporter   × 1

• Basic question about annihilator

● Student   × 1

• Canonical way of turning implicit equations into a subspace and vice versa

● Famous Question   × 5

• Making a quotient with Gaussian elements
• `Fraction must have unit denominator`when using polynomial.numerator()
• Solving systems of congruences with Gaussian integers
• Implementing the AKS primality test
• Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field

● Editor   × 1

• Canonical way of turning implicit equations into a subspace and vice versa

● Notable Question   × 7

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