小窓モード

プレミアム

ログイン
設定

設定

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

該当件数 : 36



s, so what exactly constitutes the result of a modulo operation depends on the programming language
addition modulo 232 and addition over GF(2)) and where input a
hash functions for any table size s, either by modulo reduction or by bit masking.
ence involve divisions between residue classes modulo n, which can be performed using the extended E
over equivalence classes (congruence classes) modulo n.
he manifold is orientable, and in coefficients modulo 2, otherwise.
ger N by working in an algebraic group defined modulo N whose group structure is the direct sum of t
ation by a single bit has a simple description modulo 3. Analysis of other operations (data dependen
It shall be the remainder of the division ( modulo 2) by the generator polynomial multiplied by t
of the vertices is twice the sum of the edges, modulo p.
Entries equal ( modulo N) to 0, 1, and N−1 are not permitted, since t
that their electric charges must all be equal modulo 1.
e electric charges of dyons must all be equal, modulo one, to the product of their magnetic charge a
es to adding exponents of their prime factors, modulo 2, as we can distinguish squares from non-squa
sely, the density determines the wave function modulo a phase factor, providing the formal foundatio
element which is not the identity of the group modulo N, but is the identity modulo one of the facto
previously unequal integers will be identical modulo 9 (on average, a ninth of the time).
rs between the square brackets are interpreted modulo N, where N is the number of vertices.
set of isomorphism classes of Legendrian knots modulo negative Legendrian stabilizations is in bijec
upper bound for the least quadratic nonresidue modulo N. Character sums are often closely linked to
hematics this can be expressed as (year number modulo 19) +1.)
s with multiple inheritance), pattern-matching modulo equations, E-strategies (user control over laz
All index arithmetic is performed modulo 5 or w.
it, and hope the least non-negative remainder modulo n is a perfect square (in the integers).
he same digit sum and hence the same remainder modulo 9. Therefore the result of each iteration of K
uires knowing whether t is a quadratic residue modulo N, and there are no known methods for doing th
Conversely, because finding square roots modulo a composite number is probabilistic polynomial
properties of binary addition and bit rotation modulo a Fermat prime.
s as being true is known as the satisfiability modulo theories problem.
Bowditch also proved that ( modulo a few exceptions) the boundary of a one-ended
ider Fibonacci integer sequences and take them modulo n, or put differently, consider Fibonacci sequ
bounds of zero or 65535 (0xFFFF) will undergo modulo 64K operation just as any normal 16 bit operat
field, whose Galois group over Q is the units modulo m (and thus is abelian, so conjugacy classes b
be the cohomology of X modulo torsion.
                                                                                                    


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS