Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-16T21:14:10.921Z Has data issue: false hasContentIssue false
  • English
  • Français

On the lower bound sieve

Published online by Cambridge University Press:  26 February 2010

Jiahai Kan
Jiahai Kan
Affiliation:
Nanjing Institute of Posts and Telecommunications, Nanjing 210003, Nanjing, China.
Get access

Abstract

A unified method is used to improve the order of the lower bound sieve.

Type
Research Article
Information
Mathematika , Volume 37 , Issue 2 , December 1990 , pp. 273 - 286
Copyright
Copyright © University College London 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Richert, H.-E.. Selberg's sieve with weights. Mathematika, 16 (1969), 1–22.CrossRefGoogle Scholar
2. Halberstam, H. and Richert, H.-E.. The distribution of polynomial sequences. Mathematika, 19 (1972), 25–50.CrossRefGoogle Scholar
3. Halberstam, H. and Richert, H.-E.. Sieve Methods (Academic Press, London and New York, 1974).Google Scholar
4. Kan, J.. On the number of solutions of p + h = Pr. Mathematische Zeitschrift, 203 (1990), 37–42.Google Scholar
5. Kan, J.. Lower and upper bounds for the number of solutions of p + h = Pr. To appear in Acta Arithmetica.Google Scholar
6. Kan, J.. On the sequence p + h and the number of solutions of N – p = Pr (Abstract). Kexue Tongbao, 35 (1990), 558.Google Scholar