What does Creative Fatigue and Orthogonal Remixing conclude, in numbers, about “Classical Sources: the Changes of Five Notes, the Art of Combination and Nothing New Under the Sun”?

Answer: Leibniz's count is correct. The question is what it is used to count. The non-empty subsets of 12 shots number 4,095, but a valid creative must take exactly one shot from each of the four modules, and there are only 81 such combinations, 0.0198 of all the subsets. If the order of the four modules may also vary, there are 1,944; multiplied by two cut lengths, 3,888. These numbers show that "a hundred creatives" or even "a thousand" is easy to reach by counting. What is hard is that most combinations are structurally invalid, and many of the valid ones repeat one another in the viewer's perception.

Scope of the numbers: Parameters are illustrative; all calculations come from the book's programs. This is general business analysis, not individual advice, and promises no advertising result.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.0198, 12, 1944, 3888, 4095, 81

n things complexions 2^n-1 check by enumeration
11 1
23 3
37 7
415 15
531 31
663 63
five notes, melodies of length 4625; length 8: 390,625
12 shots: non-empty subsets 4,095; valid storyboards 81
valid share of all complexions 0.0198
with module order free1,944; with 2 cut lengths: 3,888
distinct opening hooks a viewer meets first3
Show the full program
# Chapter 7. p71: Sunzi's five notes and Leibniz's complexions, counted
# Leibniz (1666), Definition 7: four things can be joined in 15 ways,
# i.e. all non-empty subsets, 2^n - 1. Sunzi: five notes, yet their
# changes cannot all be heard: melodies of length L number 5^L.
# Then the storyboard: 12 shots, but a valid creative takes exactly one
# shot from each of the four modules.
import itertools
import math

print("n things  complexions 2^n-1  check by enumeration")
for n in range(1, 7):
    cnt = 0
    for k in range(1, n + 1):
        cnt += len(list(itertools.combinations(range(n), k)))
    print("{:>8} {:>18} {:>21}".format(n, 2 ** n - 1, cnt))
print("five notes, melodies of length 4: {:,}; length 8: {:,}".format(
    5 ** 4, 5 ** 8))
subsets = 2 ** 12 - 1
valid = 3 ** 4
print("12 shots: non-empty subsets {:,}; valid storyboards {}".format(
    subsets, valid))
print("valid share of all complexions {:.4f}".format(valid / subsets))
print("with module order free: {:,}; with 2 cut lengths: {:,}".format(
    valid * math.factorial(4), valid * math.factorial(4) * 2))
print("distinct opening hooks a viewer meets first: 3")

Single source and citation

Fan, Y. (2026). Ad-Creative Fatigue Half-Lives, Orthogonal Storyboard Recombination and Automated Permutation Rendering (Version 1.0.0), Chapter 7: Classical Sources: the Changes of Five Notes, the Art of Combination and Nothing New Under the Sun. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-400 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026400,
  author    = {Fan, Yafu},
  title     = {Ad-Creative Fatigue Half-Lives, Orthogonal Storyboard Recombination and Automated Permutation Rendering},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book