- factorizations
- Разложения
Большой англо-русский и русско-английский словарь. 2001.
factorizations
Смотреть что такое "factorizations" в других словарях:
factorizations — factorization (Amer.) n. (Mathematics) resolution of an integer or polynomial into factors so that when multiplied together they give the integer or polynomial (also factorisation) … English contemporary dictionary
Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For … Wikipedia
Cunningham project — The Cunningham project aims to find factors of large numbers of the form for b = 2, 3, 5, 6, 7, 10, 11, 12 and large exponents n. The project is named after Allan Joseph Champneys Cunningham, who published the first version of the table together… … Wikipedia
Sylvester's sequence — In number theory, Sylvester s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are::2, 3, 7, 43, 1807, 3263443, 10650056950807,… … Wikipedia
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Fundamental theorem of arithmetic — In number theory, the fundamental theorem of arithmetic (or unique prime factorization theorem) states that every natural number greater than 1 can be written as a unique product of prime numbers. For instance, : 6936 = 2^3 imes 3 imes 17^2 , ,! … Wikipedia
Choi's theorem on completely positive maps — In mathematics, Choi s theorem on completely positive maps (after Man Duen Choi) is a result that classifies completely positive maps between finite dimensional (matrix) C* algebras. An infinite dimensional algebraic generalization of Choi s… … Wikipedia
Comparison of linear algebra libraries — The following tables provide a comparison of linear algebra software libraries, either specialized or general purpose libraries with significant linear algebra coverage. Dense linear algebra General information Creator Language First public… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… … Wikipedia
