





















Abstract:The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for shifted square sequences starting with a multiple of 4.
| Comments: | 5 pages |
| Subjects: | Number Theory (math.NT) |
| MSC classes: | 11A67, 11A07 |
| Cite as: | arXiv:2605.25542 [math.NT] |
| (or arXiv:2605.25542v1 [math.NT] for this version) | |
| https://doi.org/10.48550/arXiv.2605.25542 arXiv-issued DOI via DataCite (pending registration) |
From: Kyunghwan Song [view email]
[v1]
Mon, 25 May 2026 07:59:34 UTC (5 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。