Papers › Algorithms for the Multiplication Table Problem
Algorithms for the Multiplication Table Problem
Richard Brent, Carl Pomerance, David Purdum, Jonathan Webster
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let M(n) denote the number of distinct entries in the n ×n multiplication table. The function M(n) has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of M(n) as n →∞ is not known precisely. Thus, there is some interest in algorithms for computing M(n) either exactly or approximately. We compare several algorithms for computing M(n) exactly, and give a new algorithm that has a subquadratic running time. We also present two Monte Carlo algorithms for approximate computation of M(n). We give the results of exact computations for values of n up to 2³⁰, and of Monte Carlo computations for n up to 2^(100,000,000), and compare our experimental results with Ford's order-of-magnitude result.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections