Number Theory

    

A General Partition Generating Algorithm for a Positive Integer k= K1.k2.…kn

Authors: Pratish R. Rao, Prashanth R. Rao

In this paper we present a potentially novel partition generating algorithm for a positive integer k= k1k2.…kn-1kn . In previous papers we used a similar strategy to derive two important known mathematical results regarding factorials and a novel strategy to partition odd composites(Refs 1-3). Here we will generalize this approach to make it widely applicable to all positive integers. We believe this strategy may be an important tool to mathematicians to attack unsolved conjectures as well to derive alternate possibly simpler proofs of established theorems.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2015-05-04 22:10:43

Unique-IP document downloads: 200 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus