On the finiteness of solutions for polynomial-factorial Diophantine equations

DOI10.1515/FORUM-2020-0138zbMATH Open1492.11082arXiv1903.01076OpenAlexW3117702737MaRDI QIDQ2126286FDOQ2126286

Authors: Wataru Takeda 

Publication date: 19 April 2022

Published in: Forum Mathematicum (Search for Journal in Brave)

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 $l$ such that $l!$ is represented {by} $N_A(x)$, where $N_A$ is a norm form constructed from the field norm of a field extension $K/mathbfQ$. We also deal with the equation $N_A(x)=l{!}_S$, where $l{!}_S$ is the Bhargava factorial. In this paper, we also show that the Oesterl'e-Masser conjecture implies that for any infinite subset $S$ of $mathbfZ$ and for any polynomial $P(x)inmathbfZ[x]$ of degree $2$ or more the equation $P(x)=l{!}_S$ has only finitely many solutions $(x,l)$. For some special infinite subsets $S$ of $mathbfZ$, we can show the finiteness of solutions for the equation $P(x)=l{!}_S$ unconditionally.

Full work available at URL: https://arxiv.org/abs/1903.01076

Recommendations

• On polynomial-factorial diophantine equations
• scientific article; zbMATH DE number 1236731
• scientific article; zbMATH DE number 1910291
• Power savings for counting solutions to polynomial-factorial equations
• On the Diophantine equation \(f(n)=u!+v!\)

zbMATH Keywords

Diophantine equationnorm formBrocard-Ramanujan problemfiniteness of solutions

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Diophantine equations in many variables (11D72) Counting solutions of Diophantine equations (11D45) Representation problems (11D85)

Cites Work

• The Factorial Function and Generalizations
• P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
• On the equation \(P(x)=n!\) and a question of Erdős
• Title not available (Why is that?)
• Title not available (Why is that?)
• On polynomial-factorial diophantine equations
• The Diophantine Equation n ! + 1 = m²
• Finiteness of trivial solutions of factorial products yielding a factorial over number fields
• Representations of integers by the binary quadratic form \(x^{2}+xy+ny^{2}\)
• The next to last case of a factorial diophantine equation
• Title not available (Why is that?)
• Integers of the form \(x^2 + ny^2\)
• Variations on the Brocard-Ramanujan equation
• Bertrand’s postulate for number fields

Cited In (7)

• On the Bhargava factorial of polynomial maps
• On polynomial-factorial diophantine equations
• 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
• Power savings for counting solutions to polynomial-factorial equations
• Explicit interval estimates for prime numbers

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)