Search Results for ""

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...

The Laplace transform is an integral transform perhaps second only to the Fourier transform in its utility in solving physical problems. The Laplace transform is particularly ...

The lemniscate, also called the lemniscate of Bernoulli, is a polar curve defined as the locus of points such that the the product of distances from two fixed points (-a,0) ...

A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...