Search Results for ""

Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...

Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...

There are several results known as the Morgado identity. The first is (1) where F_n is a Fibonacci number and L_n is a Lucas number (Morgado 1987, Dujella 1995). A second ...

In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...

A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...

A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...

An odd permutation is a permutation obtainable from an odd number of two-element swaps, i.e., a permutation with permutation symbol equal to -1. For initial set {1,2,3,4}, ...

The ordinary Onsager equation is the sixth-order ordinary differential equation (d^3)/(dx^3)[e^x(d^2)/(dx^2)(e^x(dy)/(dx))]=f(x) (Vicelli 1983; Zwillinger 1997, p. 128), ...

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...