I'm trying to factorise x^6+x^3+1 into irreducible factors in the finite field F19 (integers mod 19)- it seems time consuming and complicated to check each member of F19 to see if it's a root. Is there an easier way to do it?

Printable View

- Nov 6th 2009, 01:56 AMKSM08Factorisation in Finite Fields
I'm trying to factorise x^6+x^3+1 into irreducible factors in the finite field F19 (integers mod 19)- it seems time consuming and complicated to check each member of F19 to see if it's a root. Is there an easier way to do it?

- Nov 6th 2009, 04:16 AMHallsofIvy