WARNING: OLD DRAFT. Let ||n|| be the smallest number of 1’s needed to make n using addition and multiplication, called the complexity of n. Let L(n) be minm≥n ||m||. Here we classify numbers n satisfying ||n|| = L(n), using a proof different from the one in our forthcoming paper on integer complexity more generally. (Much of the introduction, etc., is copied from

The problem of forming validation regions or gates for new sensor mea surements obtained when tracking targets in clutter is considered Target dynamics and measurement characteristics are modeled with possible non Gaussianities or nonlinearities so that some degree of approximation is usually required in the computation of the ltering densities for the target position and predictive densities f...