Abstract
Denote by [Formula: see text] (respectively, [Formula: see text]) the largest (respectively, the smallest) prime factor of the integer [Formula: see text]. In this paper, we prove a lower bound of almost-primes [Formula: see text] with [Formula: see text] such that [Formula: see text] for [Formula: see text]. As an application, we study two patterns on the largest prime factors of consecutive integers with one of which without small prime factor.
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.
