Search Results for ""

The function intx gives the integer part of x. In many computer languages, the function is denoted int(x). It is related to the floor and ceiling functions |_x_| and [x] by ...

The variable phi (also denoted am(u,k)) used in elliptic functions and elliptic integrals is called the amplitude (or Jacobi amplitude). It can be defined by phi = am(u,k) ...

An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...

In general, it is possible to link two n-dimensional hyperspheres in (n+2)-dimensional space in an infinite number of inequivalent ways. In dimensions greater than n+2 in the ...

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 ...

Legendre's constant is the number 1.08366 in Legendre's guess at the prime number theorem pi(n)=n/(lnn-A(n)) with lim_(n->infty)A(n) approx 1.08366. Legendre first published ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...