6
$\begingroup$

Let $n$ be a positive integer greater than $1$, and define the polynomial $$p_{n}(x)=\sum_{k=0}^{n}\dfrac{x^k}{k!}$$

Is $p_{n}(x)$ irreducible in $\mathbf{Q}[x]$?

I can show it when $n$ is a prime number, since $$n!p_{n}(x)=x^n+nx^{n-1}+n(n-1)x^{n-2}+\cdots+n!x+n!$$ using Eisenstein's criterion.

Improve this question
$\endgroup$
8
  • $\begingroup$ Summation starts from $k=0$, right? $\endgroup$
    – Fedor Petrov
    Commented May 30, 2016 at 6:46
  • 1
    $\begingroup$ There is a fairly elementary proof at mattbakerblog.wordpress.com/2014/05/02/… together with some more notes on the topic. $\endgroup$
    – Tobias Kildetoft
    Commented May 30, 2016 at 8:50
  • $\begingroup$ @TobiasKildetoft,your link can't open it,Thanks,can you post this paper title? $\endgroup$
    – math110
    Commented May 30, 2016 at 8:58
  • $\begingroup$ It works fine for me. It is a blog post, not a paper (though he has some references to papers in it). $\endgroup$
    – Tobias Kildetoft
    Commented May 30, 2016 at 9:00
  • 1
    $\begingroup$ It is called Matt Baker's Math Blog and the post is called Newton polygons and Galois groups $\endgroup$
    – Tobias Kildetoft
    Commented May 30, 2016 at 9:22

1 Answer 1

Reset to default
20
$\begingroup$

That follows from a theorem of Schur saying that any polynomial $\sum_{k=0}^nc_k\frac{x^k}{k!}$ with $c_i\in\mathbf{Z}$, $c_0,c_n\in\{1,-1\}$, $n\ge 1$, is irreducible over $\mathbf{Q}$.

I. Schur, Einige Sätze über Primzahlen mit Anwendungen auf Irreduzibilitätsfragen I, Sitzungsberichte Preuss. Akad. Wiss. Phys.-Math. Klasse 14 (1929), 125–136. Also in Gesammelte Abhandlungen, Band III, 140–151

See also here.

Improve this answer
$\endgroup$
1
  • $\begingroup$ Thanks,maybe there exist elementary proof? because it's nice result,like the erdos methods? $\endgroup$
    – math110
    Commented May 30, 2016 at 8:46

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .