On the finiteness of solutions for polynomial-factorial Diophantine equations
From MaRDI portal
Publication:2126286
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4093562 (Why is no real title available?)
- scientific article; zbMATH DE number 1019530 (Why is no real title available?)
- scientific article; zbMATH DE number 1910291 (Why is no real title available?)
- Bertrand's postulate for number fields
- Finiteness of trivial solutions of factorial products yielding a factorial over number fields
- Integers of the form \(x^2 + ny^2\)
- On polynomial-factorial diophantine equations
- On the equation \(P(x)=n!\) and a question of Erdős
- P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
- Representations of integers by the binary quadratic form \(x^{2}+xy+ny^{2}\)
- The Diophantine Equation n ! + 1 = m2
- The Factorial Function and Generalizations
- The next to last case of a factorial diophantine equation
- Variations on the Brocard-Ramanujan equation
Cited in
(9)- Existence of the solutions to the Brocard–Ramanujan problem for norm forms
- Product of factorials equal another product of factorials
- On the variant \(Q(n!)=P(x)\) of the Brocard-Ramanujan Diophantine equation
- On the Bhargava factorial of polynomial maps
- On polynomial-factorial diophantine equations
- Finiteness of trivial solutions of factorial products yielding a factorial over number fields
- Explicit interval estimates for prime numbers
- Power savings for counting solutions to polynomial-factorial equations
- On the incompatibility of Diophantine equations arising from the strong factorial conjecture
This page was built for publication: On the finiteness of solutions for polynomial-factorial Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2126286)