i ia ib ic id ie if ig ih ii ik il im in io ip iq ir is it iu iv iw ix

Перевод: iff

эквивалентность

Тезаурус:

1. These included the H2S and Gee indicators and the IFF Transmitter/Receiver, although some of the boxes did not have connectors attached which will have to be made up.
2. (ii) The polynomial and the above polynomial are said to be equal iff ai = bi for all on-negative integers i.
3. (iii) If a Z is neither 0 nor a unit we say that a is prime iff, whenever a divides a product, that is, abc where b c Z it follows that ab or ac (or both).
4. (ii) If f Qx is neither the zero polynomial 0 nor a unit we say that f is irreducible iff, whenever f is expressed as a product, f = gh with g, h Qx, it follows that either g or h is a unit.
5. Thus, use of iff indicates that a will be called a divisor of b when and only when the required c exists.
6. We say that f divides g (or that f is a divisor of g) and we write fg iff there exists h Qx such that g = fh.
7. We begin with Definition 1.4.1 Let a, b Z. An integer c Z is termed a greatest common divisor (gcd) or highest common factor (hcf) of a and b iff (i) ca and cb and (ii) if da and db then dc.
8. If we know and we say A if and only if B, an assertion we write briefly as or A iff B. Technically all definitions should be in iff form.
9. A non-zero non-unit polynomial f will be called reducible iff it is not irreducible.
10. Combining this definition with 1.4.4 we obtain immediately Theorem 1.4.9 Let a, b Z. Then a and b are relatively prime iff there exist, in Z, integers s and t such that sa + tb = 1.
11. Definition 1.4.8 Two integers a, b are said to be relatively prime (or coprime) iff (a, b) = 1.
12. (ii) If a Z is neither 0 nor a unit we say that a is irreducible iff, whenever a is expressed as a product, a = bc with b, c Z, it follows that either b or c is a unit.