Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fermat's polygonal number theorem for repeated generalized polygonal numbers (1908.02102v4)

Published 6 Aug 2019 in math.NT and math.CO

Abstract: In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required to represent every positive integer and we furthermore generalize this result to obtain optimal bounds when many of the generalized $m$-gonal numbers are repeated $r$ times, where $r\in\mathbb{N}$ is fixed.

Summary

We haven't generated a summary for this paper yet.