What does Team Size under Coordination Overhead conclude, in numbers, about “Brooks's Law: n(n-1)/2 Channels and the Newcomers on a Late Project”?

Answer: Two people have one channel, three have three, four have six, eight have twenty-eight, twelve have sixty-six, and fifty have 1,225. When the team doubles, channels rise sixfold from two people to four, by 4.67 times from four to eight, and approach a factor of four as the team grows, because the channel count is essentially the square of headcount. Each member maintains n-1 channels, so the time each member spends on channels is proportional to team size: with four members each spends 0.037 of the week on channels, with eight 0.087, with twenty 0.237, with fifty 0.613. With this illustrative parameter, at eighty-one members channels consume everyone's entire week.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Chapter 4 takes this bureau's four volumes in parallel per wave as an illustrative scene: capacity peaks at 6.78 windows, four windows already reach 89.6 % of the peak, and the coordinator's review queue holds the ceiling at four.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.037, 0.087, 0.237, 0.613, 1225, 4.67

nchannelsper memberx when doubledweek share
100.0-0.000
210.56.000.013
331.05.000.025
461.54.670.037
5102.04.500.050
6152.54.400.062
8283.54.290.087
10454.54.220.113
12665.54.180.138
161207.54.130.188
201909.54.110.237
50122524.54.040.613
members at which channels eat the whole week: 81
channels at n = 50: 1,225
Show the full program
# Chapter 2. p21: pairwise channels n(n-1)/2 against headcount.
# Brooks (1975): if every part of a task must be coordinated with every
# other part, intercommunication effort grows as n(n-1)/2. Columns:
# channels, channels per member (n-1)/2, the ratio of channels when the
# team doubles, and the share of a 40-hour week each member spends on
# channels if every channel costs h = 0.5 hour per member per week
# (illustrative).
H = 0.5
WEEK = 40.0


def channels(n):
    return n * (n - 1) // 2


if __name__ == "__main__":
    print("   n  channels  per member  x when doubled  week share")
    for n in (1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 20, 50):
        ch = channels(n)
        dbl = channels(2 * n) / ch if ch else float("nan")
        share = H * (n - 1) / WEEK
        dtxt = "{:14.2f}".format(dbl) if ch else "             -"
        print("  {:2d}  {:8d}  {:10.1f}  {}  {:10.3f}"
              .format(n, ch, (n - 1) / 2, dtxt, share))
    n_full = 1 + int(WEEK / H)
    print("members at which channels eat the whole week: {}".format(
        n_full))
    print("channels at n = 50: {:,}".format(channels(50)))

Single source and citation

Fan, Y. (2026). The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead (Version 1.0.0), Chapter 2: Brooks's Law: n(n-1)/2 Channels and the Newcomers on a Late Project. 5D Library. DOI pending

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

BibTeX
@book{fan2026322,
  author    = {Fan, Yafu},
  title     = {The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book