Abstract
Let a, b, and n be non-z.ero integers with (a,b) = 1 and n ≥ 2. We show that the greatest prime factor of ax m + by n. where x, y, and m are non-zero integers satisfying (ax, by) = 1, ¦x¦> 1, and m ≥ 2, is not less than log m times an effectively computable positive constant depending only on a, b, and n.
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 callMore From: Comptes Rendus de l'Academie des Sciences Series I Mathematics
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.
