The Least Prime in Certain Arithmetic Progressions

Authors: Sabia, Juan; Tesauri, Susana

Source: American Mathematical Monthly, Volume 116, Number 7, August-September 2009 , pp. 641-643(3)

Publisher: Mathematical Association of America

Buy & download fulltext article:

OR

Price: $20.00 plus tax (Refund Policy)

Abstract:

In this note we give an upper bound for the least prime in certain arithmetic progressions. Although Linnik's theorem gives an asymptotically more precise bound, the proof here is completely elementary and is based on an observation already made by Legendre in 1830.

Document Type: Short communication

DOI: http://dx.doi.org/10.4169/193009709X458627

Publication date: 2009-08-01

More about this publication?
Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page