Werbung
⇄Suchrichtung
Übersetzung für ''B'' von Englisch nach Deutsch
Neue Wörterbuch-Abfrage: Einfach jetzt tippen!

• Bor {n} <B> = boron <B>
• Byte {n} <B> = byte <B>
• B-Säule {f} = B-pillar
alle anzeigen ...
Anwendungsbeispiele Englisch
• The specialization preorder on the Sierpiński space {"a","b"} with {"b"} open is given by: "a" ≤ "a", "b" ≤ "b", and "a" ≤ "b".
• In matrix algebra (or linear algebra in general), one can define a pseudo-division, by setting "a"/"b" = "ab"+, in which "b"+ represents the pseudoinverse of "b". It can be proven that if "b"−1 exists, then "b"+ = "b"−1. If "b" equals 0, then b+ = 0.
• The system {"b" → "a", "b" → "c", "c" → "b", "c" → "d"} (pictured) is an example of a weakly normalizing but not strongly normalizing system. "a" and "d" are normal forms, and "b" and "c" can be reduced to "a" or "d", but the infinite reduction "b" → "c" → "b" → "c" → ... means that neither "b" nor "c" is strongly normalizing.
• "Symmetric property": For any quantities "a" and "b", if "a" = "b", then "b" = "a".
• E.g., in the third case: translation by an amount "b" changes "x" into "x" + "b", reflection with respect to 0 gives−"x" − "b", and a translation "a" gives "a" − "b" − "x".

• We prove commutativity ("a" + "b" = "b" + "a") by applying induction on the natural number "b". First we prove the base cases "b" = 0 and "b" = "S"(0) = 1 (i.e. we prove that 0 and 1 commute with everything).
• If "A" and "B" are sets, then there is a set "A"×"B" which consists of all ordered pairs ("a", "b") of elements "a" of "A" and "b" of "B".
• Finally, we evaluate r(B) to obtain our final answer. This is straightforward since B is a power of "b" and so the multiplications by powers of B are all shifts by a whole number of digits in base "b". In the running example b = 104 and B = b2 = 108.
• The least common multiple of two integers "a" and "b" is denoted as lcm("a", "b"). Some older textbooks use "b".
• For "a", "b" in "L" we write "b" for the closed interval with bounds "a" and "b": {"x" ∈ "L" | "a" ≤ "x" ≤ "b"}. If "a" ≤ "b", then [...] "b", ≤ [...] is a complete lattice.

• If there are already "a'p" and "a'q" in "A" corresponding to "b'p" and "b'q" in "B" respectively such that "a'p" < "a'i" < "a'q" and "b'p" < "b'q", we choose "b'j" in between "b'p" and "b'q" using density. Otherwise, we choose a suitable large or small element of "B" using the fact that "B" has neither a maximum nor a minimum. Choices made in step (2) are dually possible. Finally, the construction ends after countably many steps because "A" and "B" are countably infinite. Note that we had to use all the prerequisites.
• This result was strengthened to show that there are infinitely many runs of 2"b" consecutive "b"-harshad numbers for "b" = 2 or 3 by [...] and for arbitrary "b" by Brad Wilson in 1997.
• Consider A, B and C to be "n"/"b"-by-"n"/"b" matrices of "b"-by-"b" sub-blocks where b is called the block size; assume three "b"-by-"b" blocks fit in fast memory.
• 10"b" = "b" for any base "b", since 10"b" = 1×"b"1 + 0×"b"0. For example, 102 = 2; 103 = 3; 1016 = 1610. Note that the last "16" is indicated to be in base 10. The base makes no difference for one-digit numerals.
Werbung