Back to search

Boston University

The prime number theorem

Abstract

dc:description.abstract

In Chapter 1 of this thesis we give some elementary definitions and prove the following three theorems: 1.1 Every positive integer n greater than one can be expressed in the form n=p1p2...pk where each of the pi is a prime number. 1.2 Every integer n greater than one can be expressed in standard form in one and only one way. If we write n=(p1^a1)(p2^a2).....(pj^aj), where p1< p2 <...< pj and each ai is greater than 0, then n is expressed in standard form. 1.3 The number of prime numbers is infinite [TRUNCATED]

Degree

thesis:*
Name thesis:degree_name
Master of Arts
Level thesis:degree_level
masters
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
Boston University
Year dc:date.issued
1962

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nickerson, Earl R.

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • Based on investigation of the BU Libraries' staff, this work is free of known copyright restrictions.
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Other
b14566060

Chain of custody

source
Harvested from
Boston University
Base URL
open.bu.edu/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Nickerson, Earl R.. The prime number theorem. masters thesis, Boston University, 1962. https://hdl.handle.net/2144/28109