Abstract:
The algorithm for finding a solution to each task, see the title of the article, implies its discreteness of relationships from the total of its possible parts. Or exactly, the algorithm must be divided into some sequence of arithmetic operations to be implemented. The existing measurement theory, which is interpreted in particular as a theory of ways to encode real numbers, provides an answer to these listed problems. Using this theory, a real algorithm is found for placing all existing primitive numerical sequences in space in the form of arithmetic tables. Additional research by coding the special properties of recurrent numerical series led to the establishment of two computational formulas for finding all prime numbers. Then to the system blocks, which in essence do not differ from formulas. In applied arithmetic, this is the ability to place such computational objects in three-dimensional space. For the computer implementation of the set computational tasks, those rules of real and arithmetic operations are determined, which must take place for tables. The method of constructing real-arithmetic tables is not universal, but it makes it possible to obtain its further development in the subsystem of numerical irregular triangles.
Keywords:three-dimensional space, recurrent (recurrent) numerical sequences, prime numbers, Pascal's triangle.
Citation:
V. L. Shcherban, “On the possibility of placing two system blocks and two computational”, Vestnik KRAUNC. Fiz.-Mat. Nauki, 43:2 (2023), 31–43
\Bibitem{Shc23}
\by V.~L.~Shcherban
\paper On the possibility of placing two system blocks and two computational
\jour Vestnik KRAUNC. Fiz.-Mat. Nauki
\yr 2023
\vol 43
\issue 2
\pages 31--43
\mathnet{http://mi.mathnet.ru/vkam599}
\crossref{https://doi.org/10.26117/2079-6641-2023-43-2-31-43}