What does Modular Numerology conclude, in numbers, about “Phone Numbers: Modulo 80, XOR and Compressed Numbers”?

Answer: Chapter 6 shows that the modulo-80 rule for phone numbers reads only the last four digits, because 10,000 is a multiple of 80, with a base rate of 0.425 for a good number; the "eight stars" are a three-bit XOR, and good or bad is the single bit of whether two digits share the East or West group; eight-digit endings with no bad pair are only 0.0336 to 0.0894 of all.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 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: 0.425, 80

   10 000 mod 80 = 0;  10^8 mod 80 = 0
   100,000 random 11-digit numbers: whole number, last 8 and last 4
   digits give the same number every time: True
   last four digits 0000-9999: each of the 80 numbers occurs {125} times
   good numbers reachable: 34 of 80, so the base rate of a 'good'
   number among evenly spread numbers is 0.425
   adding one to the last four digits flips the label in 0.550 of cases
Reading: the rule reads only the last four digits; with those
evenly spread, a 'good' number is drawn with probability 0.425,
and moving to the next number changes the verdict about half the
time.
Show the full program
# Chapter 6. Phone numbers modulo 80.
# The rule: divide the number (or its last four, or last eight, digits)
# by 80, take the remainder r (r = 0 counts as 80), and look r up in the
# 81-number list. Because 10 000 = 125 x 80, a number's remainder modulo
# 80 is decided by its last four digits alone, so all three versions of
# the rule agree. By the Chinese remainder theorem, 80 = 16 x 5: the last
# digit fixes the residue mod 5, the last four fix it mod 16.
import random

GOOD = {1, 3, 5, 6, 7, 8, 11, 13, 15, 16, 17, 18, 21, 23, 24, 25, 29,
        31, 32, 33, 35, 37, 39, 41, 45, 47, 48, 52, 57, 61, 63, 65, 67,
        68, 81}

def number80(n):
    r = n % 80
    return 80 if r == 0 else r

if __name__ == "__main__":
    print("   10 000 mod 80 = {};  10^8 mod 80 = {}".format(10000 % 80,
                                                         10 ** 8 % 80))
    rng = random.Random(80)
    agree = 0
    for _ in range(100000):
        n = rng.randrange(10 ** 10, 2 * 10 ** 10)
        a, b, c = number80(n), number80(n % 10 ** 4), number80(n % 10 ** 8)
        agree += a == b == c
    print("   100,000 random 11-digit numbers: whole number, last 8 and last"
          " 4")
    print("   digits give the same number every time: {}".format(
        agree == 100000))
    hits = {}
    for t in range(10000):
        k = number80(t)
        hits[k] = hits.get(k, 0) + 1
    print("   last four digits 0000-9999: each of the 80 numbers occurs {}"
          " times".format(set(hits.values())))
    good = sum(1 for k in range(1, 81) if k in GOOD)
    print("   good numbers reachable: {} of 80, so the base rate of a 'good'"
          .format(good))
    print("   number among evenly spread numbers is {:.3f}".format(good / 80))
    moved = sum((number80(t) in GOOD) != (number80(t + 1) in GOOD)
                for t in range(9999))
    print("   adding one to the last four digits flips the label in {:.3f}"
          " of cases".format(moved / 9999))
    print("\nReading: the rule reads only the last four digits; with those")
    print("evenly spread, a 'good' number is drawn with probability 0.425,")
    print("and moving to the next number changes the verdict about half the")
    print("time.")

Single source and citation

Fan, Y. (2026). Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions (Version 1.0.0), Chapter 6: Phone Numbers: Modulo 80, XOR and Compressed Numbers. 5D Library. https://doi.org/10.5281/zenodo.24090178

DOI: 10.5281/zenodo.24090178 · Read the monograph · 5DL-B-065 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026065,
  author    = {Fan, Yafu},
  title     = {Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090178},
  url       = {https://doi.org/10.5281/zenodo.24090178}
}

Other chapter answers in this book