How to factor a polynomial modulo p?

  • Thread starter Thread starter joebohr
  • Start date Start date
  • Tags Tags
    Polynomial
joebohr
Messages
57
Reaction score
0
I can understand most of Galois Theory and Number Theory dealing with factorization and extension fields, but I always run into problems that involve factorization mod p, which I can't seem to figure out how to do. I can't find any notes anywhere either, so I was wondering if someone could give me some steps. p is prime, of course.
 
Physics news on Phys.org
Do you have any specific questions? For general reading material, you could try googling "factoring polynomials over finite fields".
 
morphism said:
Do you have any specific questions? For general reading material, you could try googling "factoring polynomials over finite fields".

I seem to have figured out how to factor mod p (in a prime field) between a couple documents:

"www.science.unitn.it/~degraaf/compalg/polfact.pdf"

http://www.math.uiuc.edu/~r-ash/Ant/AntChapter4.pdf

However, I'm still wondering what other types of finite fields it would be useful to factor over (am I correct in assuming that not all finite fields are prime fields?)
 
Last edited by a moderator:
You usually reduce the polynomial using the small Fermat theorem, xp \equiv x (mod p) for every variable x that has a power greater than p-1
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top