**I.**

__Counting Arithmetic Progressions__

Given an arbitrary increasing sequence of positive integersthere is associated with it, a counting functionwhich determines the number of arithmetic progressions

^{[1]}up to . The counting function for the positive integers, and consequently all infinite arithmetic progressions, is given by the formula listed under A330285 (OEIS)^{[2]}:We may further generalize from this "AP" counting function,, all other functions which count progressions over integer sequences via the equation

where is the number of

*primitive progressions*of length, up to the*n*-th element of . A primitive progression is any subsetand

#### II. __Relative Arithmetic Density__

There are two other uses for our counting function over the positive integers which will be discussed in both this section as well as the following section. The first application involves computing the

*relative arithmetic density*of our sequence, but before we begin it is necessary to elaborate on the definition of partial densities. Let us consider the fact that the number of progressions up tois merely a fraction of all subsequences over the given interval. The partial densityis therefore equal to

whereis the n-th triangular number and the denominator counts subsequences of length three or greater. The infinite sum of partial densities overis approximately 2.89563562435821120303, and will be referred to as Layman's constant

^{[3]}. The exact value of the infinite series of partial densities requires further analysis, in the meantime we can still use Layman's constant to construct a definition for relative densities in general by comparing arbitrary number sequences with the positive integers themselves. The relative arithmetic densitycan thus be definedwhich is just some real number less than or equal to one.

#### III. __Natural Arithmetic Density__

The second use for our AP counting functions involves a more naturalistic interpretation of arithmetic density, as far as real number valuations are concerned. We can arrive at such a definition by taking advantage of the fact that the counting function for any infinite progression has maximal growth. It then becomes an arbitrary choice of which complementary sequence we might use to construct a suitable infinite series for our valuation. The author has chosen the sequence of factorials because firstly they converge for all AP counting functions, and secondly because they allow for more convenient algebraic analysis. The formula for the

*natural arithmetic density*ofis thus defined**IV.**

__The Partitional Convergence Theorem__

**(i) Proof of the theorem.**

Assuming the infinite series

and

whereand. We can deduce that this sequence of finite series must be constructible, otherwise the infinite sum of reciprocals would not diverge. What is not immediately evident, however, is that each of these finite series should converge to the same value from below. We denote this

*divergence constant*as, and we will further expand on its significance in the following subsection. In order to establish our proof, let us first draw our attention to the terminal values at the end of each finite series. Without the addition of these single terms, any particular series falls short of those before it according to the second inequality above. Therefore, if all of the finite series are to diverge from any particular constant, that would imply each terminal value is greater than the previous one, or . This cannot be the case since our infinite subsequence is monotonically increasing, and so its reciprocal elements must tend toward zero. As an example of the proof, let it be noted that the divergence constant for the positive integers is.

Before leaving the present topic, there are two other constants which should be briefly discussed for future reference. These are the

*criticality constant*, and the*co-criticality constant*. We can calculate them using the infinite seriesand

**(ii) Alternative representation of divergent series.**

A further consequence of the theorem is that partial sums of divergent series can now be represented using the divergence constant mentioned above. To do so requires the introduction of an error function which adjusts the constant according to the interval over which the function is taken, i.e.

We can then expand upon this equation by introducing

*balancing coefficients*which allow us to compute partial sums over the*m*-th interval . These are implemented in the following mannerwhich implies

__REFERENCES__

__[__

**1**

__]__Weisstein, Eric W. "Arithmetic Progression." From

*Mathworld*--A Wolfram web resource. (http://mathworld.wolfram.com/ArithmeticProgression.html)

**[2]**Entry A330285 in The On-Line Encyclopedia of Integer Sequences,

**[3]**Entry A051336 in The On-Line Encyclopedia of Integer Sequences, (http://oeis.org/A051336)

**[4]**Weisstein, Eric W. "q-Polygamma Function." From

*Mathworld*--A Wolfram web resource. (https://mathworld.wolfram.com/q-PolygammaFunction)

**[5]**Weisstein, Eric W. "Backward Difference." From

*Mathworld*--A Wolfram web resource. (http://mathworld.wolfram.com/BackwardDifference)