Search Results for ""

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

In functional analysis, the Lax-Milgram theorem is a sort of representation theorem for bounded linear functionals on a Hilbert space H. The result is of tantamount ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

Legendre's conjecture asserts that for every n there exists a prime p between n^2 and (n+1)^2 (Hardy and Wright 1979, p. 415; Ribenboim 1996, pp. 397-398). It is one of ...