Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-21T11:34:27.255Z Has data issue: false hasContentIssue false
  • English
  • Français

Products of three pairwise coprime integers in short intervals

Part of: Multiplicative number theory

Published online by Cambridge University Press:  01 April 2012

Asim Islam
Asim Islam*
Affiliation:
Department of Mathematics, Royal Holloway, University of London, Egham, Surrey TW20 0EX, United Kingdom (email: [email protected])

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The existence of products of three pairwise coprime integers is investigated in short intervals of the form . A general theorem is proved which shows that such integer products exist provided there is a bound on the product of any two of them. A particular case of relevance to elliptic curve cryptography, where all three integers are of order , is presented as a corollary to this result.

MSC classification

Secondary: 11N25: Distribution of integers with specified multiplicative constraints
Type
Research Article
Information
LMS Journal of Computation and Mathematics , Volume 15 , May 2012 , pp. 59 - 70
Copyright
Copyright © London Mathematical Society 2012

References

[1]Baker, R. C., ‘The greatest prime factor of the integers in an interval’, Acta Arith. 47 (1986) 193–231.CrossRefGoogle Scholar
[2]Baker, R. C., Diophantine inequalities, London Mathematical Society Monographs (New Series) I (Clarendon Press, Oxford, 1986).Google Scholar
[3]Bentahar, K, ‘The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited’, Cryptography and coding: 10th IMA international conference, 2005, Lecture Notes in Computational Science 3796 (Springer, Berlin, 2005) 376–391.CrossRefGoogle Scholar
[4]Graham, S. W. and Kolesnik, G., Van der Corput’s method of exponential sums, London Mathematical Society Lecture Note Series 126 (Cambridge University Press, Cambridge, 1991).CrossRefGoogle Scholar
[5]Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers, 6th edn (Oxford University Press, Oxford, 2008).Google Scholar
[6]Harman, G., ‘Integers without large prime factors in short intervals and arithmetic progressions’, Acta Arith. 91 (1999) 279–289.CrossRefGoogle Scholar
[7]Harman, G., Prime-detecting sieves, London Mathematical Society Monographs 33 (Princeton University Press, Princeton, NJ, 2007).Google Scholar
[8]Liu, H. Q. and Wu, J., ‘Numbers with a large prime factor’, Acta Arith. 89 (1999) 163–187.CrossRefGoogle Scholar
[9]Muzereau, A., Smart, N. P. and Vercauteren, F., ‘The equivalence betwen the DHP and DLP for elliptic curves used in practical applications’, LMS J. Comput. Math. 7 (2004) 50–72.CrossRefGoogle Scholar
[10]Shiu, P., ‘A Brun-Titchmarsh theorem for multiplicative functions’, J. Reine Angew. Math. 313 (1980) 161–170.Google Scholar