Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on April 30, 2008
Bulletin of the London Mathematical Society 2008 40(3):532; doi:10.1112/blms/bdn037
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
40/3/532    most recent
bdn037v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Friedlander, J. B.
Right arrow Articles by Shparlinski, I. E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

Least totient in a residue class

John B. Friedlander

Department of Mathematics
University of Toronto
Toronto
Ontario
CanadaM5S 2E4

Igor E. Shparlinski

Department of Computing
Macquarie University
North Ryde
Sydney
NSW 2109
Australia
igor@ics.mq.edu.au

Received 5 December 2007. Bull. London Math. Soc. 39 (2007) 425–432

Abstract

We are indebted to Moubariz Garaev, who pointed out a slip in our use of the bound for character sums from [2] in the proof of [1, Corollary 2]. A correct version would be as follows.

COROLLARY 2. For any {varepsilon} >0 there exists an A>0 such that, uniformly for integers m≥1 which have no prime divisor p<(log m)A and a with gcd(a, m)=1, we have the bound


Formula

Footnotes

2000 Mathematics Subject Classification.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.