Abstract

1. For an integer v > 1, we define P(v) to be the greatest prime factor of v and we write P(1) = 1. Let m ≥ 0 and k ≥ 2 be integers. Let d1, …, dt with t ≥ 2 be distinct integers in the interval [1, k]. For integers l ≥ 2, y > 0 and b > 0 with P(b) ≤ k, we consider the equationPutso that ½ < vt ≤ ¾. If α > 1 and kα < m ≤ kl, then equation (1) implies thatfor 1 ≤ i ≤ t and hence

Full Text
Paper version not known

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 call

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.