Примеры использования The integers на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
The integers Z with subtraction(-) form a quasigroup.
An example of searching of a given item in the integers matrix of size 20* 20.
The integers under the multiplication operation, however, do not form a group.
Люди также переводят
The integers are a discrete ordered ring, but the rational numbers are not.
Determine how to obtain 10 using the integers 1, 1, 5, 8 and the four basic arithmetic operations.
The integers have additional properties which do not generalize to all commutative rings.
We write n for the chromatic number of G, and assign the integers( 1… n){\displaystyle(1… n)} to the n colours.
The integers, considered as a module over the ring of integers, is a Noetherian module.
They are closely related to(but are not equal to)reflections generating the orthogonal group of x2+ y2- z2 over the integers.
If this group is the integers the Hopf surface is called primary, otherwise it is called secondary.
Many of the advances in these second-generation cryptosystems were also ported to the cryptosystem over the integers.
For example, the restriction of< from the reals to the integers is still asymmetric, and the inverse> of< is also asymmetric.
The integers that would result from this construction are doubly exponential in the number of vertices of the given polyhedral graph.
In this variant, the integers can be graded(by the identity function) in his setting, and the compatibility of ranks with the ordering is not redundant.
Given a Dynkin diagram X,Chevalley constructed a group scheme over the integers Z whose values over finite fields are the Chevalley groups.
The integers do not form a division ring, because the second operation cannot always be inverted; there is no integer a such that 3× a 1.
First, if a andb share no prime factors in the integers, then they also share no prime factors in the Gaussian integers. .
Similarly, SL(2) is simply connected as an algebraic group over any field, but the Lie group SL(2,R)has fundamental group isomorphic to the integers Z, and so SL(2,R) has nontrivial covering spaces.
In some contexts, such as the integers, distributivity over addition and the existence of a multiplicative identity is enough to uniquely determine the multiplication operation.
In the three-party set disjointness problem in communication complexity, three subsets of the integers in some range are specified, and three communicating parties each know two of the three subsets.
Chevalley constructed a Chevalley basis(a sort of integral form but over finite fields) for all the complex simple Lie algebras(or rather of their universal enveloping algebras),which can be used to define the corresponding algebraic groups over the integers.
In the common case where source is defined by some simple function, such as the integers from 0 to n- 1, source can simply be replaced with the function since source is never altered during execution.
With certain modifications(replacement of Z by Z- 1, and use of the integers 1 and 2 for the ns to give a numerical value of 3⁄4 for the difference of their inverse squares),the Rydberg formula provides correct values in the special case of K-alpha lines, since the transition in question is the K-alpha transition of the electron from the 1s orbital to the 2p orbital.
In this case, the Herzog-Schönheim conjecture states that every covering system,a family of arithmetic progressions that together cover all the integers, must either cover some integers more than once or include at least one pair of progressions that have the same difference as each other.
Not every form can be decomposed into a symmetric form and a skew-symmetric form- for instance, over the integers, the associated symmetric form(over the rationals) may take half-integer values, while over Z/ 2 Z,{\displaystyle\mathbf{Z} /2\mathbf{Z},} a function is skew-symmetric if and only if it is symmetric as 1 -1.
In many cases of interest there is a standard(or"canonical") embedding,like those of the natural numbers in the integers, the integers in the rational numbers, the rational numbers in the real numbers, and the real numbers in the complex numbers.
Van der Waerden's theorem states that for any positive integers r andk there exists a positive integer N such that if the integers{1, 2,…, N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression all of the same color.