Prime knowledge about primes

Theodore Eisenberg

doi:10.1093/teamat/hrl018

Prime knowledge about primes

Theodore Eisenberg

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	56-72
Number of pages	17
Journal	Teaching Mathematics and its Applications
Volume	26
Issue number	2
DOIs	https://doi.org/10.1093/teamat/hrl018
State	Published - 1 Jan 2007

ASJC Scopus subject areas

General Mathematics
Education

Access to Document

10.1093/teamat/hrl018

Cite this

@article{955f2262676742b8bc95251580099a43,

title = "Prime knowledge about primes",

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.",

author = "Theodore Eisenberg",

year = "2007",

month = jan,

day = "1",

doi = "10.1093/teamat/hrl018",

language = "English",

volume = "26",

pages = "56--72",

journal = "Teaching Mathematics and its Applications",

issn = "0268-3679",

publisher = "Oxford University Press",

number = "2",

}

TY - JOUR

T1 - Prime knowledge about primes

AU - Eisenberg, Theodore

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77953921786&partnerID=8YFLogxK

U2 - 10.1093/teamat/hrl018

DO - 10.1093/teamat/hrl018

M3 - Article

AN - SCOPUS:77953921786

SN - 0268-3679

VL - 26

SP - 56

EP - 72

JO - Teaching Mathematics and its Applications

JF - Teaching Mathematics and its Applications

IS - 2

ER -

Prime knowledge about primes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this