The Frobenius problem for shifted square sequences starting with a multiple of 4
Number Theory
2026-05-26 v1
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.
Cite
@article{arxiv.2605.25542,
title = {The Frobenius problem for shifted square sequences starting with a multiple of 4},
author = {Kyunghwan Song},
journal= {arXiv preprint arXiv:2605.25542},
year = {2026}
}
Comments
5 pages