「Integers」の共起表現(1語右で並び替え)

意味
共起
表現

「Integers」の共起表現一覧(1語右で並び替え)

Integers

1語右で並び替え

該当件数:119件

s are arithmetic codes that are named for the integers A and N that are used to encode and decode th
However, enumerated types are equivalent to integers according to the language standards; so the e
t appears that (independent of what the given integers actually are!) we can always mark at least on
Very big integers and rational numbers using the GNU Multi-Prec
Should it say, "has as 0-skeleton the integers and as 1-cells the intervals," perhaps?
suppose we are given a finite set of nonzero integers, and are asked to mark as large a subset as p
g, a concept of abstract algebra generalizing integers and real numbers.
es of edge lengths other than the consecutive integers, and considering turn angles other than 90°.
where ni are any integers and ai are known as the primitive vectors whi
s and therefore for their subsets such as the integers and rational numbers.
the name, that its variables were all 16-bit integers and it was very difficult to write a program
some compile-time syntactic typing (e.g. for integers and reals) as well as some pattern matching c
at absolute addresses, type converters, long integers and other features.
are the theory of real numbers, the theory of integers, and the theories of various data structures
d the practical difficulty of factoring large integers and cracking RSA keys used in cryptography.
But the set of integers and the set of rational numbers (with the sta
Integers and characters are the only available data ty
a and b are positive integers and b is odd ,
by Snowball are strings of characters, signed integers, and boolean truth values, or more simply str
2 appears just once; all larger positive integers appear more than once;
The integers are a discrete ordered ring, but the rational
The fact that consecutive integers are coprime and that a pronic number is the p
d automata, extended with data types (bounded integers, arrays etc.).
tion in C programming language that takes two integers as parameters and returns the result of a div
L. Hakimi independently on realizing a set of integers as a degree sequence of a graph.
sieve agents and inputs into them a stream of integers between 3 and 9999.
e points in the plane (x,y) with x and y both integers between 1 and some N. Make this into a graph
discrete (for example, the states consist of integers between 0 and 3), but continuous, for example
s is a labeling of its vertices with distinct integers between 0 and e inclusive, such that each edg
logarithms and a long table of the first 1000 integers calculated to the 14th decimal place.
Exponentiation to negative integers can be extended to invertible elements of a r
The array of integers characterizing a distance-regular graph is kn
-opened) with a different definition allowing integers, characters, and floating point numbers to be
Mouse may print integers, characters, or string constants, as shown in
It is known that L ≤ 2 for almost all integers d.
All pairs of integers distant n/2 along a (major) diagonal sum to s
f the sum of the reciprocals of a sequence of integers diverges, then the sequence contains arithmet
can be generalized as follows: given n random integers drawn from a discrete uniform distribution wi
ages have notations for atomic values such as integers, floating-point numbers, strings, and boolean
An array of integers, floatingpoint, or character strings of lengt
ill active; it is now working to factor other integers for the mathematical community.
A k-automatic set is a set of non-negative integers for which the sequence of values of its chara
The only triangle with consecutive integers for sides and area has sides (3,4,5) and area
A hash function that maps names to integers from 0 to 15..
list of potential prime numbers starts as all integers from 2 onwards;
n x-fast trie is a data structure for storing integers from a bounded domain.
If the indices are required to be integers from some set {1, 2, ..., n}, a bijection (on
ting the decimal point, the symbol separating integers from decimal fractions, which appears in his
In that case, only the integers greater than 3/2 are solutions: 2, 3, 4, and
or example: the factorial is only defined for integers greater than or equal to zero.
That is, for any integers i and j in a given subset, it is required tha
nacci sequence) in the sense that addition of integers in the inductive definition is replaced with
al sieve is a general algorithm for factoring integers into prime factors.
the other hand, the ordinary ordering on the integers is not dense.
The problem is this: given a set of integers, is there a non-empty subset whose sum is zer
sieving step, at least for 512-bit and larger integers, is the most time consuming step of NFS.
/q : p,q ∈ Z, q≠0}, where Z is the set of all integers, is the set of all rational numbers (Q).
code zero as a single 0. One way to code all integers is to set up a bijection, mapping integers (0
ctangles, such that all m and n are different integers, is the 9 x 13 rectangle, and the tiling uses
ctangles, such that all m and n are different integers, is the 11 x 11 square, and the tiling uses f
But since T' can only contain positive integers, it must be empty too.
family of "harmonic" wavelets indexed by two integers j (the "level" or "order") and k (the "transl
with integers k > m > 0.
cient classical algorithm known for factoring integers larger than 100 digits.
e formally, if N(x) is the number of positive integers less than x which are the sum of two squares,
ry result stating that the number of positive integers less than x that are the sum of two square nu
n triples given an arbitrary pair of positive integers m and n with m > n.
m-indescribable for all positive integers m
m-indescribable for all positive integers m and n.
x of Ω(t) is called finite if m<x<n for some integers m,n, and is called infinite otherwise.
An infinite subset of the integers may be bounded from below or bounded from abo
are uncountable (i.e, more numerous than the integers) may be expressed in terms of this preorder a
For all integers n > 1: Fib(n) is (Fib(n-1) + Fib(n-2)) [recur
it to prove that there exist infinitely many integers n such that n and n+2 have at most nine prime
, where λ is the supremum of jnκ for positive integers n.
e basis is taken of some order in the ring of integers OL of L.
l examples of sanitization include casting to integers or aggressive regular expression replacement.
All useful operators and data types, like integers or addition, are defined in the standard libr
e type system consists of basic types such as integers or floats and five derived types: pointers, a
p variants are often taken to be non-negative integers, or even required to be so, e.g. , but the re
for instance the set of the first n positive integers, or the sign set {+, −}.
measurement; formally, the steps are just the integers or natural numbers, and the random process is
the positive integers, ordered by divisibility (number of prime fac
The non-negative integers, ordered by divisibility.
l; if Ω were rational, then there would exist integers p and q such that
tions, defined by the client, both taking two integers r, s between a and b.
It operates on signed integers, rational numbers, floating point numbers, co
data types in the language include booleans, integers, reals, characters, strings, and arrays.
by an (n-1)-polytope with edges labeled with integers, representing the number of sides of the poly
It supported Integers, Single and Double precision floating point a
k'in and Haab' only count a number of days as integers so they are precise but isn't this also redun
data is a array of integers SORTED in ASCENDING order,
int numbers, with values equal to a series of integers starting at 0.
For strings labeled by the positive integers, string-nets are the spin networks studied in
e between a and b children, where a and b are integers such that .
Bi are formulae, and n and k are nonnegative integers, that is, the left-hand-side or the right-han
antiated variable and Dims a list of positive integers that specifies the dimensions of the array.
Over the set of positive integers, the relationship R holds over the pairs {(1,
As an example, in the set of integers, the chain −1, −2, −3, ... is an infinite des
For non-positive integers, the Gamma function is not defined.
nment of finitely many colors to the positive integers, there exist arbitrarily large sets of intege
In integers this row is represented as
ake the real line R and identify the set Z of integers to a point.)
nment of labels, traditionally represented by integers, to the edges or vertices, or both, of a grap
ithin the CoC, to define functions from, say, integers to types, types to types as well as functions
er's totient function φ; it will map positive integers to non-negative integers.
for coprime integers u, v with v > u.
The monoid (Z, +, 0) of integers under addition is a reduct of the group (Z, +
respondence between a sequence of 16 bits and integers values from -32,768 to +32,767 through a two'
If a sum of integers were desired the expression would be just sum
refore, only to consider square free positive integers, when speaking about congruent numbers.
ese primes (and 2) occur as norms of Gaussian integers, while other primes do not.
r, it is possible that two previously unequal integers will be identical modulo 9 (on average, a nin
gorithm, meaning that it is only suitable for integers with specific types of factors; it is the sim
king all sets from S together with the set of integers Z and the set of positive real numbers R+, or