MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

give An example of an irreducible polynomial that cannot prove it by using the Eisenstein criterion even with the use of all linear change variable($x-c=y$).

share|cite|improve this question

closed as too localized by Felipe Voloch, Mark Sapir, Martin Brandenburg, Bruce Westbury, Torsten Ekedahl Nov 8 '11 at 12:39

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

It would be nice if you didn't formulate this as a command ("give an example...") and explained why you are asking (idle curiosity, homework,...). Your question isn't at the intended level of MO, but I'll make a comment which I think is: if $K$ is a number field in which (1) the ring of integers has the form ${\mathbf Z}[\alpha]$ and (2) no prime number is totally ramified, then the minimal polynomial of $\alpha$ over ${\mathbf Q}$ has the feature you seek. Many cyclotomic extensions of ${\mathbf Q}$ fits these properties. – KConrad Nov 8 '11 at 11:59
Newton polygon scenarios systematically give examples just-slightly-more-complicated than Eisenstein-criterion examples. E.g., $x^{n+1}+2x+4$: the slopes are $1/n$ $n$ times and a single $1$. Thus, this has at least an irreducible degree-$n$ factor. Excluding a rational root is easy (not $\pm 1,\pm 2\pm 4$), so it's irreducible. – paul garrett Nov 8 '11 at 16:40

$x^2+8$ is an example.

share|cite|improve this answer

It is possible to produce a polynomial that cannot (provably) be proved to be irreducible considering the valuations of the roots, or even any polynomial function in the roots (which can be much more general than a linear substitution), for every possible valuation over the base field.

Let $L/K$ be an unramifed extension of numeber fields (for instance the Hilbert class field of a $K$ with non-trivial class group), generated by $\alpha$ say. Then the minimal polynomial for $\alpha$ over $K$ will do.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.