BOOK 2. THE BATH SCHOOL. N. LEVASHOV'S «SVETL BROOM» IN A. KHATYBOV'S «BATH SCHOOL» AND A LABOUR SPADE

F. Shkrudnev N. Levashov's "SvetL Broom" in A. Khatybov's "Bath School" and A Labour Spade 377 touched upon this topic. So, modern basic knowledge is built on the following "whales": 1. Mathematics - 4 arithmetic operations, root, logarithm, integral, differential; - 11-vector symmetry; - Quaternion – the highest achievement (in calculations); - a class of NP-complex and NP-difficult problems (more than 90% of the problems are reduced to this class). 2. Physics Fundamentals – quantum electrodynamics and quantum electromechanics, atomic model – Bohr, Boskovic, matrix form. No postulate works, all effects have a double, and sometimes even more meanings. The calculation mechanism is built on the class of problems "System analysis and operations research", mathematics does not solve this class of problems. 3. Chemistry Mendeleyev's table is one of the main hindrance of development. One form of any transformation, one table (with isotopes, isobars, isosters) without the elements connection and without the meaning of their existence. Flat forms display complex structures. This is what lies on the surface. ANY RANDOM DOES NOT HAPPEN TWICE The lack of an instrumental base (primarily mathematics) does not allow one to approach even elementary calculations, let alone understand the meaning of transient processes. A.S. Pushkin "... The hut is standing there on chicken legs having neither windows nor doors ..." The simplest reminder of the multidimensionality of space, but even in the simplex method 57 , transition to the next space is simple, adding one (!)variable. Misunderstanding of the meaning of space (the state of the octave) brings to the creation of a technical base precisely according to the level of understanding and, as a rule, everything is used only to destroy Humanity (for example, as soon as the names "virtual reality", "virtual space" appeared, the video "Virtual Killer" immediately came 57 The simplex method is an algorithm for solving the optimization problem of linear programming by enumerating the vertices of a convex polyhedron in a multidimensional space. The essence of the method: the construction of basic solutions on which the linear functional decreases monotonically, to the situation when the necessary conditions for local optimality are satisfied