Jonathan P. Sorenson

collaborators

3 papers

math.NT2026

Primes and almost primes between cubes

Daniel R. Johnston, Jonathan P. Sorenson, Simon N. Thomas +1

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^{3}$ …

math.NT2025

Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes

Jonathan P. Sorenson, Eleanor Waiss

In his 1963 paper on the sum of consecutive primes, Moser posed four open questions related to $f (n)$ , the number of ways an integer $n$ can be written as a sum of consecutive prim…

math.NT2025

Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers

Sara Moore, Jonathan P. Sorenson

Let $k \geq 1$ be an integer. A positive integer $n$ is $k$ -\textit{gleeful} if $n$ can be represented as the sum of $k$ th powers of consecutive primes. For example, $35 = 2^{3} + 3^{3}$ is…