Is there a name for the concept of trying to find the minimum number of elements from one set of integers that will sum to all elements in another set? Like, for example, with the Pythagorean Theorem, this would be to find the minimum number of elements from the set of all squared integers that will sum to all squared integers; the answer would be two.(adsbygoogle = window.adsbygoogle || []).push({});

I'm asking because I'm looking into how to extend the Pythagorean Theorem to higher powers. I know FLT has been proven, so I know that for all powers higher than 2, the answer must be that one must sum more than 2 number.

EDIT: Title should be: "Minimum number of elements in one set to sum to all in another.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Minimum number of elements to in one set to sum to all in another.

**Physics Forums | Science Articles, Homework Help, Discussion**