Abstract
The purpose of this article is to develop a method of factorisation based on an additive property of the positive integers. Using known results it is emphasised that the composite odd positive integers are precisely those odd numbers that can be represented as sums of three or more consecutive positive integers. The obviously implied algorithm basis is refined in this paper up to a desired level of optimality. The result is an additive-multiplicative basis for an algorithm that is based partly on the said additive property and partly on long division (or alternatively the gcd).
Highlights
The purpose o fthis article is to develop a method offactorisation based on an additive property o fthe positive integers
A factorisation method based on an additive property
precisely those odd numbers that can be represented as sums
Summary
The purpose o fthis article is to develop a method offactorisation based on an additive property o fthe positive integers. STELLING I: Elke saamgestelde, onewe positiewe heelgetal besit 'n 6-partisie. Die volgende omgekeerde van STELLING I toon dat die pasbespreekte drie vorms van 6-partisies die enigste is wat 'n onewe positiewe heelgetal kan hê.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
