Skip navigation

Please use this identifier to cite or link to this item:
Title: A note on Browkin’s and Cao’s cancellation algorithm
Other Titles: Uwagi o algorytmie sitowym Browkina i Cao
Authors: Tomski, Andrzej
Zakarczemny, Maciej
Keywords: discriminator; sequence; congruence; odious numbers; Thue-Morse sequence
Issue Date: 2018
Citation: Technical Transactions , Vol. 115, iss. 7 (2018), s. 153-165
Abstract: 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 Df(n). We find formulas, or at least an estimation for this discriminator, in the case of a broad class of sequences.
DOI: 10.4467/2353737XCT.18.106.8801
ISSN: 2353-737X
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Tomski_A_note_on_Browkin's_and_Cao's_cancellation_algorithm.pdf674,26 kBAdobe PDFView/Open
Show full item record

Uznanie autorstwa - użycie niekomercyjne, na tych samych warunkach 3.0 Polska Creative Commons License Creative Commons