Übersetzung für "Common divisor" in Deutsch

The GCD is also known as the greatest common factor (gcf), highest common factor (hcf), greatest common measure (gcm), or highest common divisor.

Grandpa sometimes called me the Smallest Common Divisor.

The largest common divisor for these frequencies is again the frequency 24 kHz.

You just find the greatest common divisor of the number of atoms in the molecule.

The numbers all have a common divisor.

Examples: The three polynomials have the greatest common divisor 2*x-3 .

What is the greatest common divisor/factor of 18 and 24?

One way to compute a Padé approximant is via the extended Euclidean algorithm for the polynomial greatest common divisor.

It is preferable in this respect that the communications cycle time be the largest common divisor of the various refreshment cycle times.

In addition to arithmetic operations the calculator calculates greatest common divisor and least common multiple.

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number.

In addition, the number of compartments 33 and the number of filters 37 is selected so that these numbers do not have a common integer divisor.

Since the secular frequencies in the r-direction and in the z-direction and the storage frequency have a common divisor only in rare situations, the motional images of the ions are usually extremely complicated.

This time granularity is a common divisor of the durations of all possible DL-PDUs.

An access sequence with FB=2 can be achieved by an arrangement according to FIG. 1 when cyclical shift registers are employed as a row selection unit and as a column selection means, when the clock ratio CLKZ/CLKS=0.5 applies and the conditions S MOD FB=0 and GGT(Z,S/FB)=1 are adhered to with respect to the memory dimensioning. GGT denotes the greatest common divisor and MOD denotes the modulo function.

A continuous inscription, in other words each dot is exposed exactly once, is especially possible when the number of image points n and their spatial interval l, measured in units of the pitch distance p of the dots, do not have a common divisor.

For the purpose to make sure that the pressure drop becomes not too great and the full impact energy is at disposal if a plurality of perforations are provided in the distributing slide valve at equal distances in direction of the circumference and if a plurality of connections for the passages to the individual bit holders is equally distributed at equal distances along the circumference, the construction of the distributing slide valve is advantageously such that the greatest common divisor of the number of perforations of the distributing slide valve and of the number of passages of the cutting head connectable to said perforations is 2 to 5, preferably 3, noting that the passages as well as the perforations are each arranged at equal distances in direction of the circumference.

If I wrote this as H2O1, what's the greatest common divisor of 2 and 1?

So, that's why they're saying "...the greatest common divisor of one..."

So the greatest common divisor is six, and six is obviously six, you divide both of these by six and you get the empirical formula.

A digital word generator for automatically generating periodically appearing continuous characters from n-bit words of all word sizes and permutations thereof, comprising a read-only memory provided with means effective during a test signal cycle of all possible 2n word sizes and permutations thereof of a n-bit word for successively reading out only n-bit words of an essentially smaller number z, and means for obtaining the remaining permutations in accordance with the relation (2n -z) by adding to the periodic part a framing bit sequence which determines said test signal cycle and has a length which does not have a common divisor with n so that in n test signal cycles successively all n possible cyclic permutations of binary digits of words provided in said read-only memory are generated.

Function: content (p_1, x_1,..., x_n) Returns a list whose first element is the greatest common divisor of the coefficients of the terms of the polynomial p_1 in the variable x_n (this is the content) and whose second element is the polynomial p_1 divided by the content.

In particular book seven is a self-contained introduction to number theory and contains the Euclidean algorithm for finding the greatest common divisor of two numbers.