Centralized data d items may be extracted from the total number of rules

R=3^{d}-2^{d+1}+1

A simple proof under.

All items into three parts: the front piece after piece, there are invisible. Obviously a term only and must be present in one part of the three. With this upper bound 3^{d}.

Obviously some of which it is unreasonable.

Antecedent rule for the space-time, the rules after piece is empty, you have to 2^{d}. So minus 2 times it is repeated subtracted plus 1 (representative of the front member, the rear member are empty rule).

Q.E.D.

Conclusion: The combination of math is really important ah.

Guess you like

Origin blog.csdn.net/Chenyun__/article/details/92123305