16 citations · 22 across the 10 of their papers we have counts for
10 papers
Tabulating Absolute Lucas Pseudoprimes
Chloe Helmreich, Jonathan Webster
In 1977, Hugh Williams studied Lucas pseudoprimes to all Lucas sequences of a fixed discriminant. These are composite numbers analogous to Carmichael numbers and they satisfy a Kor…
Kurt Hensel on Common Inessential Discriminant Divisors, 1894
Fernando Q. Gouvêa, Jonathan Webster
The problem of the "common inessential discriminant divisors" attracted the attention of Dedekind, Kronecker, and Hensel in the early days of algebraic number theory. Four sources…
Dedekind on Higher Congruences and Index Divisors, 1871 and 1878
Fernando Q. Gouvêa, Jonathan Webster
Dedekind's theorem connecting ideal theory and polynomial congruences appears in all textbooks on algebraic number theory, but few books note its connection to the problem of ``com…
Algorithms for the Multiplication Table Problem
Richard Brent, Carl Pomerance, David Purdum +1
Let denote the number of distinct entries in the multiplication table. The function has been studied by Erdős, Tenenbaum, Ford, and others, but the asymp…
An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)
Brianna Sorenson, Jonathan P Sorenson, Jonathan Webster
Let denote the smallest prime divisor of the integer . Define the function to be the smallest integer such that . So we have …
Two Algorithms to Find Primes in Patterns
Jonathan P. Sorenson, Jonathan Webster
Let be an integer, and let be admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that f…