Arithmetic properties of polynomial solutions of the Diophantine equation P(x)xn+1+Q(x)(x+1)n+1=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$$\end{document}

For each integer n≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 1$$\end{document} we consider the unique polynomials P,Q∈Q[x]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P, Q\in {\mathbb {Q}}[x]$$\end{document} of smallest degree n that are solutions of the equation P(x)xn+1+Q(x)(x+1)n+1=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$$\end{document}. We derive numerous properties of these polynomials and their derivatives, including explicit expansions, differential equations, recurrence relations, generating functions, resultants, discriminants, and irreducibility results. We also consider some related polynomials and their properties.


Introduction
It is a well-known fact that the Chebyshev polynomials of the first and second kind, T n (x) and U n (x), can be defined as the solutions of the polynomial Pell equation in the ring Z[x]; see [1] or [2] for more general polynomial rings. In this paper we consider the following variant of Eq. (1.1): Since Q[x] is a Euclidean domain, we know that for given coprime polynomials f , g ∈ Q[x] there are polynomials To make this more specific, we choose f and g to be the simplest pair of coprime polynomials of the same degree, namely x n+1 and (x + 1) n+1 , where n ≥ 0 is an integer. In other words, we consider the equation If we make the assumption deg P ≤ n, deg Q ≤ n, then we have a unique solution P(x) = P n (x), Q(x) = Q n (x) of (1.2). In particular, for integers n ≥ 0. The purpose of this paper is to study properties of the polynomial sequences P n (x), Q n (x). We will see that these polynomials have integer coefficients, are similar to each other, and in spite of some fundamental differences they show some similarities with the Chebyshev polynomials in Eq. (1.1). Moreover, these polynomials appeared in an interesting context of constructing consecutive integers divisible by high powers of their largest prime factors [5,Theorem 4].
The first polynomials P n (x), Q n (x), for 0 ≤ n ≤ 4, are shown in Table 1. This paper is structured as follows. We begin in Sect. 2 by deriving some basic properties of the polynomials P n (x) and Q n (x), including differential equations, recurrence relations, and generating functions. In Sects. 3 and 4 we consider variants of the original questions concerning the identities (1.2) and (1.3); this will involve the Chebyshev polynomials already mentioned in connection with (1.1). In Sects. 5 and 6 we study resultants and discriminants involving the polynomials Q n (x) and their derivatives. In Sect. 7 we introduce a sequence of polynomials related to the sequence Q n (x) and study their properties. Section 8 is devoted to some irreducibility results, and we conclude this paper with a few further remarks and conjectures in Sect. 9. Now the uniqueness of the solutions of (1.3) implies the two identities in (2.1).
As a consequence of (1.3) and (2.1) we immediately get a few special values.
Also, either one of the equations in (2.1), with x = − 1 2 , gives (−1) n+1 P n − 1 2 = Q n − 1 2 . By combining these last two identities we immediately get the third equation in (2.2), and then also the second one.
Another special value will be obtained later in this section. An important consequence of Proposition 2.1 is the fact that it suffices to consider only one of P n and Q n . For the rest of this paper we will therefore concentrate on the polynomial sequence Q n , and begin by deriving an explicit expression. Before proving this representation, we note that the polynomials Q n (x) have an interesting combinatorial interpretation: the ith coefficient of Q n (−x) counts the numbers of lattice paths from (0, 0) to (n, i) using only the steps (1, 0) and (0, 1); see [12, A046899].
Given the simple form of the representation (2.3), it is not surprising that the polynomials Q n (−x) have been considered before. Using (2.3) as definition, Gould [8] derived some basic properties, including the third identity in (2.2) and two more properties relevant to this paper; those will be mentioned later in this section.
Since x n and (x + 1) n are coprime, this last identity implies that x n divides the expression (x + 1)Q n (x) + (n + 1)Q n (x). Consequently, since deg Q n ≤ n, we have for some constant c n . Now we write and equate coefficients of x i on both sides of (2.4). First we have by Corollary 2.2 that q 0,n = Q n (0) = 1, and for i = 0, 1, . . . , n − 1 we have iq i,n + (i + 1)q i+1,n + (n + 1)q i,n = 0, or equivalently By iterating this, we immediately get This with (2.5) completes the proof.
By combining the identities (2.3) and (2.1), we can also obtain an explicit expression for P n (x).

Corollary 2.4
For any integer n ≥ 0 we have deg P n = n, and Proof Combining the first identity in (2.1) with (2.3), we get where we have used the fact that i j = 0 for j > i, and then changed the order of summation. Finally we note that the inner sum in the last expansion is known to have the evaluation 2n+1 n+ j+1 2n n n j ; for instance, after an easy reformulation of the sum, one could use identity (1.48) in [7]. This proves (2.6).

Remark 2.6
As was observed by one of the referees, to get solutions of the equation P(x)x n+1 + Q(x)(1 − x) n+1 = 1, one can use the following alternative approach. From the identity one can observe that that the first term on the right is a polynomial of degree 2n + 1 divisible by x n+1 , and the second term is a polynomial divisible by (1 − x) n+1 . Thus, one can use this observation to obtain explicit forms of the polynomials P, Q we are looking for. Moreover, the integral on the left is just 1/(2n + 1) 2n n , and after multiplication by (2n + 1) 2n n the corresponding polynomials are in Z[x].

Remark 2.7
The polynomial Q n (x) can also be written in terms of a hypergeometric function. Indeed, since (1 + x) −n−1 is the infinite series of which Q n (x) is the nth partial sum, we have however, this representation will not be used further in this paper.
We now return to the identity (2.4) and note that c n = (2n + 1)q n,n = (−1) n (2n + 1) 2n n , so that The following generalization of this identity will be useful later. As usual, Q n (x) will denote the kth derivative of Q n (x).

Proposition 2.8 For integers k and n with
Proof We proceed by induction on k. For k = 1, the identity (2.9) reduces to (2.8). Now we suppose that (2.9) holds for some k ≥ 1, and differentiate both sides with respect to x.
Simplifying the resulting identity, we get which is the same as (2.9) with k replaced by k + 1. This completes the proof by induction.
As a first application of Proposition 2.8 we set x = −1 in (2.10), which gives the following special values.

Corollary 2.9
For integers 0 ≤ k ≤ n we have We note that for k = 0 this last identity is consistent with the right-hand side of (2.7). As another application of Proposition 2.8 we obtain a homogeneous differential equation satisfied by the polynomials Q n (x).

Proposition 2.10
For n ≥ 0 we have (2.12) Proof Using (2.9) with k = 2 and multiply both sides by x, we obtain Then we use (2.9) again, this time with k = 1, and multiply both sides by n, which gives By subtracting this last identity from (2.13), we immediately get (2.12).
Next we present a second-order linear recurrence relation satisfied by the sequence of polynomials Q (k) n (x).

Proposition 2.11
Let k ≥ 0 be an integer, and set Then the polynomials Q (2.14) with initial conditions In the special case k = 0 the expressions u 0,n , v 0,n , w 0,n have the common factor (2x + 1)n(n − 1), and we obtain the following much simpler recurrence relation.

Proof of Proposition 2.11
By differentiating the explicit formula (2.3), we obtain which immediately gives the initial conditions. A straightforward but tedious computation, using (2.16), then shows that the recurrence relation (2.14) is satisfied. We leave the details to the reader.

Remark 2.13
While the above proof would be sufficient, a few words about the discovery of the recurrence relations are perhaps in order. The relation (2.15) was first guessed with the Maple package EKHAD written by D. Zeilberger, which can be obtained through the online supplement to the book [13]. In particular, the procedure findrec, applied to the explicit formula (2.3), gives the second degree difference operator where N is the forward unit shift operator, i.e., N ( f n ) = f n+1 . Replacing N i by Q n+i (x) and then shifting n to n − 2 gives the recurrence relation (2.15). The correctness of Zeilberger's algorithm gives an alternative proof that the recurrence is satisfied for all n. Given this nice result, we suspected that similar relations should hold also for the kth derivative of the polynomials Q n+k (x). We checked that for each fixed small k we have a formula similar to (2.15), and then guessed the general form (2.14) from the particular cases.
At this point it should also be mentioned that Gould [8] derived a first-order inhomogeneous recurrence relation for Q n (−x); in our notation, it can be written as This identity was then used in [8] to obtain the following generating function. For the sake of completeness we give a different proof, based on Corollary 2.12.
Proposition 2.14 The ordinary generating function for the polynomials Q n (x) is given by (2.17) Proof We denote the expression on the right of (2.17) by Q(x, t), and let Q (x, t) be the derivative with respect to t. Then we easily obtain the identities We now use these identities and apply standard methods to transform the recurrence relation (2.14), with n replaced by n + 2, into the differential equation Using standard methods for solving first-degree linear differential equations, we get the general solution The initial condition Q (x, 0) = 1 leads to c 1 = 1 2 (2x + 1), and we get the desired solution Finally, we obtain (2.17) by multiplying numerator and denominator of this last equation by √ 1 + 4xt.

