What does Pythagorean Comma, Zhu Zaiyu and Beat Roughness conclude, in numbers, about “Practice and Falsification: Fitting Marketing Copy with a Detector for Pseudo-Precise Tuning Claims”?

Answer: Chapter 8 gives a checklist, copy-checking rules and a pre-registered test with a sample of 169. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

Scope of the numbers: Its listeners, samples and copy are illustrative, and all calculations are generated by its programs; the book is not medical advice, claims no effect of any frequency, scale or instrument on body or mind, and is not purchasing advice. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

中文版

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: 169

true p1first nstable ncritical countpower
0.556206543490.811
0.60158169960.823
0.656976460.826
0.703742270.836
0.752328190.862
n = 200: reject if at least 113 of 200 pick the just third
size of that test: 0.0384
Show the full program
# Chapter 8. p81: how many paired judgements a pre-registered test needs.
# Design: each trial plays one interval twice (say just and equal major
# third on C5, order randomised); the listener names the smoother one.
# Null: p = 0.5. One-sided exact binomial test at alpha = 0.05. For a
# true share p1 we find the smallest n with power >= 0.80 that also
# keeps power >= 0.80 for every n up to n + 40 (the binomial power
# curve is saw-toothed). Critical counts use exact integers.
import math

NMAX = 720


def crit(n):
    # smallest c with sum_{k>=c} C(n,k) <= 0.05 * 2^n, in integers
    acc, c, lim = 0, n + 1, 2 ** n
    while c > 0:
        nxt = acc + math.comb(n, c - 1)
        if 20 * nxt > lim:
            break
        acc, c = nxt, c - 1
    return c, acc


def power(n, c, p1):
    lp, lq = math.log(p1), math.log(1 - p1)
    terms = []
    for k in range(c, n + 1):
        lg = (math.lgamma(n + 1) - math.lgamma(k + 1)
              - math.lgamma(n - k + 1))
        terms.append(math.exp(lg + k * lp + (n - k) * lq))
    return math.fsum(terms)


def main():
    crits = {n: crit(n) for n in range(5, NMAX + 1)}
    print("  true p1   first n   stable n  critical count  power")
    for p1 in (0.55, 0.60, 0.65, 0.70, 0.75):
        pw = {n: power(n, crits[n][0], p1) for n in crits}
        first = min(n for n in pw if pw[n] >= 0.8)
        stable = min(n for n in pw if n + 40 <= NMAX and
                     all(pw[m] >= 0.8 for m in range(n, n + 41)))
        print("{:>9.2f} {:>9} {:>10} {:>15} {:>6.3f}".format(
            p1, first, stable, crits[stable][0], pw[stable]))
    n = 200
    c, acc = crits[n]
    print("n = {}: reject if at least {} of {} pick the just third".format(
        n, c, n))
    print("size of that test: {:.4f}".format(acc / 2 ** n))


main()

Single source and citation

Fan, Y. (2026). The Unclosed Circle of Pythagorean Tuning, Zhu Zaiyu's Root Approximation of Equal Temperament and the Beat Roughness of Just-Intonation Overtones (Version 1.0.0), Chapter 8: Practice and Falsification: Fitting Marketing Copy with a Detector for Pseudo-Precise Tuning Claims. 5D Library. DOI pending

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

BibTeX
@book{fan2026159,
  author    = {Fan, Yafu},
  title     = {The Unclosed Circle of Pythagorean Tuning, Zhu Zaiyu's Root Approximation of Equal Temperament and the Beat Roughness of Just-Intonation Overtones},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book