Scientific Journal of KubSAU

In 1893, the French mathematician J. Adamar raised the question: given a matrix of fixed order with coefficients not exceeding modulo this value, then what is the maximum modulo value can take the determinant of this matrix? Adamar fully decided this question in the case when the coefficients of the matrix are complex numbers and put forward the corresponding hypothesis in the case when the matrix coefficients are real numbers modulo equal to one. Such matrices satisfying the Hadamard conjecture were called Hadamard matrices, their order is four and it is unknown whether this condition is sufficient for their existence. The article examines a natural generalization of the Hadamard matrices over the field of real numbers, they are there for any order. This paper proposes an algorithm for the construction of generalized Hadamard matrices, and it is illustrated by numerical examples. Also introduces the concept of constants for the natural numbers are computed values of this constant for some natural numbers and shown some applications of Hadamard constants for estimates on the top and bottom of the module of the determinant of this order with arbitrary real coefficients, and these estimates are in some cases better than the known estimates of Hadamard. The results of the article are associated with the results of the con on the value of determinants of matrices with real coefficients, not exceeding modulo units

In this article, we construct polynomials of third, fourth and fifth degrees with Galois groups as and respectively. In addition, we give examples of polynomials different degrees with Galois groups isomorphic transitive subgroup of group , but calculations with help Maple show that Galois groups of this polynomials is . Also Polynomials with as Galois groups are shown

In this article, the generic polynomials for cyclic groups of order 4, 8 and 16 over fields with characteristic two are constructed. With this construction, the generic polynomials for all cyclic 2-groups over fields with characteristic two can be obtained. We also give survey of known results of generic polynomials for the cyclic groups.

The article obtained the explicit form of root polynomials for cyclic polynomials of degree three over fields of characteristic 2. We also give an overview of known results on the root polynomials over arbitrary fields

The article presents the theorem of Chebyshev on the distribution of primes, considering functions that approximated prime numbers. We have also considered a new function, which is quite good for approximation of prime numbers. A review of the known results on distribution of prime numbers is given as well

In this article, we present the fundamental theorem of arithmetic and its role. We consider various rings for its performance

In this article, we discuss various issues related to the formulas approximating the distribution function of prime numbers pi(x). This question has occupied many scholars, but the exact function is well approximated function pi(x) over the number of positive integers not. Based on certain hypotheses, we present a new function s(x) is very well approximated pi(x). The above article hypotheses are so important that their numerical validation and refinement for the lengths of the segments more in 1014 - one of the main areas related to the problem of approximation of the function pi(x) throughout the series of natural numbers. After analyzing the behaviors and constructs many functions, we are building the basis of the function s(x), which is well approximates the function pi(x) throughout the series of natural numbers. We also present a table of values for x, less or equal 1022 for the difference of s(x) - pi(x)

The Euler function is very important in number theory and in Mathematics, however, the range of its values in the natural numbers has not been written off. The greatest value of the Euler function reaches on Prime numbers, furthermore, it is multiplicative. The value of the Euler function is closely associated with the values of the Moebius function and the function values of the sum of the divisors of the given natural number. The Euler function is linked with systems of public key encryption. The individual values of the Euler function behave irregularly because of the irregular distribution of primes in the natural numbers. This tract is illustrated in the article with charts; summatory function for the Euler function and its average value are more predictable. We prove the formula of Martinga and, based on it, we study the approximation accuracy of the average value of the Euler function with corresponding quadratic polynomial. There is a new feature associated with the average value of the Euler function and calculate intervals of its values. We also introduce the concept of density values of the Euler function and calculate its value on the interval of the natural numbers. It can be noted that the results of the behavior of the Euler function are followed by the results in the behavior of functions of sums of divisors of natural numbers and vice versa. We have also given the results of A.Z.Valfish and A.N.Saltykov on this subject

The inverse matrix for the square matrix A of order n with coefficients of some field exists, as it is known then and only then, when its determinant is not equal to zero. If the matrix A has a certain type (certain structure), then an inverse matrix A-1 should not have exactly the same structure. Therefore, it is interesting to describe such square matrices A, which have an inverse matrix A-1, having the same structure as the matrix A, under certain conditions. For example, a subdiagonal matrix with nonzero elements on the main diagonal has an inverse matrix over a field of characteristic zero, having also the form of subdiagonal matrix. Similarly, an inverse matrix towards symmetrical or skew-symmetric matrix is also symmetric or skew-symmetric accordingly. Also, the matrix inverse to non-degenerate (nonsingular) circulant will be a circulant itself, and finally, the matrix inverse to nonsingular quasdiagonal matrix D will be quasdiagonal itself, and will have the same partitioned structure as D. Thus, there is a problem of determining these types of nonsingular matrices that have an inverse matrix of the same type as a given matrix. In line with this problem in the present study it is determined such type of matrices for which an inverse matrix has the same type, at that the conditions are identified in explicit form, ensuring the nonsingularity of the matrix. The matrices of three orders are shown in detail. These results allow determining the characteristics of fields over which there are inverse matrices of the considered types

This work continues the series of works written by the author on the application of modern scientific methods in the study of human consciousness. In 1979-1981, two monographs were written devoted to higher forms of consciousness, the prospects of man, technology and society. One of these monographs was two-volume and was called "Theoretical Foundations of the Synthesis of Quasi-Biological Robots." In these monographs the author proposed: 1) criterial periodic classification of 49 forms of consciousness, including higher forms of consciousness (HFC); 2) based on this classification, there were psychological, microsocial and technological methods of transition between various forms of consciousness, including methods of transition from the usual form of consciousness to the HFC; 3) information-functional theory of the development of technology (including the rule of improving the quality of the basis); 4) information theory of value; 5) 11 functional schemes of technical systems of future forms of society, including remote telekinetic (mental) control systems; 6) the concept of development of society in groups of socio-economic formations; 7) the concept of determining the form of human consciousness by the functional level of the technological environment; 8) mathematical and numerical modeling of the dynamics of the probability density of states of human consciousness in evolution using the theory of Markov’s random processes. In this study, we carry out a complete automated system-cognitive analysis (ASC- analysis) of the periodic criteria classification of forms of consciousness proposed by the author in 1978. To this end, the following tasks are solved in the work: cognitive structuring and formalization of the subject area; synthesis and verification of statistical and system-cognitive models (multi-parameter typification of forms of consciousness); systemic identification of forms of consciousness; their typological analysis; investigations of a simulated domain by examining its model. We have also given a detailed numerical example of solving all these problems