Abstract
Let u1, u2, u3,・・・ un be integers such that un − un−1 = un−1 − un−2 = ・ ・ ・ = a2 − a1 = d. In this article, the study of sums of cube in arithmetic progression is discussed. In particular, the study develops and introduces some generalized results on sums of six, seven and nine cube for any arbitrary integers in arithmetic sequences. The method of study involves analogy grounded on integer decomposition and factorization. The result in this study will prove the existing results on sums of cubes.
Reference15 articles.
1. Booker, A. (2017). A computational approach to the continuous and discrete weighted k-sum problem, Mathematics of Computation, 86(307), 2823-2833.
2. Christopher, A. D. (2016). A partition-theoretic proof of Fermat's Two Squares Theorem. Discrete Mathematics, 339(4), 1410-1411. https://doi.org/10.1016/j.disc.2015.12.002.
3. Davenport, H. (1964). On Waring's problem for cubes.Acta Arithmetica, 9(2), 374-409. https://doi.org/10.4064/aa-9-1-3-12.
4. Euler, L. (1964). Observations on Diophantine Equations. Duke Mathematical Journal, 17(1), 255-268.
5. Heath-Brown, D. (1990). A one-sentence proof that every prime p ≡ 1mod4 is a sum of two squares. Amer. Math, 2(144). https://doi.org/10.2307/2323918.