integer

(redirected from Integer number)
Also found in: Dictionary, Thesaurus, Legal.
Related to Integer number: rational number, real number, whole number

integer:

see numbernumber,
entity describing the magnitude or position of a mathematical object or extensions of these concepts. The Natural Numbers

Cardinal numbers describe the size of a collection of objects; two such collections have the same (cardinal) number of objects if their
..... Click the link for more information.
; number theorynumber theory,
branch of mathematics concerned with the properties of the integers (the numbers 0, 1, −1, 2, −2, 3, −3, …). An important area in number theory is the analysis of prime numbers.
..... Click the link for more information.
.

integer

[′int·ə·jər]
(mathematics)
Any positive or negative counting number or zero.

integer

any rational number that can be expressed as the sum or difference of a finite number of units, being a member of the set …--3, --2, --1, 0, 1, 2, 3…

integer

(mathematics)
(Or "whole number") One of the finite numbers in the infinite set

..., -3, -2, -1, 0, 1, 2, 3, ...

An inductive definition of an integer is a number that is either zero or an integer plus or minus one. An integer is a number with no fractional part. If written as a fixed-point number, the part after the decimal (or other base) point will be zero.

A natural number is a non-negative integer.

integer

A whole number. In programming, sending the number 123.398 to an integer function would return 123. Integers can be signed (positive or negative) or unsigned (always positive). If signed, the leftmost bit is used as the sign bit, and the maximum value of each sign is thus cut in half. For example, an 8-bit unsigned integer stores the values 0 to 255, whereas an 8-bit signed integer can store -128 to +127. See integer arithmetic and floating point.
References in periodicals archive ?
Eventually, Lehmer's algorithm can be efficiently implemented (in hardware or software) to compute both GCD and LCM operations for any two large integer numbers.
A continuous function f : [bar.[q.sup.Z]] x X [right arrow] X is said to be almost automorphic in t [member of] [bar.[q.sup.Z]] for each x [member of] X, if, for each sequence of integer numbers {[s'.sub.n]}, there exists a subsequence {[s.sub.n]} such that
k is an integer number, thus h = 29 is an Inverse Sequence.
f) [x.sub.1], [x.sub.2]--bounded if [I.sub.1] = L, L > 0, [I.sub.2] = K, K [member of] R is the constant K + u([t.sub.0]) [not equal to] k[pi]/2], k [member of] Z is the integer number (Macura, 2005).
Each firm chooses a wage (integer number of red cards offered in exchange for a single black card), which is written in column I of the record sheet below.
A rule instantiation is defined as a substitution for each variable in the rule of an integer number. In step (i, j), if there is no intensional name of rank i, program R stops.
Furthermore, Solver allows us to take care of such practical considerations as prices must be in integer pennies and order quantities must be integer numbers. We also identify an inconsistency in the optimal decisions recommended by Abad's (2003) model for the two situations it addresses.
Consequently, for all positive odd integer number n, H(n) = 1 is true if and only if n = 1, 3, the inequality H(n) < 8 is true if and only if n = 1, 3, 5, 7, 9, 11, 13, 15, 21, 27, 33, 35, 39, 45, 63, 105.
For any positive integer number q > 3, let [chi] denote a Dirichlet character modulo q.
For any integer number n [greater than or equal to] 1, we have the estimate:
If the integer number is a one-digit number, then function bld returns zero:
For any integer number x [greater than or equal to] 1, we have the asymptotic formula