Search Results for ""

Define the juggler sequence for a positive integer a_1=n as the sequence of numbers produced by the iteration a_(k+1)={|_a_k^(1/2)_| for even a_k; |_a_k^(3/2)_| for odd a_k, ...

The partial differential equation 3/4U_y+W_x=0, (1) where W_y+U_t-1/4U_(xxx)+3/2UU_x=0 (2) (Krichever and Novikov 1980; Novikov 1999). Zwillinger (1997, p. 131) and Calogero ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

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

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

Cubic lattice sums include the following: b_2(2s) = sum^'_(i,j=-infty)^infty((-1)^(i+j))/((i^2+j^2)^s) (1) b_3(2s) = ...

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

Lehmer (1938) showed that every positive irrational number x has a unique infinite continued cotangent representation of the form x=cot[sum_(k=0)^infty(-1)^kcot^(-1)b_k], (1) ...