加载中…
For a set of nonnegative integers, let denote the number of solutions to with , . Let be the Thue-Morse sequence and . Let and be a positive integer such that for all . Previously, the first author proved that if and , then for all . In this paper, we prove that the above lower bound is nearly best possible. We also get some other results.

生成讲解博客的中文版本

生成AI智能校验的中文版本