Have a personal or library account? Click to login
One Some Cancellation Algorithms II Cover
Open Access
|May 2020

Abstract

We define b f(n) to be the smallest integer (a natural number) d such that numbers f(n1, n2, ..., nm), where n 1+n2+ ... + nmn are not divisible by d. For the given functions f : ℕm → ℕ, we will obtain the asymptotic characterisation of the sequence of the least non canceled numbers (bf (n))n­. In the case f :ℕ2 (k, l)→k3+l3∈ℕ, this characterisation can be rewritten in the terms of the permutations polynomials of finite commutative quotient ring ℤ/mℤ. There are situations in which we cannot expect formula for bf(n) to be simple, but we can provide the upper and lower bounds of it.

DOI: https://doi.org/10.4467/2353737XCT.17.073.6430 | Journal eISSN: 2353-737X | Journal ISSN: 0011-4561
Language: English
Page range: 97 - 103
Published on: May 26, 2020
Published by: Cracow University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2020 Maciej Zakarczemny, published by Cracow University of Technology
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.