Skip navigation

Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTomski, Andrzej-
dc.contributor.authorZakarczemny, Maciej-
dc.identifier.citationTechnical Transactions , Vol. 115, iss. 7 (2018), s. 153-165pl_PL
dc.description.abstractIn 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.pl_PL
dc.rightsUznanie autorstwa-Użycie niekomercyjne-Na tych samych warunkach 3.0 Polska*
dc.subjectodious numberspl_PL
dc.subjectThue-Morse sequencepl_PL
dc.titleA note on Browkin’s and Cao’s cancellation algorithmpl_PL
dc.title.alternativeUwagi o algorytmie sitowym Browkina i Caopl_PL
dc.relation.journalTechnical Transactionspl_PL
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 simple item record

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