Return to search

The prime number theorem

Thesis (M.A.)--Boston University. / 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]

Identiferoai:union.ndltd.org:bu.edu/oai:open.bu.edu:2144/28109
Date January 1962
CreatorsNickerson, Earl R.
PublisherBoston University
Source SetsBoston University
Languageen_US
Detected LanguageEnglish
TypeThesis/Dissertation
RightsBased on investigation of the BU Libraries' staff, this work is free of known copyright restrictions.

Page generated in 0.0021 seconds