Abstract
Let n,x,y,z be any given integers. The study of n for which n = x2 +y2 + z2 is a very long-standing problem. Recent survey of sizeable literature shows that many researchers have made some progress to come up with algorithms of decomposing integers into sums of three squares. On the other hand, available results on integer representation as sums of three square is still very minimal. If a,b,c,d,k,m,n,u,v and w are any non-negative integers, this study determines the sum of three-square formula of the form abcd+ka2+ma+n = u2 +v2 +w2 and establishes its applications to various cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
