Assessing the Feasibility of Partitioning Squares of Consecutive Odd, Even, or All n Numbers into k Groups of Equal Sums: A Practical Computational Method and Theoretical Approach with Proofs

This repository contains the preprint article and the corresponding computational code for the topic: "Assessing the Feasibility of Partitioning Squares of Consecutive Odd, Even, or All n Numbers into k Groups of Equal Sums: A Practical Computational Method and Theoretical Approach with Proofs".

In 2 Version
"Added explanations and lemmas, and final proof at pages 29-30"

"Added explanations for mathematical Big(O) checking (especially for n * n / ln(n) instead of just n). Also added Big(O) logical version"

In 3 Version

"Added missing detail (case: p = 1) at page 24"

"Added some notes in lemma 2 at page 29, first lines of page 30"

"some punctuation and font corrections related to lemmas, at pages: 29-30"