2000 character limit reached
Cannonball Polygons with Multiplicities
Published 24 Jul 2025 in math.NT | (2507.18057v1)
Abstract: We generalize the Cannonball Problem by introducing integer-valued and non-increasing arithmetic functions $w$. We associate these functions $w$ with certain polygons, which we call cannonball polygons. Through this correspondence, we show that for any $Z\in\mathbb{N}$, there exists a cannonball polygon with multiplicity 8 and largest side of length $Z$. Moreover, for any multiplicity $s$ greater than 8, we provide an asymptotic formula for the number of distinct classes of cannonball polygons with multiplicity $s$.
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.