Skip Navigation


Teaching Mathematics and its Applications Advance Access originally published online on February 5, 2007
Teaching Mathematics and its Applications 2007 26(2):56-72; doi:10.1093/teamat/hrl018
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
26/2/56    most recent
hrl018v1
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 Eisenberg, T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The Institute of Mathematics and its Applications. All rights reserved. For permissions, please email: journals.permissions@oxfordjournals.org

Prime knowledge about primes

Theodore Eisenberg

Theodore Eisenberg, Department of Mathematics, Ben-Gurion University, PO Box 653, Beer Sheva 84105, Israel. Tel: 972-8-6460302, 972-8-6461617; Fax: 972-8-6477648. E-mail: eisenbt{at}013.net, eisen{at}math.bgu.ac.il

  Abstract

Several proofs demonstrating that there are infinitely many primes, different types of primes, tests of primality, pseudo primes, prime number generators and open questions about primes are discussed in Section 1. Some of these notions are elaborated upon in Section 2, with discussions of the Riemann zeta function and how algorithmic complexity enters into tests for primes. Readers may know segments of what follows, but hopefully this work will help them place their knowledge into richer landscapes.

Received June 2004. Accepted April 2005.


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.