阶乘和勒让德三平方定理:II
Factorials and Legendre's three-square theorem: II
摘要:
令$\bar{S}$表示整数集合$n$,使得$n!$不能写成三个平方的和。令$\bar{S}(n)$表示$\bar{S} \cap [1, n]$。我们建立了$\bar{S}(2^k)$的精确公式,并证明了$\bar{S}(n) = 1/8*n + \mathcal{O}(\sqrt{n})$。我们还列出了出现在$\bar{S}$中的间隙的长度。我们利用软件包核桃建立这些结果。
英文摘要:
Let $\bar{S}$ denote the set of integers $n$ such that $n!$ cannot be written as a sum of three squares. Let $\bar{S}(n)$ denote $\bar{S} \cap [1, n]$. We establish an exact formula for $\bar{S}(2^k)$ and show that $\bar{S}(n) = 1/8*n + \mathcal{O}(\sqrt{n})$. We also list the lengths of gaps appearing in $\bar{S}$. We make use of the software package Walnut to establish these results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。