The Etymologicum Magnum presents a medieval learned pseudo-etymology, explaining Aphrodite as derived from the compound habrodiaitos (" she who lives delicately " from habros + diaita ) explaining the alternation between b and ph as a " familiar " characteristic of Greek " obvious from the Macedonians ".

S ( a, b )=( nc + me / m + n, nd + mf / m + n )

In general, if y = f ( x ), then it can be transformed into y = af ( b ( x − k )) + h. In the new transformed function, a is the factor that vertically stretches the function if it is greater than 1 or vertically compresses the function if it is less than 1, and for negative a values, the function is reflected in the x-axis.

Binary operations are often written using infix notation such as a * b, a + b, a · b or ( by juxtaposition with no symbol ) ab rather than by functional notation of the form f ( a, b ).

Every Boolean algebra ( A, ∧, ∨) gives rise to a ring ( A, +, ·) by defining a + b := ( a ∧ ¬ b ) ∨ ( b ∧ ¬ a ) = ( a ∨ b ) ∧ ¬( a ∧ b ) ( this operation is called symmetric difference in the case of sets and XOR in the case of logic ) and a · b := a ∧ b. The zero element of this ring coincides with the 0 of the Boolean algebra ; the multiplicative identity element of the ring is the 1 of the Boolean algebra.

According to the theorem, it is possible to expand the power ( x + y )< sup > n </ sup > into a sum involving terms of the form ax < sup > b </ sup > y < sup > c </ sup >, where the exponents b and c are nonnegative integers with, and the coefficient a of each term is a specific positive integer depending on n and b. When an exponent is zero, the corresponding power is usually omitted from the term.

For given nonzero integers a and b there is a nonzero integer of minimal absolute value among all those of the form ax + by with x and y integers ; one can assume d > 0 by changing the signs of both s and t if necessary.

Now the remainder of dividing either a or b by d is also of the form ax + by since it is obtained by subtracting a multiple of from a or b, and on the other hand it has to be strictly smaller in absolute value than d. This leaves 0 as only possibility for such a remainder, so d divides a and b exactly.

If c is another common divisor of a and b, then c also divides as + bt