- two-prime factorization
- мат. разложение на два простых множителя
Большой англо-русский и русско-английский словарь. 2001.
two-prime factorization
Смотреть что такое "two-prime factorization" в других словарях:
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
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
Prime factor — In number theory, the prime factors of a positive integer are the prime numbers that divide into that integer exactly, without leaving a remainder. The process of finding these numbers is called integer factorization, or prime factorization.For a … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
prime — I. noun Etymology: Middle English, from Old English prīm, from Latin prima hora first hour Date: before 12th century 1. a. often capitalized the second of the canonical hours b. the first hour of the day usually considered either as 6 a.m. or the … New Collegiate Dictionary
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Euler's factorization method — is a method of factorization based upon representing a positive integer N as the sum of two squares in two different ways :N = a^2+ b^2 = c^2+ d^2 (1)Although the algebraic factorization of binomial numbers cannot factor sums of two squares… … Wikipedia
Lenstra elliptic curve factorization — The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub exponential running time algorithm for integer factorization which employs elliptic curves. Technically, the ECM is classified as a… … Wikipedia
Table of prime factors — The tables contain the prime factorization of the natural numbers from 1 to 1000.When n is a prime number, the prime factorization is just n itself, written in bold below.The number 1 is called a unit. It has no prime factors and is neither prime … Wikipedia
Fermat's factorization method — is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… … Wikipedia
Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite … Wikipedia
