Search Results for ""

The repeated application of a transformation.

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.

The throwing and catching of multiple objects such that at least one is always in the air. Some aspects of juggling turn out to be quite mathematical. The best examples are ...

The security of a cryptosystem must not depend on keeping the cryptographic algorithm secret.

2^(10)=1024 bytes. Although the term kilobyte is sometimes used to refer to 1024 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 kilobyte ...

1000 bytes. Unfortunately, the term is sometimes also used to mean 2^(10)=1024 bytes. However, this usage is deprecated, and the term kibibyte is preferred for 1024 bytes.

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

The order n>=2 L-polyomino consists of a vertical line of n squares with a single additional square attached at the bottom.

A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.