A Note On Browkin’s and Cao’s Cancellation Algorithm

In this paper, we follow our generalisation of the cancellation algorithm described in our previous paper [A. Tomski, M. Zakarczemny, On some cancellation algorithms, NNTDM. 23, 2017, p. 101–114]. for f being a natural-valued function defined on ℕ^s s, ≥1 we remove the divisors of all possible values of f in the points in which the sum of coordinates is less than or equal to n. The least non-cancelled number is called the discriminator D_f(n). We find formulas, or at least an estimation for this discriminator, in the case of a broad class of sequences.