Jsevillamol's profile - overview

● Student   × 1

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

● Notable Question   × 7

• 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()
• Making a quotient with Gaussian elements

● Famous Question   × 6

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

● Scholar   × 1

• Basic question about annihilator

● Self-Learner   × 1

• Computing the basis of the Frobenius function fixed point space

● Editor   × 1

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

● Teacher   × 1

• Computing the basis of the Frobenius function fixed point space

● Nice Question   × 3

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

● 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

● Nice Answer   × 1

• Computing the basis of the Frobenius function fixed point space

● Supporter   × 1

• Basic question about annihilator