正在加载页面…
Fix a positive integer , and put . Let be the least integer for which one translate of each of can be placed pairwise disjointly in . We prove that, for every and all sufficiently large , one has . Since the trivial counting bound gives , it follows that for every fixed . This confirms a conjecture of Alon, Dębski, Grytczuk and Przybyło on prescribed-difference packings of fixed-cardinality arithmetic progressions.

生成讲解博客的中文版本

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