Search results

...mber which is not algebraic: that is, does not satisfy any polynomial with integer or rational coefficients.

A digital [[circuit]] that performs integer [[addition]] in the [[Arithmetic Logic Unit]] in a [[computer]].

The number of positive integer divisors of a given number.

...tion an + bn = cn has no solutions in positive integers a, b, c if n is an integer greater than 2.

...nction whose value is the sum of all positive divisors of a given positive integer.

A real number and is the integer between 1 and -1, which signifies a value of nothing.

...maximize a real function by systematically choosing the values of real or integer variables from within an allowed set.

The assignment of data types (such as integer or string) to variables at the time of execution of a computer program, rat

...uations and the theory of distributions, by generalising the concept of an integer index to a vector of indices.

...f 27 data types with tag values starting with 1; for example, Boolean (1), integer (2), and bit string (3).

* [http://branchandcut.org/ COIN-OR SYMPHONY] - integer programming software, [[Common Public License]] *[[MINTO]] - integer programming solver using branch and bound algorithm. Freeware for personal

...rder''' of a [[group (mathematics)|group]] element is the least positive [[integer]] (if one exists) such that raising the element to that power gives the [[i The '''exponent''' of a group is the least positive [[integer]] (if one exists) such that raising any element of the group to that power

...number]] ''p'' is a [[divisor]] of the [[multiplication|product]] of two [[integer]]s, ''ab'', then either ''p'' is a divisor of ''a'' or ''p'' is a divisor o ...and ''q'' are [[relatively prime]] integers and that ''p''|''kq'' for some integer ''k''. Then ''p''|''k''.

For a group, its cardinality; for an element of a group, the least positive integer (if one exists) such that raising the element to that power gives the ident

...ely prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i=1,2, …, n.

An adder is a [[digital circuit]] designed to perform [[integer]] [[addition]] in the Arithmetic Logic Unit on board a computer. These circ *Where ''n'' is an integer from zero to (base - 1)

...teger. This concept is symbolized by an exclamation point after the given integer, such as <math>5! \ </math>. The fraction in this formula will always reduce to an integer, because each of the factors in the denominator is also a factor of the num

...tional relation between a part and the whole consisting of a numerator (an integer — the part) and a denominator (a natural number — the whole).

.../math> and <math>x</math> and <math>y</math> represent the smallest such [[integer|integers]] (i.e., they are [[mutually prime]]). ...; therefore <math>x</math> must also be even. This means that there is an integer <math>k</math> such that <math>x = 2 \times k</math>. Inserting it back int

...ometry]] a '''divisor''' on an [[algebraic variety]] is a formal sum (with integer coefficients) of [[subvariety|subvarieties]]. An '''effective divisor''' is a sum with non-negative integer coefficients.