Abstract
First, we prove that the Diophantine system
has infinitely many integer solutions for \(f(X)=X(X+a)\) with nonzero integers \(a\equiv 0,1,4\pmod {5}\). Second, we show that the above Diophantine system has an integer parametric solution for \(f(X)=X(X+a)\) with nonzero integers a, if there are integers m, n, k such that
where \(k\equiv 0\pmod {4}\) when a is even, and \(k\equiv 2\pmod {4}\) when a is odd. Third, we get that the Diophantine system
has a five-parameter rational solution for \(f(X)=X(X+a)\) with nonzero rational number a and infinitely many nontrivial rational parametric solutions for \(f(X)=X(X+a)(X+b)\) with nonzero integers a, b and \(a\ne b\). Finally, we raise some related questions.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The kth n-gonal number is given by
For \(n=3\), \(P^3_k=k(k+1)/2\) are called triangular numbers. In 1968, Sierpiński [14] showed that there are infinitely many triangular numbers which at the same time can be written as the sum, difference, and product of other triangular numbers. For \(n=4\), \(P^4_k=k^2\), it is easy to show that \((4m^2 + 1)^2\) is the sum, difference, and product of squares (see [1]), from the identify \((4m^2+1)^2=(4m)^2+(4m^2-1)^2=(8m^4+4m^2 + 1)^2-(8m^4+4m^2)^2\) and there are infinitely many composite numbers of the form \(4m^2+1\) (for example, if \(m=5j+1\), \(4m^2+1\) is divisible by 5). In 1986, Hirose [10] proved that for \(n=5,6,8\), there are infinitely many n-gonal numbers which at the same time can be written as the sum, difference, and product of other n-gonal numbers. The cases with \(n=7\) and \(n\ge 9\) are still open.
Some authors proved similar results for the sum and the difference only, such as Hansen [8] for \(n=5\), O\('\)Donnell [11, 12] in cases of \(n=6,8\), Hindin [9] for \(n=7\), and Ando [1] in the general case. In 1982, Eggan et al. [7] showed that for every n there are infinitely many n-gonal numbers that can be written as the product of two other n-gonal numbers. In 2003, Beardon [2] studied the integer solutions (n, a, b, c, d) of the Diophantine system
where P is a quadratic polynomial with integer coefficients. Some related information on n-gonal numbers could be found in [6, p.1–p.39].
The Diophantine equations about the product or sum of two other polynomials were studied by many authors, we can refer to [15,16,17,18,19,20,21,22] and the references in there.
A natural question is to consider the integer solutions of the Diophantine system
where f(X) is a polynomial with rational coefficients and \(\deg {f}\ge 2\).
By the theory of Pellian equation, we have the following result.
Theorem 1.1
For \(f(X)=X(X+a)\) with nonzero integers \(a\equiv 0,1,4\pmod {5}\), Diophantine system (1.1) has infinitely many integer solutions (z, x, y, u, v, p, q).
By the method of Theorem 1.1, we can get the same result for \(a=2,3\) (see Remark 2.2), but we couldn’t give a complete proof for the cases \(a\equiv 2,3\pmod {5}\). Motivated by the solutions of Theorem 1.1, we obtain the following result by the method of undetermined coefficients.
Theorem 1.2
For \(f(X)=X(X+a)\) with nonzero integers a, if there are integers m, n, k such that
where \(k\equiv 0\pmod {4}\) when a is even, and \(k\equiv 2\pmod {4}\) when a is odd. Then Diophantine system (1.1) has an integer parametric solution.
By some computer-aided computation, for \(1\le a\le 100\) we can find integers m, n, k satisfying the above congruences. It seems that for any given nonzero integer a, there exists such integers m, n, k. However, we cannot prove it.
To study the integer solutions of Diophantine system (1.1) seems difficult for general polynomials f(X) with \(\deg {f}\ge 3\), so we turn to consider the rational parametric solutions of the Diophantine system
For reducible quadratic polynomials we prove the following statement.
Theorem 1.3
For \(f(X)=X(X+a)\) with nonzero rational number a, Diophantine system (1.2) has a five-parameter rational solution.
For reducible cubic polynomials, by the theory of elliptic curves, we have:
Theorem 1.4
For \(f(X)=X(X+a)(X+b)\) with nonzero integers a, b and \(a\ne b\), Diophantine system (1.2) has infinitely many rational parametric solutions.
2 The proofs of theorems
Proof of Theorem 1.1
(1) The cases \(a\equiv 0,1\pmod {5}\). Let us start with the equation \(f(z) = f(p)f(q)\), where \(f(X)=X(X+a)\). We can use the Runge’s method [13] to study the integer solutions of it. Write \(q = p + k\) for some integer k, then we obtain
The polynomial part of the Puiseux expansion of
is given by \(2p^2+2(a+k)p+ak.\) If there exists a large integer solution, then
We get in this case that \(a^2(k+1)(k-1) = 0\), that is \(k= \pm 1.\) Hence, \(q = p\pm 1.\) If \(k= 1,\) then we obtain the solutions \(z = p^2 + (a+ 1)p,\) or \(-p^2+(-a-1)p-a.\) If \(k=-1,\) then we get \(z = p^2 + (a-1)p-a,\) or \(-p^2+(-a+1)p.\)
Let us deal with the equation \(f(z) = f(x)+f(y)\), where \(z = p^2+(a+1)p\) (we only consider this solution, the other should work in a similar way). We obtain
Take \(y = x + b\) for some integer b. It follows that
Let \(X=2(p^2 + (a + 1)p) + a, Y=2x + a + b\), we get the Pellian equation
It is easy to provide infinitely many integer solutions by the formula
When \(m = 0\), it yields the trivial solution with \(x = 0\). When \(m = 1\), we get
then \(x = 2a + 3b\) and
Here b need to be an integer, which is in the cases when \(a\equiv 0\pmod {5}, p\equiv 0,4\pmod {5}\), or \(a\equiv 1 \pmod {5}, p\equiv 1,2 \pmod {5}\).
Up to now we constructed infinitely many integer solutions of the equations
so it remains to consider the case \(f(z) = f(u)-f(v)\), where \(z = p^2+(a+1)p\). Let \(v = u-c\) for some integer c. Then \(f(z) =c(2u+a-c)\), a linear equation in u. Hence,
As a solution, fix \(p= 2c\) and we obtain
According to the other variables we have
To get integral values of x, y, u, v, we need the following conditions:
and
(i) Case \(a\equiv 0\pmod {5}, p\equiv 0,4\pmod {5}\). From the second condition we have
From the first condition we get
and
For \(a\equiv 0\pmod {10}\), take \(c=10t,\) or \(10t+2\), where t is an integer parameter, we have
For \(a\equiv 5\pmod {10}\), put \(c=10t+5\), or \(10t+7\), we get
(ii) Case \(a\equiv 1\pmod {5}\), \(p\equiv 1,2 \pmod {5}\). From the second condition we have
As above, for \(a\equiv 1\pmod {10}\), take \(c=10t+1,\) or \(10t+3\), where t is an integer parameter, we have
For \(a\equiv 6\pmod {10}\), put \(c=10t+6,\) or \(10t+8\), we get
(2) Case \(a\equiv 4\pmod {5}\). Let us note that Pellian equation (2.1) has another family of integer solutions
When \(m = 1\), we get
then \(x =-3a + 3b\) and
Here b need to be an integer, which is in the cases when \(a\equiv 0\pmod {5}\), \(p\equiv 0,4 \pmod {5}\), or \(a\equiv 4\pmod {5}\), \(p\equiv 2,3 \pmod {5}\). We only consider the case \(a\equiv 4\pmod {5}\) in the following.
As in part (1), taking \(p=2c-1\) in \(z =p^2+(a+1)p\) gives
To get integral values of x, y, u, v, we need the conditions
and
If \(a\equiv 4\pmod {5}, p\equiv 2,3 \pmod {5}\), from the second condition we have
As above, we can take \(c=10t+2,\) or \(10t+4\) for \(a\equiv 4\pmod {10}\), and \(c=10t+7,\) or \(10t+9\) for \(a\equiv 9\pmod {10}\), where t is an integer parameter.
Combining (1) and (2) completes the proof of Theorem 1.1. \(\square \)
Example 2.1
When \(a = 1\), \(c=10t+1\), then for \(f(X)=X(X+1)\) Diophantine system (1.1) has an integer parameter solution:
where t is an integer parameter. There are solutions not covered by the above solutions, such as
It seems to be difficult to determine the complete integer solutions of Diophantine system (1.1) for \(f(X)=X(X+a)\) with fixed a.
Remark 2.2
It’s worth to note that we have other possibilities to obtain integer solutions if \(a\not \equiv 0,1,4\pmod {5}\). When we apply the same idea using the other family of solutions with \(z =-p^2+(-a-1)p-a,~p^2 + (a-1)p-a,\) or \(-p^2+(-a+1)p\) for \(m=1,\) we do not obtain new cases of solutions.
To cover more classes one has to go in these directions. When \(m=2,\) from formula (2.2), we have
then \(x=14a+20b\) and
To make b be an integer, we get
As in Theorem 1.1, fix \(p= 2c\) in \(z =p^2+(a+1)p\) and we obtain
To get integral values of x, y, u, v, we need the following conditions:
and
For \(a=2\), take \(c=58t+46,\) or \(58t+54\), then
For \(a=3\), take \(c=58t+3,\) or \(58t+53\), then
Similar congruences can be obtained for other values of m, and combining these systems via the Chinese remainder theorem would cover almost all classes. However, it seems difficult to cover all integers \(a\equiv 2,3\pmod {5}\).
Note that Pellian equation (2.1) has integer solutions given by
which including formulas (2.2) and (2.3). When \(m=1,2,3,4,5\), by applying the method of proof of Theorem 1.1 we are not able to handle the case \(a=83\) in the range \(1\le a \le 100\). However, we can show that the approach of Theorem 1.2 solves this case in Example 2.3.
We try to generalize the formulas obtained in Example 2.1 and give the proof of Theorem 1.2.
Proof of Theorem 1.2
First, we study the equation \(f(z)=f(p)f(q)\) for \(f(X)=X(X+a).\) Take
then we have
Second, we consider the equation \(f(z)=f(u)-f(v).\) Let
then
To determinate the coefficients of u, v, by the method of undetermined coefficients, we obtain
In order to find a solution of (2.4), let \(B=A^3, E-G=\frac{k}{2},\) then
Put B, F, G into (2.4), and solve it for C, D, E, we get
Hence,
At last, we study the equation \(f(z)=f(x)+f(y).\) Put
then
To determinate the coefficients of x, y, by the method of undetermined coefficients, we obtain
Solve the first equation of (2.5), we get an integer parametric solution
where \(n>m\) are integer parameters. Take A, H, K into the second, third and fourth equations of (2.5), and solve them for I, L, M, then
Put M into the firth equation of (2.5), we have
Hence,
So
According to the other variables, we have
To get integral values of x, y, u, v, we can take \(t=4(n^2+m^2)T\), where T is an integer parameter, \(k\equiv 0\pmod {4}\) when a is even, and \(k\equiv 2\pmod {4}\) when a is odd and get the following congruence conditions:
This completes the proof of Theorem 1.2. \(\square \)
Example 2.3
When \(a=83\), \(f(X)=X(X+83)\), take \((m,n)=(1,9),\)\(t=328T, k=4k_1+2\), then we have the conditions:
Solve these two congruences, we obtain
Then
If we set \(k=6724S+478,\) where S is an integer parameter, then for \(f(X)=X(X+83)\) Diophantine system (1.1) has an integer parametric solution:
By the parametrization of quadratic equation, we give the proof of Theorem 1.3 in the following.
Proof of Theorem 1.3
For \(f(X)=X(X+a)\), let \(z=T\), the first equation of Diophantine system (1.2) reduces to
This can be parameterized by
where k is a rational parameter.
From \(T(T+a)=u(u+a)-v(v+a),\) we get
where t is a rational parameter.
For \(T(T+a)=p(p+a)q(q+a)\), put \(p=wT\), then
where w is a rational parameter.
Take \(s=mr,\) from
we obtain
where m is a rational parameter.
Put
into x, y, u, v, r, s, then Diophantine system (1.2) has a five-parameter rational solution. \(\square \)
By the theory of elliptic curves, we provide the proof of Theorem 1.4.
Proof of Theorem 1.4
To prove this theorem, we need to consider four Diophantine equations. The first one is
Let \(z=T,\) and consider (2.6) as a cubic curve with variables x, y:
By the method described in [4, p. 477], using Magma [3], \(C_1\) is birationally equivalent to the elliptic curve
The map \(\varphi _1: C_1\rightarrow E_1\) is
and its inverse map \(\varphi _1^{-1}: E_1\rightarrow C_1\) is
The discriminant of \(E_1\) is nonzero as an element of \({\mathbb {Q}}(T)\), then \(E_1\) is smooth.
Note that the point \((x,y)=(0,T)\) lies on \(C_1\), by the map \(\varphi _1\), the corresponding point on \(E_1\) is
By the group law, we have
An easy computation reveals that the remainder of the division of the numerator by the denominator of the X-th coordinate of [2]W with respect to T is equal to
and thus is nonzero as an element of \({\mathbb {Q}}(T)\) provided \(ab\ne 0\). By a generalization of Nagell–Lutz theorem (see [5, p.268]), [2]W is of infinite order on \(E_1\), then there are infinitely many \({\mathbb {Q}}(T)\)-rational points on \(E_1\).
For \(m=2,3,\ldots ,\) compute the points [m]W on \(E_1\), next calculate the corresponding point \(\varphi _1^{-1}([m]W) = (x_m, y_m)\) on \(C_1\). Then we get infinitely many \({\mathbb {Q}}(T)\)-rational solutions (x, y) of (2.6).
The second one is
Take \(z=T,\) and consider (2.7) as a cubic curve with variables u, v:
As (2.6), \(C_2\) is birationally equivalent with the elliptic curve
The map \(\varphi _2: C_2\rightarrow E_2\) is
and its inverse map \(\varphi _2^{-1}: E_2\rightarrow C_2\) is
The discriminant of \(E_2\) is nonzero as an element of \({\mathbb {Q}}(T)\), then \(E_2\) is smooth.
It is easy to see that the point \((u,v)=(T,0)\) lies on \(C_2\), by the map \(\varphi _2\), the corresponding point on \(E_2\) is
By the group law, we get
Using the same method as above, there are infinitely many \({\mathbb {Q}}(T)\)-rational solutions (u, v) of (2.7).
The third one is
Put \(z=T\), \( q(q+a)(q+b)=Q\) and consider (2.8) as a cubic curve with variables T, p:
As (2.6), \(C_3\) is birationally equivalent to the elliptic curve
Because the map \(\varphi _3: C_3\rightarrow E_3\) is complicated, we omit it. The discriminant of \(E_3\) is nonzero as an element of \({\mathbb {Q}}(Q)\), then \(E_3\) is smooth.
Note that the point \((T,p)=(-a,-a)\) lies on \(C_3\), by the map \(\varphi _3\), the corresponding point on \(E_3\) is
By the group law, we get
Using the same method as above, we have infinitely many \({\mathbb {Q}}(Q)\)-rational solutions (T, p) of (2.8).
The last one is
Let \(z=T,\) and put \(t=T(T+a)(T+b)\). By (2.8), there are infinitely many \({\mathbb {Q}}(t)\)-rational solutions (r, s) of (2.9). This completes the proof of Theorem 1.4. \(\square \)
3 Some related questions
In 1986, Hirose [10] conjectured that for \(n\ne 4\) if \((n-2)P^n_k-(n-4)=2P^n_l\), then \(P^n_{P^n_k}=P^n_kP^n_l\) can be expressed as the sum and difference of two other n-gonal numbers. It is difficult to prove it. Following this idea, for \(n=12,\) we find an example:
For general n-gonal numbers, the following question is still open.
Question 3.1
Are there infinitely many n-gonal numbers, except \(n=3,4,5,6,8\), which at the same time can be written as the sum, difference, and product of other n-gonal numbers?
In Theorem 1.1, we give infinitely many quadratic polynomials \(f(X)\in {\mathbb {Q}}[X]\) such that Diophantine system (1.1) has infinitely many integer solutions, but it seems difficult to solve the following question.
Question 3.2
Does there exist a polynomial \(f(X)\in {\mathbb {Q}}[X]\) with \(\deg {f}\ge 3\) such that Diophantine system (1.1) or (1.2) has infinitely many integer solutions?
For polynomials \(f(X)\in {\mathbb {Q}}[X]\) with \(\deg {f}\ge 4\), we have
Question 3.3
Does there exist a polynomial \(f(X)\in {\mathbb {Q}}[X]\) with \(\deg {f}\ge 4\) such that Diophantine system (1.1) or (1.2) has a nontrivial rational solution?
References
S. Ando, A note on polygonal numbers. Fibonacci Q. 19, 180–183 (1981)
A. Beardon, Sums and differences of values of a quadratic polynomial. Fibonacci Q. 41, 372–373 (2003)
W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235–265 (1997)
H. Cohen, Number Theory, Vol. I: Tools and Diophantine Equations, Graduate Texts in Mathematics (Springer, New York, 2007)
I. Connell, Elliptic curve handbook (1998). https://pendientedemigracion.ucm.es/BUCM/mat/doc8354.pdf
L.E. Dickson, History of the Theory of Numbers, Vol II: Diophantine Analysis (Dover Publications, New York, 2005)
L.C. Eggan, P.C. Eggan, J.L. Selfridge, Polygonal products of polygonal numbers and the Pell equation. Fibonacci Q. 20, 24–28 (1982)
R.T. Hansen, Arithmetic of pentagonal numbers. Fibonacci Q. 8, 83–87 (1970)
H.J. Hindin, A theorem concerning heptagonal numbers. Fibonacci Q. 18, 258–259 (1980)
S. Hirose, On some polygonal numbers which are, at the same time, the sums, differences, and products of two other polygonal numbers. Fibonacci Q. 24, 99–106 (1986)
W.J. O’Donnell, Two theorems concerning hexagonal numbers. Fibonacci Q. 17, 77–79 (1979)
W.J. O’Donnell, A theorem concerning octagonal numbers. J. Recreat. Math. 12, 271–272 (1979/80)
C. Runge, Üeber ganzzahlige Lösungen von Gleichungen zwischen zwei Veränderlichen (German). J. Reine Angew. Math. 100, 425–435 (1887)
W. Sierpiński, Un théorème sur les nombres triangulaires. Elem. Math. 23, 31–32 (1968). (French)
S. Tengely, M. Ulas, On products of disjoint blocks of arithmetic progressions and related equations. J. Number Theory 165, 67–83 (2016)
S. Tengely, M. Ulas, Power values of sums of certain products of consecutive integers and related results. J. Number Theory 197, 341–360 (2019)
Y. Zhang, On the Diophantine equation \(f(x)f(y)=f(z)^n\) involving Laurent polynomials. Colloq. Math. 151, 111–122 (2018)
Y. Zhang, T. Cai, On the Diophantine equation \(f(x)f(y)=f(z^2)\). Publ. Math. Debrecen 82, 31–41 (2013)
Y. Zhang, T. Cai, A note on the Diophantine equation \(f(x)f(y)=f(z^2)\). Period. Math. Hung. 70, 209–215 (2015)
Y. Zhang, T. Cai, On products of consecutive arithmetic progressions. J. Number Theory 147, 287–299 (2015)
Y. Zhang, Z.Y. Shen, On the Diophantine system \(f(z)=f(x)f(y)=f(u)f(v)\). Period. Math. Hung. 75, 295–301 (2017)
Y. Zhang, A.S. Zargar, On the Diophantine equation \(f(x)f(y)=f(z)^n\) involving Laurent polynomials, II. Colloq. Math. 158, 119–126 (2019)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported by the National Natural Science Foundation of China (Grant No. 11501052), Younger Teacher Development Program of Changsha University of Science and Technology (Grant No. 2019QJCZ051), Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering (Changsha University of Science and Technology), and the Natural Science Foundation of Zhejiang Province (Project No. LY18A010016).
Rights and permissions
About this article
Cite this article
Zhang, Y., Shen, Z. Arithmetic properties of polynomials. Period Math Hung 81, 134–148 (2020). https://doi.org/10.1007/s10998-020-00333-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-020-00333-2