Abstract
In this work, we give upper bounds for n on the title equation. Our results depend on assertions describing the precise exponents of 2 and 3 appearing in the prime factorization of Tk(x)=(x+1)k+(x+2)k+...+(2x)k. Further, on combining Baker's method with the explicit solution of polynomial exponential congruences (see e.g. [6]), we show that for 2≤x≤13,k≥1,y≥2 and n≥3 the title equation has no solutions.
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 callSimilar Papers
Disclaimer: 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.
