A Polynomial Diophantine Generator Function for Integer Residuals

In this paper we address the problem of determining residual values in integer division by mathematical computation more amenable to analytic methods than iterative division, as well as the values of the corresponding integer quotient. Diophantine generator functions derived from empirical observation of the pattern present in integer values as a result of sequential execution of the division operation over each of the respective closed integer intervals is presented that admits the direct computation of corresponding residual and quotient by means of polynomial functions. Unlike the process of simple iterative division the resulting generator functions admit application of mathematical tools to analysis of applicable problems not otherwise admitted by the sequential division process.

We have not found the results presented addressed by others in available literature. The focus of the literature of general relation to the problem and problems it impacts having taken avenues premised on more conventional methods, such as algebraic structures and numeric sieves. The approach taken in derivation of the generator functions is by way of difference expression [1] on the 3-tuple <x, y, r> in context of the commonly known relation .

The observed behavior of the integer values in the two intervals leads us to produce distinct generator functions for each interval. This dichotomy works to benefit the objective of locating the zeros of the function , as the interval √ , contains precisely one value for ‘x’ such that ‘x’ divides ’n’.

We consider the following conditions: Given a value ’n’, 3-tuples <x k , y k , r k > where <x 0 , y 0 , r 0 > = √ , √ , √ √ . The values of x 0 , y 0 have the relation x 0 ≤ y 0 . For our purpose here we define on the values i = x 0 and j = y 0 the following delta:  1 0 .

The generator functions here are premised on decrementing ‘x’ over the interval √ 1, where ‘x’ is an integer index value. The generator function is derived from n = (x * y) -r. We obtain the set of difference expressions of Lemma 2.2.1 for the respective values of x, y, r from that relation.

Given the conditions as stated, above in 2.1, for all values k in the closed interval 1, over integers:

-1

, and;

.

The difference expressions follow by basic algebra from the relations , as any amount by which x is reduced needs be account for in the other terms of the equation to maintain the equality relation between the left and right sides. The expressions for computing the resultant values of ‘y’ and ‘r’ distribute the subtracted value of ‘x’ in the context of the equation across those variables in accordance with the algebraic manipulation:

Given the conditions as stated, above in 2.1, under the difference expressions of Lemma 2.2.1, where -1, the residual value where ; which reduces to .

We observe that under the given conditions the value √ will be either an integer or real number with a non-zero decimal component. The result of the assignment of values to , is such that either or 1 for any given value of ’n’. With representing | | we have then the follow sequence:

The sequence of relations above only hold where . However, in foregoing the application of the mod and div operations we arrive at the following:

, 1, 1

Which then leads to the following:

Observing that is equal to 0 or 1 and present in each iteration we have for any the product . This leaves the summation of for each giving us ∑ ∑

.

From which we can thus derive:

;

which by algebraic operations on the summations reduces to .

Testing this hypothesis for base values 0 and 1 we obtain the following results:

By induction we then assume that the expression holds for all k, for k+1 we then have

Observing that absent application of the quotient of that the difference between the corresponding values of , increase with k by 2, including the constant 1 resulting from the decrementing action of 1 the above then reduces to , proving the theorem. . This corollary follows from Theorem 3 by substitution of ; where the equality follows from the definition of as the k th subtraction of the value 1.

Given the conditions as stated, above in 2.1, under the difference expressions of Lemma 2.2.1, as applied in Theorem 2.2.1:

Given the conditions as stated, above in 2.1, under the difference expressions of Lemma 2.2.1, as applied in Theorem 2.2.1 and using the result of Lemm2.2.2:

Noting that the value computed as is absent the addition of integer quotient of (i.e. “r div x”) and that accounts for that integer quotient in the absence of the mod operation being applied, from Lemma 2.2.1 it follows that , producing a generator function for the quotient of integer division of ’n’ by ‘x’.

The generator functions here are premised on incrementing ‘y’ over the interval √ , where ‘y’ is an integer index value. The generator function is derived from n = (x * y) -r. We obtain the set of difference expressions of Lemma 2.1.1 for the respective values of x, y, r from th

This content is AI-processed based on open access ArXiv data.