4 citations · 5 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.NT2022
An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice
Chloe Makdad, Jonathan P. Sorenson
Let count the number of positive integers such that every prime divisor of is at most . Given inputs and , what is the best way to estimate …
math.NT2022★ 1 cited
Computation of the least primitive root
Kevin J. McGown, Jonathan P. Sorenson
Let denote the least primitive root modulo , and the least primitive root modulo . We computed and for all primes . Here we presen…
math.NT2022
An Algorithm to Find Sums of Powers of Consecutive Primes
Cathal O'Sullivan, Jonathan P. Sorenson, Aryn Stahl
We present and analyze an algorithm to enumerate all integers that can be written as the sum of consecutive th powers of primes, for . We show that the number of s…