Schur Triples
Paper:(submitting)
On the monochromatic Schur Triples type problem
Programs accompany the paper: Schur Program
Sample Input-Output File of Original Schur Problem
Sample Input-Output File of Generalize Schur Problem
Sample Input-Output File of Greedy Algorithm
#######################################################
Below is my original work which begined the above paper. All the work here is in the main paper. But I think it would show the motivation better than the real formal paper.
It is also shorter and easier to read. This is also the past project from Experimental math class with Dr. Z.:
The new upper bound of the minimum, over all r-colorings of [1,n], of monochromatic Schur triples.
#######################################################
While I was trying to prove the main result above, I found another simple proof to the orginal problem about Schur Triple. I think it might be helpful.
Yet Another Proof of Schur Triples Problem.
Programs accompany this note: Calculus Program