integer

(redirected from Integers)
Also found in: Dictionary, Thesaurus, Medical, Encyclopedia.

Related to Integers: Whole numbers

See: full, impartial, incorruptible, inculpable, individual, intact, inviolate, pure, unadulterated, unblemished, undiminished, unprejudiced, upright, whole

INTEGER. Whole, untouched. Res integra means a question which is new and undecided. 2 Kent, Com. 177.

Mentioned in ?

References in periodicals archive ?

For example, a finite procedure that directly compares f (x) and f (y), where x and y are integers and f is a one-to-one function, [gamma]-compares the two integers x and y, since x = y if and only if f(x) = f(y).

An elegant argument that P [not equal to] NP

The alogrithm here is similar to the algorithm in classical case but we choose the prime [beta] in this case from the domain of gaussian integers.

Public key cryptosystem based on the discrete logarithm problem

For any positive integer n [greater than or equal to] 1, the Pseudo-Smarandache function Z(n) is defined as the smallest positive integer m such that 1 + 2 + .

An equation involving the Pseudo-Smarandache function and F. Smarandache LCM function

It is known that they made a list of useful results on the Rhind papyrus containing the sums of reciprocal integers for fractions of the form 2/N for all odd values of N from 5 to 101 (Wells, 1992).

Fractions

Computing the variance of the 500 randomly generated integers will require calculating and possibly storing the sum of the squares of the 500 integers in memory.

A treatment of computational precision, number representation, and large integers in an introductory Fortran course

SMT solvers work by combining decision procedures for mathematical theories such as linear integer arithmetic with a SAT solver, which assigns a true or false value to all formulas, and these combinations are much more complex and difficult to engineer than a plain SAT solver.

New Class of Formal Software Verification Engines Reaching Maturity

K(2n + 1) - K(2n) = 3n + 2, for any integer n [member of] N.

A note on the near pseudo Smarandache function

This method of memorizing i integers has been applied to one special numeric sequence--one's telephone number.

Mnemonics for number sequences

Although there are infinitely many primes, they are also relatively scarce and rather haphazardly scattered among the integers.

Prime pursuit: constructing an efficient prime number detector

m] are m positive integers, we define the Smarandache additive sequence [D.

On the Smarandache additive sequence

In 1844, Belgian mathematician Eugene Charles Catalan asserted that, among all powers of whole numbers, the only pair of consecutive integers is 8 and 9.

Prime effort: powerful conjecture may be proved. (This Week)

That is, [phi](n) denotes the number of all positive integers not exceeding n which are relatively prime to n.