On The Sum of Three Square Formula

dc.contributor.author	Lao, Hussein Mude
dc.contributor.author	Oduor, Maurice Owino
dc.contributor.author	Ojiema, Michael Onyango
dc.date.accessioned	2024-05-31T13:02:03Z
dc.date.available	2024-05-31T13:02:03Z
dc.date.issued	2023-11-30
dc.identifier.uri	https://doi.org/10.51867/scimundi.3.1.11
dc.identifier.uri	https://sciencemundi.net/ojs/index.php/scimundi/article/view/27
dc.identifier.uri	http://ir-library.mmust.ac.ke:8080/xmlui/handle/123456789/2854
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	SCIENCE MUNDI	en_US
dc.subject	On The Sum, Three, Square, Formula	en_US
dc.title	On The Sum of Three Square Formula	en_US
dc.type	Article	en_US