9
$\begingroup$

I'm trying to find an algebraic proof of irreducibility of the polynomial $x^n-x-1$ over rational numbers (or integers, which the same). I've read the Selmer's paper "On the irreducibility of certain trinomials", and I got his idea, but... In his proof he uses analysis methods. I wonder, if the pure algebraic proof exists? I mean, without making graphics and curves, but studying polynomial as the element of Q[x], not as a function.

$\endgroup$
11
  • 6
    $\begingroup$ In the right hand column of this page you'll see a list of related questions that have been asked before; some of them look like they might be helpful. In particular, the question "About irreducible trinomials" has an answer pointing to a paper by Ljunggren. There is not an obvious route to an online copy, but the Math Review says that "The methods used are direct and elementary". $\endgroup$ Jun 19, 2013 at 21:07
  • 2
    $\begingroup$ mathoverflow.net/questions/56579/about-irreducible-trinomials $\endgroup$
    – user6976
    Jun 20, 2013 at 0:22
  • 1
    $\begingroup$ "direct and elementary" doesn't necessarily mean avoiding the use of elementary calculus, which I imagine is the only analysis Selmer uses (to get information about the real roots). So, I wouldn't say that this answers the question unless someone who has access to the paper can tell us more about what it uses. $\endgroup$ Jun 20, 2013 at 0:37
  • 2
    $\begingroup$ I looked at the paper by Ljunggren ("On the irreducibility of certain trinomials and quadrinomials." Math. Scand. 8 1960 65–70.) He only uses basic algebra, as far as I can tell. $\endgroup$
    – user6976
    Jun 20, 2013 at 1:57
  • 3
    $\begingroup$ Here is the link to the paper: mscand.dk/article.php?id=1564 $\endgroup$
    – user6976
    Jun 20, 2013 at 2:04

1 Answer 1

3
$\begingroup$

For an algebraic approach to the irreducibility, see the sketch I wrote as an answer to https://math.stackexchange.com/questions/393646/irreducibility-of-xn-x-1-over-mathbb-q.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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