We prove that if $f(x)=\sum _{k=0}^{n-1}a_{k}x^{k}$ is a polynomial with no cyclotomic factors whose coefficients satisfy $a_{k}$ ≡ 1 mod 2 for 0 ≤ k < n, then ...
The deterministic factorization algorithm for polynomials over finite fields that was recently introduced by the author is based on a new type of linearization of the factorization problem. The main ...
Hosted on MSN
Mathematicians Thought This Algebra Problem Was Impossible. Two Geniuses May Have Found a Solution.
Two mathematicians have used a new geometric approach in order to address a very old problem in algebra. In school, we often learn how to multiply out and factor polynomial equations like (x² – 1) or ...
Two mathematicians have used a new geometric approach in order to address a very old problem in algebra. In school, we often learn how to multiply out and factor polynomial equations like (x² – 1) or ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback