On the finiteness of solutions for polynomial-factorial Diophantine equations
Wataru Takeda

TL;DR
This paper proves the finiteness of solutions for certain polynomial and factorial Diophantine equations, linking number theory conjectures and special factorial functions, with some results unconditional and others conditional on conjectures.
Contribution
It establishes finiteness results for polynomial-factorial Diophantine equations, including cases involving norm forms and Bhargava factorials, and connects these to the Oesterlé-Masser conjecture.
Findings
Finiteness of solutions for equations involving norm forms and factorials.
Conditional finiteness results assuming the Oesterlé-Masser conjecture.
Unconditional finiteness for specific infinite subsets of integers.
Abstract
We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many such that is represented {by} , where is a norm form constructed from the field norm of a field extension . We also deal with the equation , where is the Bhargava factorial. In this paper, we also show that the Oesterl\'e-Masser conjecture implies that for any infinite subset of and for any polynomial of degree or more the equation has only finitely many solutions . For some special infinite subsets of , we can show the finiteness of solutions for the equation unconditionally.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the finiteness of solutions for polynomial-factorial Diophantine equations
Wataru Takeda
Department of Mathematics, Nagoya University, Chikusa-ku, Nagoya 464-8602, Japan.
Abstract.
We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many such that is represented by , where is a norm form constructed from the field norm of a field extension . We also deal with the equation , where is the Bhargava factorial. In this paper, we also show that the Oesterlé-Masser conjecture implies that for any infinite subset of and for any polynomial of degree or more the equation has only finitely many solutions . For some special infinite subsets of , we can show the finiteness of solutions for the equation unconditionally.
Key words and phrases:
quadratic form, Diophantine equation, finiteness of solutions, generalized Brocard-Ramanujan problem
2010 Mathematics Subject Classification:
11D09,11D45,11D72, 11D85
1. Introduction
The Brocard-Ramanujan problem, which is an unsolved problem in number theory, is to find integer solutions of . Brocard and Ramanujan independently considered this problem and conjectured that the only solutions are and [Br76, Br85, Ra13]. As one of its generalizations, it has been proposed that there are only finitely many solutions of the polynomial-factorial Diophantine equation
[TABLE]
where is a polynomial of degree or more with integer coefficients. The generalized Brocard-Ramanujan problem excludes the case . In this case, we can observe that if the equation has infinitely many solutions , and otherwise has only finitely many solutions.
The Oesterlé-Masser conjecture, also known as the ABC-conjecture, implies that polynomial-factorial equations (1.1) have only finitely many solutions. To explain the statement of the Oesterlé-Masser conjecture, we define the algebraic radical. For any non-zero integer , the algebraic radical is defined by
[TABLE]
The Oesterlé-Masser conjecture states that for any there exists a positive constant such that
[TABLE]
for any triples of non-zero coprime integers with [Ma85, Os88]. In the following, we summarize results applying this conjecture to polynomial-factorial Diophantine equations.
First, Overholt showed that if the weak form of Szpiro’s conjecture is true, then has only finitely many solutions [Ov93]. The weak form of Szpiro’s conjecture states that there exists a positive constant such that
[TABLE]
for any triples of non-zero coprime integers with . One can check that the Oesterlé-Masser conjecture implies this conjecture. More generally, Dąbrowski showed that if the weak form of Szpiro’s conjecture is true, then for any integer the equation has only finitely many solutions [Da96]. He also showed that when is not square of an integer this result becomes unconditional. As a generalization of these results, Luca showed that for any polynomial with integer coefficients of degree , the Oesterlé-Masser conjecture implies that the equation has only finitely many solutions [Lu02].
There are many unconditional results. It is known that for the equation has no solution with except for and has no solution with except for [EO37]. In 1973, Pollack and Shapiro showed that also has no solution [PS73]. If we remove the assumption , there are infinitely many solutions of . In fact, for any , are solutions of .
Dąbrowski and Ulas showed that for all positive integer there exist infinitely many integers such that has at least three solutions in positive integer [DU13].
Berend and Osgood dealt with all polynomial and showed that for any polynomial of degree or more with integer coefficients, the equation has only a density [math] set of solutions [BO92], that is,
[TABLE]
In 2006, Berend and Harmse considered several related problems. They showed that for any polynomial which is an irreducible polynomial or satisfies certain technical conditions, there exist only finitely many solutions of , where is a highly divisible sequence [BH06]. They chose the following three sequences as highly divisible sequences ,
- •
.
- •
,
- where is the least common multiple of all positive integers less than or equal to .
- •
,
- where is the sequence of all primes.
They also consider defined by multinomial coefficients
[TABLE]
for a fixed integer .
In this paper, we use algebraic number theoretical approaches to consider the number of solutions for equation (1.1). Therefore, it is appropriate for our approach to deal with the equation
[TABLE]
More generally, we focus on the equation
[TABLE]
where and is a generalized factorial function over number fields. Let be a number field and be its ring of integers. Then the function is defined by
[TABLE]
where .
Instead of studying the number of , we study the number of for which there exists a pair such that by the following reasons. It is known that when is not a square integer has infinitely many solutions from the theory of Pell’s equation. Therefore, we can find has infinitely many solutions easily. To consider the relation between integers represented by polynomial and those of factorial, we consider the number of for which there exists a pair such that . In the case and , equation (1.2) is reduced to the generalized Brocard-Ramanujan’s equation (1.1). Therefore, it is expected that our results give some improvement of the generalized Brocard-Ramanujan problem. For the equation , we show that
Theorem 1.3**.**
Let be a homogeneous irreducible polynomial with , then there exist only finitely many such that is represented by .
As a corollary of this theorem, we obtain the result of Berend and Harmse [BH06] for irreducible polynomials. For reducible polynomials, we prove the following result.
Theorem 1.4**.**
Let a polynomial in whose irreducible factorization is
[TABLE]
Assume that there exist positive integers and such that
[TABLE]
Then there exist only finitely many such that is represented by .
We explain the definition of in Section 4, roughly speaking, is the set of all primes such that has no solution in .
Taking in Theorem 1.4, we get the result of Berend and Harmse for reducible polynomials partially. As in their results, we can replace with the above highly divisible sequences . Theorem 1.4 is one of corollaries of the folloing result for equation (1.2).
Theorem 1.5**.**
Let be a Galois extension field over and a polynomial in whose irreducible factorization is
[TABLE]
Assume that there exist a conjugacy class of , positive integers and such that . If does not divide then there exist only finitely many such that is represented by .
Moreover, for special quadratic forms there exist infinitely many with represented by .
In Section 2, we review some of the standard facts on algebraic number theory. First, we check that for any Galois group of splitting field of polynomial , there exists an element such that it fixes no roots of . This fact is very important to prove our theorems. Second, we review the Frobenius map of prime . This map controls the irreducible factorization modulo of the polynomial corresponding to itself.
In Section 3, we introduce two auxiliary lemmas. The first one characterizes the prime factorization of integers which can be written as . This is one of the generalizations of Cho’s results [Ch14, Ch16]. Cho characterized the prime factorization of integers written as or with congruent condition for . The second one gives a Bertrand type estimate for prime ideals corresponding to a conjugacy class of Galois group such that their ideal norm is of the form . In a previous paper [Ta19], we considered a Bertrand type estimate for primes splitting completely, which is the simplest case of the second auxiliary lemma. This result plays a crucial role in proving our main theorem.
In Section 4, we give a necessary condition for the existence of infinitely many solutions of . As a corollary, we obtain the result of Berend and Harmse for irreducible polynomials. Also, we gave their result for reducible polynomials partially. Moreover, for special quadratic forms there exists infinitely many such that is represented by .
In Section 5, we consider a generalization of the result in Section 4 to multi-variable homogeneous polynomials. However, irreducible polynomial represents any positive integers, that is, there exists infinitely many such that is represented by . Therefore, the simplest generalization of the result of Section 4 does not hold. In place of multi-variable homogeneous polynomials, we deal with norm forms of number fields. We can apply the same argument as in the proof of the result in Section 4 and obtain the finiteness of such that is represented by a norm form except for the case . Since , the equation has infinitely many solutions . After that, we consider the equation , where is the Bhargava factorial for . Since the Bhargava factorial is the ordinary factorial , we can regard this equation as one of the generalizations of the Brocard-Ramanujan problem. We point out that we can generalize Luca’s result, which states that the Oesterlé-Masser conjecture implies the finiteness of solution of the equation , to the equation by following Luca’s proof. Also, we show the finiteness of solution of the equation for with and .
2. Preliminaries on algebraic number theory
We recall some basic definitions and some propositions of algebraic number theory in this section. Let be an irreducible polynomial with and discriminant . When are roots of , the splitting field of is . It is known that is a Galois extension and the Galois closure of for all . The Galois group of plays a crucial role for splitting of primes in as follows.
We call a subgroup of transitive if the group orbit is equal to for . From Galois Theory, the Galois group can be identified with a transitive subgroup of the symmetric group of degree . For , the cycle type of is defined as the ascending ordered list of the sizes of the cycles in the cycle decomposition of . For example, the cycle type of is . Since if two permutations are conjugate in then they have the same cycle type, we can define the cycle type of conjugacy class of by the cycle type of a representative . We introduce a lemma for transitive subgroups of the symmetric group .
Lemma 2.1**.**
Let be a transitive subgroup of the symmetric group of degree . Then there exists an element such that for all .
Proof.
Let be the stabilizer subgroup of with respect to . Then the orbit-stabilizer theorem and transitivity of leads to . Now we consider the number of elements of the set
[TABLE]
Since the identity element belongs to all stabilizer , we have
[TABLE]
Therefore, there exists an element such that for all . ∎
This lemma ensures that for any Galois group of an irreducible polynomial of degree contains an element that does not fix any of the roots.
Next, we review the definitions and properties of the Frobenius map. Let be a prime and a prime ideal of lying above . For a prime ideal in , we define the decomposition group of by . Since and for , induces an automorphism of over . Now we consider the Galois group . It is known that this group is cyclic and there exists an unique automorphism which generates it. Then the Frobenius map of is the image of in Galois group . If the Frobenius map of belongs to a conjugacy class of , then we say that corresponds to . We denote the set of primes corresponding to by . The following theorem gives a relation between the cycle type of the Frobenius map of and the monic irreducible factorization of , where does not divide .
Theorem 2.2** (Frobenius).**
Let be a prime such that does not divide . We denote the cycle type of the Frobenius map of by . Then the monic irreducible factorization of is , where are distinct and .
3. Auxiliary lemmas
Let be an irreducible homogeneous polynomial (i.e. binary form) and the splitting field of . Also, we define the modified discriminant by
[TABLE]
where is the discriminant of . Cho studied the representation of integers as or for under the congruence conditions and [Ch14, Ch16]. We remove this congruence conditions and consider all polynomials with integer coefficients. Let be the set of conjugacy classes of the Galois group whose cycle type satisfies for all . This classification is very important to characterize integers represented by .
Lemma 3.1**.**
Let be an irreducible homogeneous polynomial with . Let be an integer with
[TABLE]
where are primes corresponding to a conjugacy class with
or and are the other primes. If is represented by then for all .
Proof.
An integer is represented by with if and only if is represented by with . Hence, we may assume without loss of generality that and .
Let be a prime corresponding to a conjugacy class with
, where . By the definition of , the cycle type of satisfies for all . As we seen in Lemma 2.2, the monic irreducible factorization of is
[TABLE]
where the are distinct and . Since for all , it follows that has no solution expect for in . Therefore, if then divides both of and . Thus . We can apply the same argument repeatedly to , which leads to .
This proves the lemma. ∎
As one of the corollaries of Lemma 3.1, we obtain the following theorem.
Theorem 3.2**.**
Let be a homogeneous polynomial whose irreducible factorization is
[TABLE]
and . Let be an integer with
[TABLE]
where with or and are the other primes. If is represented by then for all .
Proof.
By assumption, there exists a pair such that . Since , there exists a polynomial such that . By the definition of discriminant of polynomial, we have , that is, implies , where and . It follows that by Lemma 3.1. Therefore we obtain and . This is the desired conclusion. ∎
Next we change the assumption of Lemma 3.1 and give a necessary and sufficient condition for integers to be represented by . We call a discriminant fundamental, if one of the following statements holds
- •
and is square-free,
- •
, where or and is square-free.
In the following, we assume that one of and is a prime number or and the discriminant is fundamental. We characterize the prime factorization of integers which are expressed by .
Theorem 3.3**.**
Let be a positive definite quadratic form with fundamental modified discriminant and . We denote the corresponding order to by and the set of principal ideals of by . Let be an integer with
[TABLE]
where ramifies in , splits completely in and are distinct odd inert primes in . If is a prime number or , then is represented by if and only if
is even if . 2. 2.
are even numbers. 3. 3.
There exist prime ideals lying above ,
respectively such that
[TABLE]
where is if is inert in , otherwise.
Proof.
As in the proof of Lemma 3.1, we can assume without loss of generality. We assume that there exists a pair such that . We can obtain the second assertion by Lemma 3.1. Therefore, it suffices to prove the first and the third assertion.
First, we prove the first assertion. If , and is odd, then is odd, that is, is. Therefore,
[TABLE]
This contradicts and leads to . From the identity and this result, is even. Therefore, holds. The same argument repeatedly applied to leads to .
Next we show the third assertion. Since , we have
[TABLE]
Since , is an integer. Therefore, and . Now we denote this ideal by then we have . Since ramifies in , and . Also, is a prime ideal in and . Also, splits completely as in . Hence, there exist prime ideals such that
[TABLE]
Conversely, let be . This ideal can be expressed as
[TABLE]
and . Since , we obtain . Therefore we get
[TABLE]
Now we assume that is a prime number or , so or . Without loss of generality, we assume that for some integer . If we take , then . This proves the theorem. ∎
Remark 3.4**.**
By swapping and in the binary form , we can replace by in Theorem 3.3
In the following, we consider a Bertrand type estimate for primes corresponding to a conjugacy class of Galois group by following the method of Hulse and Murty. They gave one of the generalizations of Bertrand’s postulate, or Chebyshev’s theorem, to number fields [HM17]. We can obtain the following lemma, which gives a Bertrand type estimate for primes corresponding to of , by following the argument of Hulse and Murty [HM17].
Lemma 3.5** (cf. [HM17, Ta19]).**
Let be a Galois extension with and the absolute value of the discriminant of . For any there exists an effectively computable constant such that for there is a prime corresponding to a conjugacy class of with .
Next, we consider the distribution of prime ideals corresponding to a conjugacy class such that their ideal norm is of the form .
Theorem 3.6**.**
Let be the Galois closure of with and a prime corresponding to a conjugacy class of . For any there exists an effectively computable constant such that for there exists a prime ideal with , where .
Proof.
Let be a prime ideal with and a prime ideal lying above . We denote the order of the decomposition group by , then . From Lemma 3.5, any there exists a constant such that for there is a prime corresponding to with .
Since , there exists a prime ideal with . We denote . Thus for there is a prime ideal with . ∎
4. Main theorems
In this section, we give a necessary condition for the existence of infinitely many solutions for the equation .
First, we consider the equation , where is an irreducible homogeneous polynomial.
Theorem 4.1**.**
Let be a homogeneous irreducible polynomial with , then there exist only finitely many such that is represented by .
Proof.
Lemma 2.1 provides that . Let be a fixed conjugacy class of . The assumption and Lemma 3.1 imply that if is represented by and for prime corresponding to with or , then is divisible by at least. In particular, has no integer solution . Moreover, since the second smallest positive integer divisible by is , is not of the form in Lemma 3.1 for , that is, there exists no pair such that for .
Let be a root of and let be the extension degree of . We denote the ring of integers of by . Theorem 3.6 states that there exists such that for there is a prime ideal of corresponding to with . Let be a prime ideal of corresponding to with . Since we have , there exists corresponding to with , that is, there exists a prime corresponding to with .
As above, is not of the form in Lemma 3.1 for and there exists a prime corresponding to with . By induction, is not of the form in Lemma 3.1 for . This shows the finiteness of such that is represented by .
∎
As a corollary of this theorem, we obtain the result of Berend and Harmse for irreducible polynomial.
Theorem 4.2** (Theorem 3.1. of [BH06]).**
For any irreducible polynomial with , the equation has only finitely many solutions .
Next we consider the general case . For a prime and its Frobenius map with cycle type , we define as the number of such that . If is a Galois extension with extension degree , then for all primes unramified in , where is the inertia degree of in . Therefore, we obtain the following theorem.
Theorem 4.3**.**
Let be a Galois extension of and a polynomial in whose irreducible factorization is
[TABLE]
Assume that there exist a conjugacy class of , positive integers and such that . If does not divide then there exist only finitely many such that is represented by .
Proof.
We denote the extension degree by . As we remarked above, for all primes unramified in , where is the inertia degree of in . Then for all primes unramified in , . Since does not divide , Lemma 3.2 implies that there is no pair such that for .
By a Bertrand type estimate for primes in an arithmetic progression , there exists such that for there is a prime with . Let be a prime ideal of corresponding to with . Since , there exist a prime satisfying . By the assumption, we have and there exist lying above with .
As above, is not of the form in Lemma 3.2 for and there exists a prime ideal corresponding to with . By induction, is not of the form in Lemma 3.2 for . This shows the finiteness of such that is represented by . ∎
Since the -factor of the above highly divisible sequences appears with regularity, we can replace with in Theorem 4.3. When , the conjugacy class in Theorem 4.3 is equal to and does not divide . Therefore, we obtain the following corollary.
Corollary 4.4**.**
Let a polynomial in whose irreducible factorization is
[TABLE]
Assume that there exist positive integers and such that
[TABLE]
Then there exist only finitely many such that is represented by .
Taking in Corollary 4.4, we get the result of Berend and Harmse for reducible polynomials partially. To explain their result, we introduce the natural density for a subset of the set of all primes defined by
[TABLE]
where is the number of primes and is the number of those belonging to .
Theorem 4.5** (Theorem 4.1. of [BH06]).**
Consider the equation
[TABLE]
Let be any factor (irreducible or not) of . Denote by the set of all primes for which the congruence has a solution. If , then (4.6) has only finitely many solutions.
The assumption in Corollary 4.4 leads to . Thus, Theorem 4.5 implies Corollary 4.4 with .
If is even then we can remove the assumption that is a Galois extension.
Theorem 4.7**.**
Let be a number field and a polynomial of even degree in whose irreducible factorization is
[TABLE]
Let be a prime whose Frobenius map has the cycle type such that is odd for some odd and the conjugacy class of . If there exist positive integers and such that , then there exist only finitely many such that is represented by .
Proof.
We assume that is odd for some prime and some odd , and the Frobenius map has the cycle type in . Let . For all odd , the number is even. Let be the number of ideals of with It follows from the Chinese Remainder Theorem that the function satisfies the multiplicative property
[TABLE]
The ideals such that is expressed by product of prime ideals with . If is expressed as and the number of with equals , then we have . By considering the number of combinations with repetition, we get
[TABLE]
Since is odd, there exists an odd such that is odd in each product. For this odd
[TABLE]
is even, since binomial coefficients , where is an even number and is an odd number, are always even. Therefore
[TABLE]
Accordingly, is not of the form in Theorem 3.2. Since -factor does not appear in , for all the left hand side is not of the form in Theorem 3.2.
On the other hand, a Bertrand type estimate for primes in an arithmetic progression leads to the conclusion that there exists such that for there is a prime with . Let be a prime ideal of corresponding to with . Since , there exists a prime satisfying . By the assumption, we have and there exist lying above with .
As above, is not of the form in Lemma 3.2 for and there exists a prime ideal corresponding to with .
By induction, does not satisfy the condition in Theorem 3.2 for all . This shows the theorem. ∎
From Lemma 3.5, we observe that for a number field there exists an effectively computable constant such that for there is a prime such that divides but does not divide . Therefore, we obtain the following result.
Theorem 4.8**.**
Let be a number field and a polynomial in whose irreducible factorization is
[TABLE]
where are distinct irreducible polynomials. If , then there exist only finitely many such that is represented by .
For special quadratic forms, we give a sufficient condition for existence of infinitely many solutions. We denote the set of primes which is inert in by .
Theorem 4.9**.**
Let be a number field with and its discriminant. Let be a positive definite quadratic form with fundamental modified discriminant , where one of and is a prime number or . We denote . We assume that the class number of equals . If for all and for odd , is even, then there exist infinitely many such that is represented by .
Proof.
We assume for all and odd , is even. It suffices to show that the prime factorization of contains no prime raised to an odd power for infinitely many . From the multiplicative property of we show is even for all primes and odd in the following. As in the proof of Theorem 4.7, we get
[TABLE]
Now we assume is even for all odd . Since is odd, there exists an odd such that is odd in each product. As we remarked above, one of the binomial coefficients in the above product are even. Therefore, is a sum of even numbers, is also even.
If is odd for some and some odd , we denote . As we mentioned above, is odd. Chebotarev’s density theorem says that for any number fields there exist infinitely many primes splitting completely in . Let be a prime splitting completely in . Then we have . One can see easily that takes odd values infinitely many times and does. Since is a finite set, satisfies the first and second conditions in Theorem 3.3 infinitely many times. By assumption, the third condition in Theorem 3.3 is trivial. This shows the theorem. ∎
5. Some generalizations
In the previous sections, we deal with two variables homogeneous polynomial. Naturally, we have an interest in the Brocard-Ramanujan problem for multi-variable homogeneous polynomial. In this section, we consider polynomials in more variables.
It is known that a positive integer is the sum of three squares of integers if and only if it is not of the form , where are non-negative integers. Using this criterion, we check that there are infinitely many such that is represented by . Therefore, irreducibility of polynomials is not important for the finiteness of the solutions of .
In this paper, we consider the equations involving norm forms and factorial functions. Let be an order of number field and be their basis over . Then the norm form is defined by
[TABLE]
There exists the matrix converting the basis to the basis of . Also, since , an integer is represented by if and only if is also represented by . Therefore, it suffices to consider the case .
As a corollary of Theorem 4.1 we have
Corollary 5.1**.**
For any norm form of quadratic fields, there exists only finitely many such that is represented by .
We generalize this corollary to all norm forms by following the proof of Theorem 4.1 as follows.
Theorem 5.2**.**
For any order of a number field and their basis over , there exists only finitely many such that is represented by .
Using the following lemma, we can show Theorem 5.2 by the same argument with the proof of Theorem 4.1.
Lemma 5.3**.**
Let be an order of a number field and be a basis of over . Let be the homogeneous polynomial obtained by substituting for into . Let be an integer with
[TABLE]
where are primes corresponding to a conjugacy class with
and are the other primes. If is represented by then for all .
Remark 5.4**.**
By considering other intermediate fields of , we can characterize the prime factorization of integers represented by more specifically.
Next, we replace the right hand side of the equation with the Bhargava factorial. Bhargava introduced a generalization of the factorial function to generalize classical results in to Dedekind domains and unify them [Bh97, Bh00]. In this section, we consider the number of solutions for equations involving polynomials and the Bhargava factorial. Since the ordinary factorial is one of examples of the Bhargava factorial, we regard this equation as one of the generalizations of the Brocard-Ramanujan problem. The Bhargava factorial is defined as follows.
Let be an infinite subset of . First, we define -ordering of . A -ordering of is any sequence of elements of that is formed as follows:
- •
Choose any element ;
- •
For choose an element such that
[TABLE]
where is the -adic valuation defined by with an integer relatively prime to .
For a -ordering of , we construct the -sequence as
[TABLE]
It is known that the associated -sequence of is independent of the choice of -ordering of [Bh00].
With these settings, we define the Bhargava factorial by
[TABLE]
We give some examples of the Bhargava factorial. When , we can choose the natural ordering as -ordering of for all primes and find is the ordinary factorial . This is why we can regard the equation as one of the generalizations of the Brocard-Ramanujan problem . Also, when for some then . Since the arguments in the proof of Theorem 4.1 also works for the equation , we obtain the finiteness of solutions for the equation .
In this section, we point out that we can generalize Luca’s result by following his proof. Luca showed that the Oesterlé-Masser conjecture implies that the equation has only finitely many solutions [Lu02]. In the proof of this result, Luca used the facts that and the Stirling formula as and he estimate and . Therefore, if we can estimate and , we can argue as in the proof of Luca’s result. We summarize this more general form.
Theorem 5.5** (cf. Luca. [Lu02]).**
Let be a polynomial of and be a function satisfying as . Then the Oesterlé-Masser conjecture implies that the equation has only finitely many solutions .
We check that the Bhargava factorial for an infinite subset satisfies the condition of Theorem 5.5. Since , for all primes , the -adic valuation tends to infinity as . Therefore, as , .
Corollary 5.6**.**
Let be a polynomial of and be an infinite subset of . Then the Oesterlé-Masser conjecture implies that the equation has only finitely many solutions .
For some special case, we can show the finiteness of solutions for the equation unconditionally.
Theorem 5.7**.**
Let be a norm form of number field . For a polynomial with we denote . Then there exist only finitely many such that is represented by .
Proof.
As we remarked above, when , we find that and the same argument as in the proof of Theorem 4.1 also works for the equation . Therefore, it suffices to show the case . Let be an odd prime not dividing . Then we have
[TABLE]
and we can choose an ordering satisfying the following three conditions:
- (1)
; 2. (2)
; 3. (3)
For , .
This ordering forms a -ordering of and we can estimate as
[TABLE]
Following the notation in Lemma 5.3, we denote
[TABLE]
Lemma 5.3 leads to the conclusion that if is represented by and for odd prime corresponding to with , then is divisible by at least. In particular, has no integer solution . Moreover, since the second smallest -factor appears at by estimate (5.8), is not of the form in Lemma 5.3 for , that is, there exists no -tuple such that for .
As in the proof of Theorem 4.1, for sufficient large prime , there exists a prime corresponding to with and is not of the form in Lemma 5.3 for . By induction, is not of the form in Lemma 5.3 for . This shows the finiteness of such that is represented by . ∎
The case , it depends on the base field . For example, when then we find
[TABLE]
If is an abelian extension, then there exists a positive integer which characterizes the set of primes corresponding to a conjugacy class . Therefore, for any norm form of , we can show the finiteness of solutions for . On the other hand, if is not an abelian extension, then we cannot characterize the set of primes corresponding to a conjugacy class by any modulus and it is difficult to show the finiteness of solutions in general.
6. acknowledgement
The author deeply express their sincere gratitude to Professor M. Ram Murty and Professor Andrzej Dąbrowski for fruitful discussions. The author also deeply thanks Professor Kohji Matsumoto and Professor Masatoshi Suzuki for their precious advice. This work was supported by Grant-in-Aid for JSPS Research Fellow (Grant Number: 19J10705).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BH 06] D. Berend and J. E. Harmse. On polynomial–factorial Diophantine equations. Trans. Amer. Math. Soc. 358 (4), 1741–1779. 2006.
- 2[BO 92] D. Berend and C. F. Osgood. On the equation P ( x ) = n ! 𝑃 𝑥 𝑛 P(x)=n! and a question of Erdös. Journal of Number Theory . 42 , 189–193. 1992.
- 3[Bh 97] M. Bhargava. P-orderings and polynomial functions on arbitrary subsets of Dedekind rings. J. Reine Angew. Math . 490 , 101–127. 1997.
- 4[Bh 00] M. Bhargava. The factorial function and generalizations. Amer. Math. Monthly , 107 , no. 9 , 783–799. 2000.
- 5[Br 76] H. Brocard. Question 166, Nouv. Corres. Math . 2 , 287. 1876.
- 6[Br 85] H. Brocard, Question 1532, Nouv. Ann. Math. (3) 4 , 391. 1885.
- 7[Ch 14] B. Cho. Integers of the form x 2 + n y 2 superscript 𝑥 2 𝑛 superscript 𝑦 2 x^{2}+ny^{2} . Monatshefte für Mathematik , 174 (2), 195–204. 2014.
- 8[Ch 16] B. Cho. representations of integers by the binary quadratic form x 2 + x y + n y 2 superscript 𝑥 2 𝑥 𝑦 𝑛 superscript 𝑦 2 x^{2}+xy+ny^{2} . Journal of the Australian Mathematical Society , 100 (2), 182–191. 2016.
