J. Webster

activity

20102023

most citedStrong Pseudoprimes to Twelve Prime Bases

16 citations · 22 across the 10 of their papers we have counts for

collaborators

Showing 2019 · math.NTShow all

2 papers · 2 filters

math.NT2019

Algorithms for the Multiplication Table Problem

Richard Brent, Carl Pomerance, David Purdum +1

Let $M (n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M (n)$ has been studied by Erdős, Tenenbaum, Ford, and others, but the asymp…

math.NT2019

An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)

Brianna Sorenson, Jonathan P Sorenson, Jonathan Webster

Let $p (n)$ denote the smallest prime divisor of the integer $n$ . Define the function $g (k)$ to be the smallest integer $> k + 1$ such that $p ((k g ( k ))) > k$ . So we have $g (2) = 6$ …