Übersetzung für 'relatively prime' von Englisch nach Deutsch

relatively prime {adj}

teilerfremdmath.

relativ primmath.

---

Werbung

relatively {adv}

relativ

verhältnismäßig [relativ, ugs.: ziemlich]

relatively unknown {adj}

verhältnismäßig unbekannt

ziemlich unbekannt

relatively little {adj}

relativ klein

relativ wenig

relatively affluent {adj}

relativ wohlhabend

relatively treeless {adj}

baumarm

relatively small {adj}

ziemlich gering

verhältnismäßig klein

relatively well {adv}

relativ gut

relatively {adv} [comparatively]

vergleichsweise

relatively common {adj}

relativ häufig

relatively affluent markets

relativ wohlhabende Absatzmärkte {pl}

relatively low amount

relativ kleiner Betrag {m}

relatively advantageously priced {adj}

relativ günstig [Preis]

relatively modest risk

ziemlich kleines Risiko {n}

relatively short distance

verhältnismäßig kurze Entfernung {f}

to be relatively inexpensive

nicht allzu teuer sein

under relatively dry conditions {adv}

unter relativer Trockenlegung [der Zähne]dent.

• The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses the discrete Fourier transform (DFT) of a size "N" = "N"1"N"2 as a two-dimensional "N"1×"N"2 DFT, but "only" for the case where "N"1 and "N"2 are relatively prime.
• It is not possible to produce a definite test of primality based on whether a number is an Euler pseudoprime because there exist "absolute Euler pseudoprimes", numbers which are Euler pseudoprimes to every base relatively prime to themselves.
• A number "a" relatively prime to an odd prime "p" is a residue modulo any power of "p" if and only if it is a residue modulo "p".
• Two numbers are called relatively prime, or coprime, if their greatest common divisor equals 1. For example, 9 and 28 are coprime.
• } is coprime, but it is not pairwise coprime since 2 and 4 are not relatively prime.

• A modular integer "i" is a generator of this group if "i" is relatively prime to "n", because these elements can generate all other elements of the group through integer addition.
• , is relatively prime to the size of the S array.
• is four, an odd prime power, or twice an odd prime power, then the product of relatively prime integers less than itself add one is divisible by [...].
• 222 is a noncototient, meaning that it cannot be written in the form "n" − φ("n") where φ is Euler's totient function counting the number of values that are smaller than "n" and relatively prime to it.
• are relatively prime then they do not have a common root, for if "a" ∈ "F" was a common root, then "p"("x") and "q"("x") would both be multiples of "x" − "a" and therefore they would not be relatively prime.

• is not relatively prime to [...] , the argument just given is invalid.
• The reciprocal of this number, [...] , is the limiting probability that two random numbers selected uniformly from a large range are relatively prime (have no factors in common).
• , where "p" and "q" are relatively prime, a hyperbolic component of period "q" bifurcates from the main cardioid at a point on the edge of the cardioid corresponding to an internal angle of [...].
• A complex-valued function [...] on "A" is called multiplicative if [...] whenever "f" and "g" are relatively prime.
• Euler's totient function is a multiplicative function, meaning that if two numbers [...] and [...] are relatively prime, then [...].

• integers that are relatively prime to [...] and mutually incongruent under modulus [...] is called a reduced residue system modulo [...].