Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Polynomial greatest common divisor (view)

searching for Greatest common divisor 30 found (311 total)

LADSPA (234 words) [view diff] case mismatch in snippet view article find links to article

Technology. LADSPA is unusual in that it attempts to provide only the "Greatest Common Divisor" of other standards. This means that its scope is limited, but

Gödel (programming language) (324 words) [view diff] exact match in snippet view article

other tasks. The following Gödel module is a specification of the greatest common divisor (GCD) of two numbers. It is intended to demonstrate the declarative

Converse nonimplication (716 words) [view diff] exact match in snippet view article find links to article

join operator and ∧ {\displaystyle \scriptstyle {_{\wedge }}\!} (greatest common divisor) as meet operator, build a Boolean algebra. r ↚ ( q ↚ p ) = ( r

Löschian number (302 words) [view diff] exact match in snippet view article find links to article

{\displaystyle (x^{2}+xy+y^{2})} is even only if x and y are both even. The greatest common divisor and the least common multiple of any two or more Löschian numbers

Combinatorica (412 words) [view diff] exact match in snippet view article find links to article

problem on common divisors M. Szegedy: The solution of Graham's greatest common divisor problem, Combinatorica, 6(1986), 67–71. Éva Tardos's paper, awarded

ALTRAN (792 words) [view diff] case mismatch in snippet view article find links to article

{\frac {\partial }{\partial y}}(2x+5xy^{2}-3y^{3})=10xy-9y^{2}} Greatest Common Divisor D = GCD(A, B) G C D ( x 2 − y 2 , x 2 + 2 x y + y 2 ) = x + y {\displaystyle

Julian Sochocki (457 words) [view diff] case mismatch in snippet view article find links to article

теорiи делимости алгебраическихъ чиселъ (The Principle of the Greatest Common Divisor Applied to Divisibility Theory of Algebraic Numbers) (1893), JFM 25

TI-36 (1,401 words) [view diff] exact match in snippet view article find links to article

functions over TI-36X II include: Math: Least common multiple, Greatest common divisor, Prime factors (from TI-Collège Plus), Summation, Product Number

Mikhail Ostrogradsky (1,068 words) [view diff] exact match in snippet view article find links to article

y-1} respectively. Third, S ( x ) {\displaystyle S(x)} is the greatest common divisor of P ( x ) {\displaystyle P(x)} and P ′ ( x ) {\displaystyle P'(x)}

List of finite simple groups (1,789 words) [view diff] exact match in snippet view article find links to article

with the restrictions noted. The notation (a,b) represents the greatest common divisor of the integers a and b. Simplicity: Simple for p a prime number

Pathological (mathematics) (2,386 words) [view diff] exact match in snippet view article

the number of their intersections is valid, if their polynomial greatest common divisor is a constant. A meromorphic function is a ratio of two well-behaved

Fracton (subdimensional particle) (6,174 words) [view diff] exact match in snippet view article

1+(1+\omega ^{2}x)^{L})_{\mathbb {F} _{4}})-2.} Here, gcd denotes the greatest common divisor of the three polynomials shown, and deg refers to the degree of

Canonical bundle (2,548 words) [view diff] exact match in snippet view article find links to article

