An Asymptotic for E. P. Stein Numbers

arXiv:2611.05898 · math.CO, math.NT · Submitted 2026-11-04 · Read on arXiv

math.CO, math.NT

Submitted: 2026-11-04

Updated: 2026-11-04

Comments: 18 pages, 4 figures, 1 table

License: http://creativecommons.org/licenses/by/4.0/

The gist: Epstein's put-or-take-a-square game is an impartial combinatorial game in which a player may, in each turn, add or subtract the largest square not exceeding the current integer.

Terminology

Abstract

Epstein's put-or-take-a-square game is an impartial combinatorial game in which a player may, in each turn, add or subtract the largest square not exceeding the current integer. We study E. P. Stein numbers, the positions from which both legal moves lead directly to positive squares, and prove the following asymptotic formula for the counting function S 2(X) of these positions: [ S 2(X)= 1 over π squaredX 1/4 X+O(X 1/4).]

Related papers