  We show in this note that the average number of terms in the optimal
double-base number system is in Omega(n / log n). The lower bound matches the
upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp.
2008).
