This document was uploaded by user and they confirmed that they have the permission to share
it. If you are author or own the copyright of this book, please report to us by using this DMCA
report form. Report DMCA
Overview
Download & View Lower And Upper Bound Divisor Function as PDF for free.
ABSTRACT We prove a method for finding lower bounds for the divisor function:
σ
0
(n). The method does not involve explicit computation using the
double sum, therefore not requiring computation of many values of cos (2π q) for q a rational number. The lower bounds found are beter than the trivial case and the formula can be extended to get progresivley tighter bounds. Getting lower bounds for the divisor function means getting upper bounds for the prime counting function. The formulas do give exact counts of composites smaller than a finite number. * email: [email protected]
CONTENTS: 1. Upper Bounds 2. Lower Bounds (direct counting) 3. Upper Bound for Prime Counting Function Bibliography
1. Upper Bounds We start with the result from ref. [3] for computing the divisor function σ 0(n) = d (n): d(n) = n
∑
µ
µ ^(-1) ∑ cos(2π *ν *n/µ ). µ =1 ν =1
(1)
The integral corresponding to this does not give a tight enough upper bound, however the proof is long and is omitted. The method we use indstead depends on finding the smallest number of form m! and larger than n in d(n). Since the set of numbers of form m! is sparse we need aditional theorems to get a tighter bound, by finding a suitable number closer to n and of the required form. The bound: d(n) <= 2√n
(2)
may be used (it may be tighter or not than our main method depeding on n). This follows from the rule that we only have to divide by numbers < √n to get 1/2 of the whole set of the divisors. The main results follow. We use "kCm" for k combinations of m. 1.1 Lemma If n is of form m! we have that: d(n) = d(m!) = 1Cm +2C(m-1) + 3C(m-1) + ... + (m-2)C(m-1) + 1 = f (m)
(3)
Proof: A number of form m! is factorised as: 1*2*3*...*m The first term counts the amount of factors. The second term counts a pairwise reordering except pairs including 1 i.e. 2C(m-1), the third term counts a triple reordering except triples including 1 because including 1 is equivalent to reordering
of piars. This reasoning continues untill (m-1)C(m-1) = 1.
Set mn = min { m in IN : n < m! }. 1.2 Theorem We have: d(n) <= 1C(mn) + 2C(mn - 1) + ... + (mn - 2)C(mn - 1) + 1 = f (mn). Proof: By Lemma 1.1 and since n < m! and numbers of form m! have the maximum amount of divisors for numbers smaller than m!.
Since in general we need to find a number closer to n than m! in order to get a tighter bound the following theorems is usefull. 1.3 Theorem If 1 < m <= k then d(k!/m) <= f (k - 1). Proof: Division by m is equivalent to deleting m form the string: 1*2*3*...*k which reduces the set to count combinations of by one.