Search Results for ""
7311 - 7320 of 13131 for eulerstotienttheorem.htmlSearch Results

Given a Farey sequence with consecutive terms h/k and h^'/k^', then the mediant is defined as the reduced form of the fraction (h+h^')/(k+k^').
The plane through the midpoint of a line segment and perpendicular to that segment, also called a mediating plane. The term "mediator" was introduced by J. Neuberg ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a meet-homomorphism, then h is a meet-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.
In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...
A Meeussen sequence is an increasing sequence of positive integers (m_1, m_2, ...) such that m_1=1, every nonnegative integer is the sum of a subset of the {m_i}, and each ...
A large number defined as where the circle notation denotes "n in n squares," and triangles and squares are expanded in terms of Steinhaus-Moser notation (Steinhaus 1999, pp. ...
One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

...