PARTITIONING POWERS INTO SETS OF EQUAL SUM

doi:10.1216/rmj.2026.56.503

PARTITIONING POWERS INTO SETS OF EQUAL SUM

2026-04-01

0

PRE

AI

T

Trevino, Enrique *

DOI：10.1216/rmj.2026.56.503

Original

Original request for help

Save

Abstract

En 中文

For integers k >= 1 and m >= 2, we study the set of integers n for which the set { 1 (k) , 2(k), ... , n(k)} can be partitioned into m sets of equal sum. Most of the literature on the problem focuses on finding the least n for which a partition is possible. In our work we focus on finding all n given k and m .

Keywords:

Prouhet-Tarry-Escott problem

Waring's problem

consecutive powers

PARTITIONING POWERS INTO SETS OF EQUAL SUM

Abstract

Journal

Organization