F_{i}=m_{i}F_{i}^{'}} where m i > 1 {\displaystyle m_{i}>1} is greatest common divisor of coefficients of the expansion of F i {\displaystyle F_{i}} into

FastCode (1,790 words) [view diff] case mismatch in snippet view article find links to article

Floor64 (Returns the smallest near 64 bit integer number.) GCD32 (Greatest Common Divisor 32 bit) IDCT (Inverse Discrete Cosine Transform) Int64Div (Divides

Elliptic surface (1,883 words) [view diff] exact match in snippet view article find links to article

integer mi at least 2 and a divisor Di whose coefficients have greatest common divisor equal to 1, and L is some line bundle on the smooth curve S. If

Conway polynomial (finite fields) (1,571 words) [view diff] exact match in snippet view article

C5,3(x126) = x378 + 3x126 + 3. It therefore must divide their greatest common divisor, x126 + x105 + 2x84 + 3x42 + 2, which factorizes into 21 degree-6

The Art of Computer Programming (3,782 words) [view diff] case mismatch in snippet view article find links to article

Conversion 4.5. Rational Arithmetic 4.5.1. Fractions 4.5.2. The Greatest Common Divisor 4.5.3. Analysis of Euclid's Algorithm 4.5.4. Factoring into Primes

Trace zero cryptography (1,488 words) [view diff] exact match in snippet view article find links to article

of J C ( F q ) {\displaystyle J_{C}(\mathbb {F} _{q})} . If the greatest common divisor gcd ( n , | J C ( F q ) | ) = 1 {\displaystyle \gcd(n,|J_{C}(\mathbb

List of named matrices (1,336 words) [view diff] exact match in snippet view article find links to article

{\displaystyle n\times n} matrix ( S ) {\displaystyle (S)} having the greatest common divisor ( x i , x j ) {\displaystyle (x_{i},x_{j})} as its i j {\displaystyle

Multiset (4,850 words) [view diff] exact match in snippet view article find links to article

Intersection: the intersection (called, in some contexts, the infimum or greatest common divisor) of A and B is the multiset C with multiplicity function m C (

JavaScript (9,355 words) [view diff] exact match in snippet view article find links to article

appropriately gcd: function() { // method that calculates the greatest common divisor // Euclidean algorithm: let a = Math.abs(this.a), b = Math.abs(this

Complex reflection group (2,292 words) [view diff] exact match in snippet view article find links to article

an irreducible reflection group is cyclic of order equal to the greatest common divisor of the degrees. The order of a complex reflection group is the

History of computing (6,591 words) [view diff] exact match in snippet view article find links to article

even proven. See, for example, Euclid's algorithm for finding the greatest common divisor of two numbers. By the High Middle Ages, the positional Hindu–Arabic

Partition function (number theory) (4,364 words) [view diff] exact match in snippet view article

(the density of a finite set is zero). If A has k elements whose greatest common divisor is 1, then p A ( n ) = ( ∏ a ∈ A a − 1 ) ⋅ n k − 1 ( k − 1 ) !

Attention (machine learning) (5,371 words) [view diff] case mismatch in snippet view article

Retrieved 2024-04-07. Charton, François (2023). "Learning the Greatest Common Divisor: Explaining Transformer Predictions". arXiv:2308.15594 [cs.LG]

Synthetic division (4,580 words) [view diff] exact match in snippet view article find links to article

out[separator:] # Return quotient, remainder. Euclidean domain Greatest common divisor of two polynomials Gröbner basis Horner scheme Polynomial remainder

Algebraic curve (7,984 words) [view diff] exact match in snippet view article find links to article

loss of generality, we may suppose that d is coprime with the greatest common divisor of the n such that ⁠ a n ≠ 0 {\displaystyle a_{n}\neq 0} ⁠ (otherwise

Fermat's theorem on sums of two squares (6,605 words) [view diff] exact match in snippet view article find links to article

{\displaystyle r_{0},r_{1},r_{2},\dots ,r_{n}} that end with the greatest common divisor r n = gcd ( r 0 , r 1 ) {\displaystyle r_{n}=\gcd(r_{0},r_{1})}

Binary quadratic form (4,936 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Delta =b^{2}-4ac} . The content, equal to the greatest common divisor of a, b, and c. Terminology has arisen for classifying classes

Burst error-correcting code (9,235 words) [view diff] exact match in snippet view article find links to article

-1}+1\right)=1.} Proof Let d ( x ) {\displaystyle d(x)} be the greatest common divisor of the two polynomials. Since p ( x ) {\displaystyle p(x)} is irreducible