BIRS Workshop Lecture Videos
Algorithms for the Multiplication Table Problem Webster, Jonathan
ErdÅ s once asked about the function M(n) which counts the number of distinct products in an nxn multiplication table. We review the current known asymptotic behavior of this function and present computational results evaluating M(n) for n < 2^30. We describe the algorithms used and give a proof of their run-times and space constraints.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International