Search Results for ""

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space, and if X=I is taken as the ...

The Lorentz group is the group L of time-preserving linear isometries of Minkowski space R^((3,1)) with the Minkowski metric dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2 ...

A semi-Riemannian manifold M=(M,g) is said to be Lorentzian if dim(M)>=2 and if the index I=I_g associated with the metric tensor g satisfies I=1. Alternatively, a smooth ...

Let I be a set, and let U be an ultrafilter on I, let phi be a formula of a given language L, and let {A_i:i in I} be any collection of structures which is indexed by the set ...

11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...

The set of L^p-functions (where p>=1) generalizes L2-space. Instead of square integrable, the measurable function f must be p-integrable for f to be in L^p. On a measure ...

A Lucas chain for an integer n>=1 is an increasing sequence 1=a_0<a_1<a_2<...<a_r=n of integers such that every a_k, k>=1, can be written as a sum a_k=a_i+a_j of smaller ...

The Lucas cubic is a pivotal isotomic cubic having pivot point at Kimberling center X_(69), the isogonal conjugate of the orthocenter, i.e., the locus of points P such that ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...