- integer constant
-
целочисленная константа
Англо-русский словарь технических терминов. 2005.
Англо-русский словарь технических терминов. 2005.
Constant folding — and constant propagation are related compiler optimizations used by many modern compilers. An advanced form of constant propagation known as sparse conditional constant propagation can more accurately propagate constants and simultaneously remove … Wikipedia
Integer sequence prime — In mathematics, an integer sequence prime is a prime number found as a member of an integer sequence. For example, the 8th Delannoy number, 265729, is prime. A challenge in empirical mathematics is to identify large prime values in rapidly… … Wikipedia
Integer overflow — In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is larger than can be represented within the available storage space. For instance, adding 1 to the largest value that can be … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Constant Q transform — In mathematics and signal processing, the Constant Q Transform transforms a data series to the frequency domain, and is related to the Fourier Transform [1]. The transform can be thought of as a series of logarithmically spaced filters, with the… … Wikipedia
Integer square root — In number theory, the integer square root (isqrt) of a positive integer n is the positive integer m which is the greatest integer less than or equal to the square root of n ,: mbox{isqrt}( n ) = lfloor sqrt n floor.For example, mbox{isqrt}(27) =… … Wikipedia
Constant problem — In mathematics, the constant problem is the problem of deciding if a given expression is equal to zero. Contents 1 The problem 2 Results 3 See also 4 References … Wikipedia
Integer factorization records — Numbers of a general form = The first very large distributed factorisation was RSA129, a challenge number described in the Scientific American article of 1977 which first popularised the RSA cryptosystem. It was factorised between September 1993… … Wikipedia
Mathematical constant — A mathematical constant is a special number, usually a real number, that is significantly interesting in some way .[1] Constants arise in many different areas of mathematics, with constants such as e and π occurring in such diverse contexts as… … Wikipedia
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
Hollerith constant — Hollerith constants, named in honor of Herman Hollerith, were used in early FORTRAN programs to allow manipulation of character data.Early FORTRAN had no CHARACTER data type; only numeric types. In order to perform character manipulation,… … Wikipedia