Jonathan P. Sorenson

activity

20152026

most citedA Perspective on Future Research Directions in Information Theory

4 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

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…