A simple proof of a generalization of Eisenstein's irreducibility criterion
Keywords:
Königsberg's criterion, polynomials, integers, rational numbers (es)Downloads
We present a simple proof of Königsberg's Criterion, [K] p.69 and also present families of irreducible polynomials over some fields. In particular, if (n, h) = 1, ao….., an-1 ϵ Z = ring of integers and p is a primer not dividing ao, then f (x) = xn - ph(ao+a1+…+an-1Xn-1) is irredudible over the rationals. Also if k is any field, then [Formula Matemática].
How to Cite
APA
ACM
ACS
ABNT
Chicago
Harvard
IEEE
MLA
Turabian
Vancouver
Download Citation
Article abstract page views
Downloads
License
Copyright (c) 1987 Revista Colombiana de Matemáticas

This work is licensed under a Creative Commons Attribution 4.0 International License.