Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135842
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135842 Prime numbers p of the form 10k+1 for which quintic polynomial x^5-x-1 modulus p is factorizable into five binomials. +0
6
5101, 8161, 9631, 17921, 26681, 31091, 39161, 39671, 40151, 41491, 43331, 44171, 44221, 48541, 75821, 77951, 84391, 94531 (list; graph; listen)
OFFSET

1,1

COMMENT

According to class field theory each quintic polynomial is completely reducible mod some prime number p of the form 10k+1

REFERENCES

S. Kobayashi & H. Nakagawa, Resolution of Solvable Quintic Equation, Math. Japonica Vol. 87, No 5 (1992), pp. 883-886.

MATHEMATICA

a = {}; Do[If[PrimeQ[10n + 1], poly = PolynomialMod[x^5 - x - 1, 10n + 1]; c = FactorList[poly, Modulus -> 10n + 1]; If[Sum[c[[m]][[2]], {m, 1, Length[c]}] == 6, AppendTo[a, 10n + 1]]], {n, 1, 10000}]; a

CROSSREFS

Cf. A135843.

Sequence in context: A058908 A116887 A034286 this_sequence A025398 A025397 A025402

Adjacent sequences: A135839 A135840 A135841 this_sequence A135843 A135844 A135845

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Dec 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research