A Pell-type polynomial equation
In this section and the next we will consider, more generally, the equation for integers n ≥ 0 and unknown polynomials Y , Z ∈ Q[x]. We began this paper from the point of view of fixed polynomials Y (x) = x and Z (x) = x + 1; with the conditions deg P n ≤ n, deg Q n ≤ n this had led us to the unique polynomial sequences P n , Q n in Sects. 1 and 2. We now ask the following "inverse question": given our polynomials P n , Q n , what can we say about polynomial solutions Y , Z of (3.1)? Are there solutions other than It turns out that the case n = 1 is of particular interest, and is very different from the case n ≥ 2. This section will be devoted to this special case; that is, since P 1 (x) = 2x + 3 and Q 1 (x) = 1 − 2x, we consider the equation Proposition 3.1 The Eq. (3.2) has infinitely many solutions which, for n ≥ 0, are given by where U n (y) are the Chebyshev polynomials of the second kind. Furthermore, for n ≥ 1 we have the recurrence relations We transform the Eq. (3.2) to a Pell-type equation by multiplying both sides by 2x + 3. Noting that we then get the equation We now use the following known results from the theory of Pell equations; see, e.g., [11, p. 354] for the case of Pell equations over Z, and [10] for the case of Pell equations over Suppose that (P, Q) = (r 0 , s 0 ) is a solution of the Pell-type equation , and d is not a perfect square of a polynomial with rational coefficients. Furthermore, suppose that (P, Q) = (P n , Q n ), n = 1, 2, 3, . . ., are the solutions of the Pell equation Then the pairs (r n , s n ), defined by are also solutions of (3.6). We note that the Eqs. (3.6), (3.7) may or may not have solutions in Z[x]. By expanding the right-hand side of (3.8) and equating rational and irrational terms, we immediately get Furthermore, comparing (3.5) (having 1 instead of 2x + 3 on the right) with (1.1) (or just invoking [10, Theorem 2]), we see that This holds also for n = 0 since T 0 (y) = 1 and, by convention, U −1 (y) = 0. Finally, with r n = (2x + 3)Y (x) and s n = 2Z (x), the identities (3.9), (3.10), (3.11) yield (3.12) The initial conditions following (3.4) can be computed from (3.12), using T 0 (y) = U 0 (y) = 1 and T 1 (y) = y. Furthermore, the well-known recurrence relation for the Chebyshev polyno- with the same relation also for the sequence U n x + 1 2 . This means that the polynomial sequences Y n (x) and Z n (x) in (3.12) satisfy this relation as well.
Finally, using the same argument as in the previous paragraph, we see that the right-hand sides of the expressions in (3.3) satisfy (3.4) as well. Using the fact that U 1 (y) = 2y and U 2 (y) = 4y 2 − 1, we can easily verify that the terms on the right in (3.3) also satisfy the initial conditions following (3.4). This proves the identities in (3.3), and the proof of the the proposition is complete.
We can now use Proposition 3.1 to show that the polynomials Y n and Z n are "almost in Z[x]", in the following sense.
Proof We first note that Y n and Z n satisfy all three statements for n = 0 and n = 1. Next, the coefficient 2x + 1 in the recurrence relations (3.4) guarantees that by induction on n we have that all coefficients of all Y n , Z n , with the possible exception of the constant coefficients, are integers. Finally, it is clear from (3.4) that the constant coefficients of Y n satisfy the recurrence relation Y n+1 (0) = Y n (0) − Y n−1 (0), and similarly for the sequence Z n . Part (c) then follows from a simple induction, and the remaining statements in (a) and (b) also follow.
We observe in Table 2 that both Y 3 (x) and Z 3 (x) are reducible. Further computations show that this seems to be the case for all Y 3n (x) and Z 3n (x), a fact confirmed by the following result.

