Testwiki:Reference desk/Archives/Mathematics/2020 October 22

From testwiki
Revision as of 16:00, 30 October 2020 by imported>Lambiam (Undid revision 986141846 by Jasper Deng (talk): live discussionb copied over)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Error:not substituted

{| width = "100%"

|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < October 21 ! width="25%" align="center"|<< Sep | October | Nov >> ! width="20%" align="right" |Current desk > |}

Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


October 22

Number of roots of polinomial in fields other than C

Hi,

if I am not mistaken, the fundermental theorem of Algebra states that there are at most deg(p) roots of a polinomial p[X]. Does this still hold true for finite fields?

Thanks TheFibonacciEffect (talk) 16:04, 22 October 2020 (UTC)

First, that degree-Template:Mvar polynomials have at most Template:Mvar roots over any field is reasonably straightforward to show; whenever Template:Mvar is a root, you can factor out Template:Math. In fact, this much remains true for polynomials over any integral domain.
Template:PbThe FToA says that every complex polynomial has at least one complex root. Combining this with the above observation, it follows that every such polynomial has exactly Template:Mvar roots (counted with multiplicity). However, finite fields are not algebraically closed, so there exist polynomials over them with no roots. In fact, finite fields will always have degree-2 polynonmials without roots; this can shown by a counting argument. –Deacon Vorbis (carbon • videos) 16:25, 22 October 2020 (UTC)
For a simple example, X23(mod4) has no integer solution, i.e. X23 in 4 has no root. TigraanClick here to contact me 08:50, 23 October 2020 (UTC)
Thank you
- TheFibonacciEffect (talk) 11:14, 23 October 2020 (UTC)
Template:Ping But 4 is not a field, no? Double sharp (talk) 13:49, 26 October 2020 (UTC)
I meant to say something here but forgot. No, it's not (it's not even an integral domain, which is equivalent to not being a field for finite objects anyway). And the bit about having no more roots than degree can fail when you're not in an integral domain. For example, the polynomial p(x)=2x2+2x has 4 roots in /4.Deacon Vorbis (carbon • videos) 14:16, 26 October 2020 (UTC)
In 3, the polynomial X2+1 has no roots.  --Lambiam 21:37, 26 October 2020 (UTC)
Experimentally, it appears that the polynomial Xn1+1, n>1, has roots in /n iff its degree n1 is odd. In the latter case we always have the root X=n1, and usually this is the only root. But sometimes there are more: for example, X27+1 has 3 roots in /28 (X=3, X=19, X=27), X741+1 has 39 roots in /742, and X945+1 has 105 roots in /946. I see no obvious pattern, but no doubt someone has studied this.  --Lambiam 08:05, 27 October 2020 (UTC)
If p is an odd prime, the absence of roots of Xp1+1 in /p follows from Fermat's little theorem. For composite odd moduli, their absence remains unexplained.  --Lambiam 17:50, 28 October 2020 (UTC)
The Chinese remainder theorem covers the case of products of distinct odd primes.--Jasper Deng (talk) 03:53, 29 October 2020 (UTC)