Search Results for ""

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

The turning of an object or coordinate system by an angle about a fixed point. A rotation is an orientation-preserving orthogonal transformation. Euler's rotation theorem ...

An intrinsic property of a mathematical object which causes it to remain invariant under certain classes of transformations (such as rotation, reflection, inversion, or more ...

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

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

A second-order linear Hermitian operator is an operator L^~ that satisfies int_a^bv^_L^~udx=int_a^buL^~v^_dx. (1) where z^_ denotes a complex conjugate. As shown in ...