ANALYTICAL APPROACH TO DESCRIPTION OF SOME C0MBINATORIAL AND NUMBER-THEORETIC COMPUTATIVE ALGORITHMS

We discuss the theme on translating different descriptions of computative algorithms into high-level programming languages, enumerate some advantages of analytical descriptions and demonstrate that logical functions may be used effectively to create analytical formulae available for describing a set of combinatorial and number-theoretic computative algorithms. In particular, we adduce analytical formulae to generate /-th prime numbers P1, permutations of order m, k-th numbers of Smarandache sequences of 1st and 2nd kinds and classical Magic squares of an order n.