Abstract
In this paper, we study a Ramsey-type problem for equations of the form ax+by=p(z). We show that if certain technical assumptions hold, then any 2-colouring of the positive integers admits infinitely many monochromatic solutions to the equation ax+by=p(z). This entails the 2-Ramseyness of several notable cases such as the equation ax+y=zn for arbitrary a∈Z+ and n≥2, and also of ax+by=aDzD+…+a1z∈Z[z] such that gcd(a,b)=1, D≥2, a,b,aD>0 and a1≠0.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