Proposition 3.3 For all integers n
Proof In view of (3.3), the first identity in (3.13) is equivalent to We now use the well-known identity (see, e.g., [15]), and set j = 2n + 1, k = 0 and note that U 0 (y) = 1. With this, the right-hand side of (3.14) becomes where in the second equation above we have used (3.15) two more times. This proves (3.14) For the second part of (3.13), we replace y by −y in (3.14) and use the symmetry property U n (−y) = (−1) n U n (y). Then we get

Multiplying both sides by
which is equivalent to the desired identity.
By iterating the factorizations on the right of (3.13), we obtain the following consequence.
Proof By (3.13) it suffices to show that U n (y) ± U n−1 (y) have at least k + 1 nonconstant factors when n = v(k, m). We fix an m ≥ 1 and prove this statement by induction on k. When k = 0, then v(0, m) = m, and the statement is trivially true. Suppose now that U v(k,m) (y) ± U v(k,m)−1 (y) have at least k + 1 nonconstant factors. Since v(k + 1, m) = 3v(k, m) + 1, by (3.14), resp. (3.16), we get at least one more irreducible factor in each of the two cases, which completes the proof.

The Eq. (3.1) in general
In this section we return to the question posed at the beginning of Sect. 3. The following result deals with the general case. As before, P n and Q n denote the polynomials studied in Sects. 1 and 2 , and given by the explicit formulas (2.3) and (2.6).

Proposition 4.1 Let n ≥ 1 be an integer, and consider the Diophantine equation
where ζ and ξ are arbitrary (n + 1)th roots of unity.
Proof We invoke the Mason-Stothers theorem, which says that the equality For a given f ∈ Q[x], the number N 0 ( f ) is just the number of different roots of the polynomial f ; see [17]. We put A = P n Y n+1 , B = Q n Z n+1 , C = 1, and u = deg Y = deg Z . Thus, from the Mason-Stothers theorem we deduce the inequality This last inequality holds only in the following cases: The case (1) was covered by Proposition 3.1, and leads to part (a) of this proposition. We therefore continue with deg Y = deg Z = 0 and set Y = a and Z = b with a, b ∈ C. Then (4.1) becomes We write the expressions (2.6) and (2.3) more explicitly as To deal with case (3), we set Y (x) = ax + c and Z (x) = bx + d. Then (4.1) becomes P n (x) a n+1 x n+1 + (n + 1)a n cx n + · · · + Q n (x) b n+1 x n+1 + (n + 1)b n dx n + · · · = 1, (4.4) where n ≥ 2. First we equate coefficients of x 2n+1 in (4.4), using (4.3). This gives Similarly, equating coefficients of x 2n in (4.4), we get n + 1 2 a n+1 + (n + 1)a n c + 1 2 b n+1 − (n + 1)b n d = 0. We now multiply both sides of this last identity by b, use (4.5), and divide everything by (n + 1)a n . This gives Next we show that c = 0. To do so, we set x = 0 in (4.1) and use the value of P(0) given in Remark 2.5, along with the fact that Q n (0) = 1 (see Corollary 2.2). Then we have First, with n = 2 and n = 5, this gives Then for each integer n ≥ 1 there are polynomials p n , q n ∈ Z[x] such that (4.9) holds.
Proof We use the identity P n (x)x n+1 +Q n (x)(x+1) n+1 = 1. If we replace x by − p 0 (x)Y (x), then by (4.10) 1 + x is replaced by 1 − p 0 (x)Y (x) = q 0 (x)Z (x), and we obtain the desired identity , and the proof is complete. We were unable to solve this equation. However, we can show that (4.11) has infinitely many solutions. Indeed, if m ≥ 2 and n = rm − 1, then Y (x) = ζ x r , Z (x) = ξ(x + 1) r are solutions of (4.11), where ζ , ξ are arbitrary mth roots of unity. Here we have that n > m, and this is no coincidence. Indeed, let us assume m ≥ 3 and differentiate (4.11) with respect to x. Then we see that the polynomials Y , Z satisfy the conditions As a consequence we get the inequalities

