- nonnegative divisor
- мат. неотрицательный дивизор
Большой англо-русский и русско-английский словарь. 2001.
nonnegative divisor
Смотреть что такое "nonnegative divisor" в других словарях:
Division algorithm — This article is about a mathematical theorem. For a list of division algorithms, see Division (digital). In mathematics, and more particularly in arithmetic, the usual process of division of integers producing a quotient and a remainder can be… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… … Wikipedia
Negative and non-negative numbers — A negative number is a number that is less than zero, such as −2. A positive number is a number that is greater than zero, such as 2. Zero itself is neither positive nor negative. The non negative numbers are the real numbers that are not… … Wikipedia
Methods of computing square roots — There are several methods for calculating the principal square root of a nonnegative real number. For the square roots of a negative or complex number, see below. Contents 1 Rough estimation 2 Babylonian method 2.1 Example … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Continued fraction — Finite continued fraction, where a0 is an integer, any other ai are positive integers, and n is a non negative integer. In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the… … Wikipedia
Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… … Wikipedia
Cone of curves — In mathematics, the cone of toot (sometimes the Kleiman Mori cone) of an algebraic variety X is a combinatorial invariant of much importance to the birational geometry of X. Contents 1 Definition 2 Applications 3 … Wikipedia
Binary GCD algorithm — The binary GCD algorithm is an algorithm which computes the greatest common divisor of two nonnegative integers. It gains a measure of efficiency over the ancient Euclidean algorithm by replacing divisions and multiplications with shifts, which… … Wikipedia
Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia
