Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135843
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135843 Prime numbers p of the form 10k+1 for which pentancacci quintic polynomial x^5-x^4-x^3-x^2-x-1 modulus p is factorizable into five binomials. +0
6
691, 8311, 11731, 17291, 25111, 34421, 40531, 41131, 44971, 47521, 51341, 64891, 70111, 74161, 75991, 76261, 86441, 88471, 99611 (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^4-x^3-x^2-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. A135842.

Sequence in context: A033563 A156036 A029814 this_sequence A130662 A029828 A037149

Adjacent sequences: A135840 A135841 A135842 this_sequence A135844 A135845 A135846

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research