The discriminant of Q (k) n (x)
One of the most important invariants of a polynomial is its discriminant. Since we already noted certain similarities between our polynomials P n (x), Q n (x) and the Chebyshev polynomials, we mention the fairly recent papers [3,6,16,18,19] which have dealt with discriminants of Chebyshev-like polynomials.
We begin with recalling the definition of the discriminant. Given a polynomial f (x) = a m x m + · · · + a 1 x + a 0 ∈ Q[x] with a m = 0, the discriminant of f is usually defined by where f is the derivative of f and R( f , f ) is the resultant of f and f which, among other equivalent definitions, can be given by Here θ i ∈ C is the ith root of f (x). It follows from (5.1) and (5.2) that Disc( f ) = 0 if and only if f has multiple roots, which is a key property of the discriminant. An alternative definition of the resultant involves a determinant (the Sylvester determinant) whose entries consist only of the coefficients of the two polynomials involved. This implies that The following is the main result of this section. As in Sect. 2, we let Q

Theorem 5.1 For all integers n > k ≥ 0 we have
where ε := (n − k)(n − k − 1)/2. In particular, for n ≥ 1, n (x). Then we obtain from (2.10), and thus by (5.2) we have where we have used (5.5) in the second equation. The leading coefficient (5.6) means that we can write Next, with x = −1 in (5.8) and using the identity (2.11), we get Combining (5.9) and (5.10) with (5.7), we obtain This, with (5.1) and the coefficient (5.6), gives us with ε as defined in the statement of the theorem. This last identity immediately implies (5.2), and by setting k = 0 we get (5.4).
We briefly turn our attention to the companion polynomial of Q n (x), namely P n (x), and prove the following result.

Corollary 5.2 For all integers n > k ≥ 0 we have
Proof For a polynomial f of degree n it was shown in [3,Lemma 4.3] that where a, b, c are constants. We apply these identities to which follows from (2.1). Hence we have a = −1 and c = ±1, and since both exponents are even, we immediately get (5.11).
Knowledge of the discriminant of a polynomial is often important for determining the polynomial's Galois group. In particular, it is known that if the discriminant is the square of a nonzero integer, then the Galois group is a subgroup of the alternating group A n ; see, e.g., [4, p. 611]. It is therefore of interest to find square discriminants. (a) If n ≡ k + 2 or k + 3 (mod 4), then D k,n is not the square of an integer. (b) If n ≡ k + 1 (mod 4), then for a given k, D k,n is a square for at most finitely many n. (c) If n ≡ k (mod 4), then for each k there are infinitely many n such that D k,n is a square. (d) In particular, D 0,n is a square if and only if n = 1 or n = n j , where is a square. However, the prime number theorem implies that for a fixed k and for n sufficiently large, there is always a prime among the members of the sequence n+k+2, n+k+3, . . . , 2n− 1; this means that (5.13) cannot be a square for these k and n, which proves part (b). (c) If n − k ≡ 0 (mod 4), then n − k − 2 is even, and according to (5.3) we consider where the equality is easily seen by writing the binomial coefficients on the left in terms of factorials. This now implies that D k,n is a square if and only if (n + k + 1)(2n + 1) is s square. If we set n = 4m + k, where m is a positive integer, we can write for some integer Y ≥ 1. We can write this in the equivalent form where X = 16m + 6k + 3. The Eq. (5.14) is a Pell-type equation, and using standard methods for solving such equations (see, e.g., [11,Sect. 7.8]), we find that X = X j , where X 1 = 3(2k + 1), X 2 = 17(2k + 1), and X j = 6X j−1 − X j−2 for j ≥ 3. From the theory of linear recurrence relations we get the Binet-type formula We require X j ≡ 6k + 3 (mod 16), and an easy calculation shows that this holds if and only if j is odd. The corresponding n that makes D k,n square is then which proves part (c).
(d) For k = 0, together with (5.15), this last identity gives (5.12). To complete the proof, we first note that in the case k = 0 the theory of Pell equations tells us that all solutions of (5.14) are given by (5.15). Returning to part (b) in the case k = 0, we see that by (5.4) we have D 0,1 = 1. Finally, considering again (5.13), there is a prime in the sequence n + 2, n + 3, . . . , 2n − 1; this follows by Bertrand's Postulate (itself a consequence of the Prime Number Theorem) and the fact that in this case n + 1 and 2n cannot be prime. The proof is now complete. (b) The statement of part (b) of Corollary 5.4 can be made more explicit by using the following result of Nagura [9]: For x ≥ 25 there is always a prime p with x < p < 6 5 x. Setting x = n + k + 1, an easy calculation shows that whenever n > 3 2 (k + 1), at least one of the integers n + k + 2, . . . , 2n − 1 is a prime. This implies that D k,n is not a square when n ≡ k + 1 (mod 4) and n > 3 2 (k + 1). The small cases corresponding to x < 25 can be eliminated by direct computation. In fact, using the above limit, we verified computationally that D k,n is not a square for any 0 ≤ k ≤ 5000 and n ≡ k + 1 (mod 4). The constant 3/2 in the above bound could be lowered by using later improvements of Nagura's result, however at the cost of a higher bound than Nagura's x ≥ 25.

