# integer

(redirected from Set of integers)
Also found in: Dictionary, Thesaurus, Legal, Acronyms.

## 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
; 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.
.

## integer

[′int·ə·jər]
(mathematics)
Any positive or negative counting number or zero.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

## 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…
Collins Discovery Encyclopedia, 1st edition © HarperCollins Publishers 2005

## 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.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
[n.summation over (j = 1)][1/[2.sup.j]] = x - [1/[2.sup.n]] has been derived for the equation x = y, where x = [1/[2.sup.k]], i = k + 1 (k [member of] Z, set of integers).
- 1 }, G is the group consisting of the same set of integers under multiplication (mod p), and int is defined as above.
These methods assume a universe that is the set of integers {1, .
Let Z the set of integers, i = [square root of -1] and Z[i] = {a + bi| a, b [member of] Z}.
It is fairly easy to show that if one has a prime number p, then the set of integers less than p (excluding 0) forms a group under multiplication mod p.
Let us first define precisely the normalization process: for any integer n, set of integers S of size k [less than or equal to] n, and i [member of] [n + 1]\S, we define [[pi].sub.S](i) = #{j [less than or equal to] i: j [not member of] S}.
Let [theta] (m, n, a, b) denote the set of integers m1 satisfying the conditions

Site: Follow: Share:
Open / Close