Читать книгу Mathematics of Harmony as a New Interdisciplinary Direction and “Golden” Paradigm of Modern Science - Alexey Stakhov - Страница 33

Now, we will consider the extreme special cases of the optimal (n, k, 1)-algorithm, that is, when n = 1 or k = 1. For the case n = 1, the expression (1.36) takes the following form:

It is easy to verify that in the case of n = 1, the optimal (1, k, 1)-algorithm reduces to the readout algorithm discussed above (Fig. 1.7). For the case k = 1, the expression (1.36) takes the following form:

It is easy to verify that in the case of k = 1, the optimal (n, 1, 1)-algorithm reduces to the counting algorithm discussed above (Fig. 1.5).