Search Results for ""

J_n(z) = 1/(2pi)int_(-pi)^pie^(izcost)e^(in(t-pi/2))dt (1) = (i^(-n))/piint_0^pie^(izcost)cos(nt)dt (2) = 1/piint_0^picos(zsint-nt)dt (3) for n=0, 1, 2, ..., where J_n(z) is ...

An addition chain for which there is a subset H of members such that each member of the chain uses the largest element of H which is less than the member.

A number n for which a shortest chain exists (which is also a Hansen chain) is called a Hansen number.

Hansen's problem is a problem in surveying described as follows. From the position of two known but inaccessible points A and B, determine the position of two unknown ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...

The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...

The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...