DC pole | Wartość | Język |
dc.contributor.author | Tomski, Andrzej | - |
dc.contributor.author | Zakarczemny, Maciej | - |
dc.date.accessioned | 2018-10-26T08:50:29Z | - |
dc.date.available | 2018-10-26T08:50:29Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Technical Transactions , Vol. 115, iss. 7 (2018), s. 153-165 | pl_PL |
dc.identifier.issn | 2353-737X | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/6910 | - |
dc.description.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. | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Na tych samych warunkach 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/pl/ | * |
dc.subject | discriminator | pl_PL |
dc.subject | sequence | pl_PL |
dc.subject | congruence | pl_PL |
dc.subject | odious numbers | pl_PL |
dc.subject | Thue-Morse sequence | pl_PL |
dc.title | A note on Browkin’s and Cao’s cancellation algorithm | pl_PL |
dc.title.alternative | Uwagi o algorytmie sitowym Browkina i Cao | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
dc.relation.journal | Technical Transactions | pl_PL |
dc.identifier.doi | 10.4467/2353737XCT.18.106.8801 | - |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|