2 citations · 9 across the 9 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.NT2011★ 1 cited
On SA, CA, and GA numbers
Geoffrey Caveney, Jean-Louis Nicolas, Jonathan Sondow
Gronwall's function is defined for by where is the sum of the divisors of . We call an integer a \emph{GA1 number} if …
math.NT2011
Robin's theorem, primes, and a new elementary reformulation of the Riemann Hypothesis
Geoffrey Caveney, Jean-Louis Nicolas, Jonathan Sondow
For n>1, let G(n)=σ(n)/(n log log n), where σ(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satis…
math.NT2011★ 2 cited
On the counting function of sets with even partition functions
Fethi Ben Said, Jean-Louis Nicolas
Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n…