Abstract
AbstractWe investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ε, we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding nε, with the length of the strings tending to infinity with speed log log log log n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
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.