Sums of powers in number theory is an open problem, which is defined as:

𝑥3 + 𝑦3 + 𝑧3 = 𝑘

where 𝑥 ∈ ℤ, 𝑦 ∈ ℤ, 𝑧 ∈ ℤ, 𝑘 ∈ ℤ+ . For example, 2 can be expressed as (−6)3 + (−5)3 + 73 and

6 as (−1)3 + (−1)3 + (2)3. However, some integers do not have solution, like 4 and 5.
Interestingly, all numbers within 100 (except those 9𝑖 ± 4) were found. The sum of three cubes
for the last number 42 was found on 6 September 2019:

(−80538738812075974)3 + (−80435758145817515)3 + 126021232973356313 = 42

The next lowest unsolved number is 114.

Try to find the solution for whole numbers in the range of [1, 100] using x, y, z in the range of
[−1000, 1000]. Build a C++ program to help you.

What to submit in the file format of PDF to UMmoodle:

a) Complete source code.

b) A list of result in the form of (only show the first combination found for each number):
1 = (◌◌◌)^3+(◌◌◌)^3+(◌◌◌)^3
2 = (◌◌◌)^3+(◌◌◌)^3+(◌◌◌)^3
3 = (◌◌◌)^3+(◌◌◌)^3+(◌◌◌)^3
4 has no result.
5 has no result.
6 = (◌◌◌)^3+(◌◌◌)^3+(◌◌◌)^3
7 = (◌◌◌)^3+(◌◌◌)^3+(◌◌◌)^3
where ◌◌◌ is the answer.
c) Calculation time taken.