On Rado's Boundedness Conjecture

We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a₁,a₂, and a₃ are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a₁x₁+a₂x₂+a₃x₃=0, then for every finite coloring of the positive integers there is a monochromatic solution to a₁x₁+a₂x₂+a₃x₃=0.