One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1112/jlms/jdq026
Copy DOI
Export
Save
Share
Cite Publication Date: Jul 6, 2010 | |
 Citations: 7 |
Affiliation: University of Bristol
We demonstrate that, under suitable local conditions on a finite collection F1,…, Fg of binary irreducible forms with integer coefficients, the product F1(x)·…·Fg(x) will have at most r prime factors for infinitely many x. We give explicit upper bounds for r that depend only on g and on the total degree of the product polynomial.
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.
