arXiv · 2609.29408
Counting consecutive multiplicatively dependent triples
Abstract
We obtain a nontrivial bound on the number of triples of positive integers $(a,b,c) \in [1,H]^3$, which are multiplicatively dependent but each pair of its elements is not, and so is the triple $ (a+1,b+1,c+1)$. The method is based on studying factorisations of some resultants and a recent improvement by G. Binyamini, R. Cluckers and F. Kato (2025) of the classical Bombieri--Pila bound.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Igor Shparlinski, Nicolas Sleiman. 2026-09-24. Counting consecutive multiplicatively dependent triples. https://arxiv.org/abs/2609.29408
Cite the original work for its findings. Save a collection to share your selection of sources.