z-logo
Premium
Numbers with a Large Prime Factor IV
Author(s) -
Balog A.,
Harman G.,
Pintz J.
Publication year - 1983
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-28.2.218
Subject(s) - factor (programming language) , mathematics , computer science , programming language
This is an ‘approximation’ to the original question. Here of course φ is to be made as large as possible. Increasing values of φ for which such a p can be shown to exist have been provided by Ramachandra [13, 14], Graham [4], Baker [1], Jia [7, 8, 9, 10], Liu [11], Baker and Harman [2], Liu and Wu [17] and Harman [6]. In Harman’s book, the value of φ is 0.74, and it is noted that recent work on exponential sums due to Wu [17] and Robert and Sargos [16] give room for further progress. In the present paper we pursue this programme, and prove the following result. We write P (n) for the largest prime factor of a natural number n, and Q(n) for the smallest prime factor of n, with Q(1) = 1.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom