Title	Algorithms for the Multiplication Table Problem
Creator	Webster, Jonathan
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-05-11T10:55
Description	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.
Extent	41.0 minutes
Subject	Mathematics; Number theory; Combinatorics; Arithmetic number theory
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Calgary (visiting)
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-09-04
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0394194
URI	http://hdl.handle.net/2429/75852
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos