Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tight universal sums of $m$-gonal numbers

Published 18 Feb 2022 in math.NT | (2202.09296v1)

Abstract: For a positive integer $n$, the set of all integers greater than or equal to $n$ is denoted by $\mathcal T(n)$. A sum of generalized $m$-gonal numbers $g$ is called tight $\mathcal T(n)$-universal if the set of all nonzero integers represented by $g$ is equal to $\mathcal T(n)$. In this article, we prove the existence of a minimal tight $\mathcal T(n)$-universality criterion set for a sum of generalized $m$-gonal numbers for any pair $(m,n)$. To achieve this, we introduce an algorithm giving all candidates for tight $\mathcal T(n)$-universal sums of generalized $m$-gonal numbers for any given pair $(m,n)$. Furthermore, we provide some experimental results on the classification of tight $\mathcal T(n)$-universal sums of generalized $m$-gonal numbers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.