Location of Repository

Tau Numbers: A Partial Proof of a Conjecture and Other Results

By Joshua Zelinsky

Abstract

Abstract. A positive n is called a tau number if τ(n) | n, where τ is the number-ofdivisors function. Colton conjectured that the number of tau numbers ≤ n is at least 1 2 π(n). In this paper I show that Colton’s conjecture is true for all sufficiently large n. I also prove various other results about tau numbers and their generalizations.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.189.557
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.uwaterloo.ca/J... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.