Resultants involving Q (k) n+k (x)
In the previous section we determined the discriminants, that is, resultants of a polynomial and its derivative. We will now see that the resultant of two consecutive polynomials in our sequence Q n (x) has a particularly easy form. This result is a consequence of the following theorem. For greater ease of notation, we set Theorem 6.2 Let k ≥ 0 be a fixed integer. Then we have For k = 0, the identity (6.2) reduces to where we have used Corollary 2.2 for the second equation. We have thus shown that Theorem 6.1 follows from Theorem 6.2. Before proving Theorem 6.2, we summarize some useful properties of the resultant. See [3,Sect. 4] for these and more, including references. Suppose we have the following two polynomials: Assuming the variable x, and that the resultant is taken with respect to x, the following properties hold: where p and q are arbitrary polynomials in x. Next, if a is a constant and g is a polynomial then, unless a = g = 0, we have Finally, we require the following lemma, which can be found as Lemma 4.1 in [3] or, with a different normalization, in [14, p. 58].
with polynomials q, r and ν := deg r, then r ). (6.8) Proof of Theorem 6. 2 We fix k ≥ 0, and to simplify notation we set n+k (x) and n := k,n .
As an immediate consequence of Theorem 6.2 we obtain the following result. Our next result, which is rather surprising, but is easy to prove, is similar in nature to Theorem 6.1. Now, by (6.7) we have R(Q n , 1) = 1, and with (6.6), (6.5) and (6.4) we get R Q n , P n x n+1 = R(Q n , P n ) · R Q n , x n+1 = R(Q n , P n ) · R x n+1 , Q n = R(Q n , P n ) · 1.

The polynomial Q n (−x) 2 − Q n−1 (−x)Q n+1 (−x)
Returning to the occasional comparisons we made between the polynomials P n (x), Q n (x) and the Chebyshev polynomials of both kinds, we recall the well-known 2 × 2 Hankel determinant expressions valid for all integers n ≥ 1; see, e.g., [15, p. 40]. This immediately gives rise to the question of what can be said about analogous expressions for the polynomials Q n (x). For reasons of simplicity we consider Q n (−x) instead; the first few 2 × 2 Hankel determinant expressions, factored over Q, are listed in Table 3.
The above table strongly suggest that (1 − 2x), where c n ∈ Z is a constant depending on n, and the co-factor has degree n − 1 and has positive coefficients. Moreover, it also seems that the sequence of coefficients of the co-factor forms a unimodal sequence. In this section we will show that these properties are true in general. We start with the following.
Then the sequence of polynomials V n (x) satisfies the following recurrence relation: V 1 (x) = 2, V 2 (x) = 2x + 3, and for n ≥ 3 we have Proof The recurrence relation was guessed with the help of EKHAD (see Remark 2.13), which showed that the recurrence holds for all n ≤ 25. The proof of correctness for all n is a straightforward but tedious induction using the recurrence relation satisfied by the polynomials Q n (−x). We omit the details.

Theorem 7.2 For integers n ≥ 1 we have
Proof Following along the lines of the expressions for a 0,n , . . . , a 3,n above, it is easy to obtain experimentally a few more cases and then conjecture the form of the coefficients on the right-hand side of (7.4). It can now be verified in a tedious but straightforward way that the right-hand side of (7.4) satisfies the recurrence relation (7.2). Since (7.4) also clearly gives V 1 (x) = 2 and V 2 (x) = 2x + 3, this proves the theorem.
Using Theorem 7.2, we can easily obtain some properties of the polynomials V n (x). The first one is as follows. Proof Positivity of the coefficients is clear from (7.4). Now, using the notation of (7.3), we rewrite the coefficients as The fraction on the right of (7.5) is an integer except when k | n. But in this case we have k | (n − k), so that in either case a k,n is an integer.

Remark 7.4
In the above proof of Corollary 7.3 we actually showed a bit more, namely that a k,n /(n + 1 − k) is an integer for all n ≥ 1 and 0 ≤ k ≤ n − 1.
As another easy consequence of Theorem 7.2 and Proposition 7.1 we get some special values of V n (x).

