2000 character limit reached
Geometric progressions in syndetic sets
Published 26 Mar 2020 in math.NT | (2003.12016v4)
Abstract: An open problem about finite geometric progressions in syndetic sets leads to a family of diophantine equations related to the commutativity of translation and multiplication by squares.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.