On the finiteness of solutions for polynomial-factorial Diophantine equations
From MaRDI portal
Publication:2126286
DOI10.1515/forum-2020-0138zbMath1492.11082arXiv1903.01076OpenAlexW3117702737MaRDI QIDQ2126286
Publication date: 19 April 2022
Published in: Forum Mathematicum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01076
Quadratic and bilinear Diophantine equations (11D09) Counting solutions of Diophantine equations (11D45) Diophantine equations in many variables (11D72) Representation problems (11D85)
Related Items (3)
Explicit interval estimates for prime numbers ⋮ Existence of the solutions to the Brocard–Ramanujan problem for norm forms ⋮ Power savings for counting solutions to polynomial-factorial equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the equation \(P(x)=n!\) and a question of Erdős
- Variations on the Brocard-Ramanujan equation
- Integers of the form \(x^2 + ny^2\)
- The Factorial Function and Generalizations
- REPRESENTATIONS OF INTEGERS BY THE BINARY QUADRATIC FORM
- Bertrand’s postulate for number fields
- The Diophantine Equation n ! + 1 = m2
- P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
- The next to last case of a factorial diophantine equation
- Finiteness of trivial solutions of factorial products yielding a factorial over number fields
- On polynomial-factorial diophantine equations
This page was built for publication: On the finiteness of solutions for polynomial-factorial Diophantine equations