Corollary 7.5 For all integers n ≥ 1 we have
where C n is the nth Catalan number.
Proof The first identity follows immediately from (7.4). For the second and third identities we substitute x = 1 2 and x = 1 into (7.2), getting the recurrence relations respectively. The two identities are then obtained by easy inductions.
Next we prove the second observation we made following Table 3. Recall that a polynomial n i=0 a i x i is called unimodal if and only if the sequence of its coefficients is unimodal, that is, if there is an integer m (called the mode) with 0 ≤ m ≤ n, such that a 0 ≤ a 1 ≤ · · · ≤ a m−1 ≤ a m ≥ a m+1 ≥ · · · ≥ a n .
We now state and prove the following result. Theorem 7.6 For every integer n ≥ 1, the polynomial V n (x) is unimodal. More precisely, with the notation (7.3) we have a 0,n < a 1,n < · · · < a n−3,n < a n−2,n > a n−1,n .
Proof Recall that V 1 (x) = 2 and V 2 (x) = 3 + 2x. While for n = 1 there is nothing to prove, the statement is clearly true for n = 2. In what follows we therefore assume that n ≥ 3. First, using (7.3) and (7.4), we get a n−2,n a n−1,n = 6 n 2n−3 n−2 2 n 2n−2 n−1 where the second equation is easy to verify. Next, for each k with 1 ≤ k ≤ n −2, we consider It remains to show that this quotient is greater than 1, which is equivalent to (n − k)(n + k − 1) > k(n − k + 2). After an easy manipulation we see that this, in turn, is equivalent to k(n +1) < n 2 −n. But this is true for all 1 ≤ k ≤ n −2 since the "worst case" k = n −2 leads to the inequality (n − 2)(n + 1) < n 2 − n, which is clearly true. Thus we have a k−1,n < a k,n for all 1 ≤ k ≤ n − 2 and n ≥ 3, which completes the proof.
In analogy to Sect. 2, we can also obtain a generating function for the sequence of polynomials V n (x).

Theorem 7.7 Let
be the ordinary generating function for the sequence (V n (x)) n . Then Proof We use the same approach as in the proof of Proposition 2.14. Indeed, differentiating both sides of (7.3) with respect to t, manipulating the resulting series as we did in the proof of Proposition 2.14 and using the recurrence relation (7.2), we get the differential equation Using standard method of solving linear differential equations of degree 1 we easily get the general solution The initial condition V(x, 0) = 0 leads to c 1 = 1 2 (1 − 2x), which finally gives the desired solution (7.4).
We note that there are certain similarities between the generating functions (2.17) and (7.7). In fact, they are related through an identity involving partial derivatives. It can be verified through direct computation.

Remark 7.9
The identity (7.8), along with the explicit formula (2.3) for Q n (x), can be used to give an alternative proof of the explicit formula (7.4) for the polynomial V n (x). We leave the details to the interested reader.
To conclude this section, we return to the original expression of the title, which we denote by The first few of these polynomials are listed in Table 4.
The following properties of the polynomials W n (x) are an immediate consequence of (7.1) and Theorem 7.2.
To motivate the last result of this section, we consider the entry for n = 4 in Table 4 and note that This is actually no surprise since by (7.1) we have W n ( 1 2 ) = 0 for all n ≥ 1 and thus, by (7.9) we have n j=1 w n+ j,n 2 − j = −w n,n = − 1 2 2n n (n ≥ 1). (7.11) This identity is a special case of the following result.
Proof of Proposition 7. 11 We first prove the identity where the left equation comes from (7.9). To do so, we denote the right-most term of (7.13) by R n (x) and manipulate the double sum as follows: where we have combined the first and third sum from the second-last line. The second sum in the last line then vanishes since W n 1 2 = 0 for all n ≥ 0, and the proof of (7.13) is complete. Now we rewrite (7.1), with (7.9), as 1 2(n + 1) Finally, using (7.4) and equating coefficients of x i , 0 ≤ i ≤ n − 1, we get (7.12).

Some irreducibility results
In this brief section we prove some irreducibility results for the main objects of study in this paper, namely the polynomials Q n (x) and their derivatives, and the polynomials V n (x). n (x) is irreducible over Q when n + k + 1 is a prime, or when 2n + 1 is a prime.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.