Jonathan Sondow
Research Subjects
Research Interests
Jonathan Sondow has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Kieren MacMillan
55 Lessard Avenue, Toronto, Ontario, Canada M6S 1X6
7 shared publications - Jean-Louis Nicolas
Research supported by CNRS UMR 5208 Institut Camille Jordan
5 shared publications - Bernd C. Kellner
Mathematisches Institut, Universität Göttingen, Bunsenstr. 3–5, 37073 Göttingen, Germany
3 shared publications - Geoffrey Caveney
University of Lyon
3 shared publications - Sergey Zlobin
Moscow State University
3 shared publications - Antonio Miguel Oller Marcén
Universidad de Zaragoza
2 shared publications
Latest Publications
- Open Access
On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits
We give a new characterization of the set $\mathcal{C}$ of Carmichael numbers in the context of $p$-adic theory, independently of the classical results of Korselt and Carmichael. The characterization originates from a surprising link to the denominators of the Bernoulli polynomials via the sum-of-base-$p$-digits function. More precisely, we show that such a denominator obeys a triple-product identity, where one factor is connected with a $p$-adically defined subset $\mathcal{S}$ of the squarefree integers that contains $\mathcal{C}$. This leads to the definition of a new subset $\mathcal{C}'$ of $\mathcal{C}$, called the "primary Carmichael numbers". Subsequently, we establish that every Carmichael number equals an explicitly determined polygonal number. Finally, the set $\mathcal{S}$ is covered by modular subsets $\mathcal{S}_d$ ($d \geq 1$) that are related to the Kn\"odel numbers, where $\mathcal{C} = \mathcal{S}_1$ is a special case.Open AccessOn Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits
We give a new characterization of the set $\mathcal{C}$ of Carmichael numbers in the context of $p$-adic theory, independently of the classical results of Korselt and Carmichael. The characterization originates from a surprising link to the denominators of the Bernoulli polynomials via the sum-of-base-$p$-digits function. More precisely, we show that such a denominator obeys a triple-product identity, where one factor is connected with a $p$-adically defined subset $\mathcal{S}$ of the squarefree integers that contains $\mathcal{C}$. This leads to the definition of a new subset $\mathcal{C}'$ of $\mathcal{C}$, called the "primary Carmichael numbers". Subsequently, we establish that every Carmichael number equals an explicitly determined polygonal number. Finally, the set $\mathcal{S}$ is covered by modular subsets $\mathcal{S}_d$ ($d \geq 1$) that are related to the Kn\"odel numbers, where $\mathcal{C} = \mathcal{S}_1$ is a special case. - 19 December 2019
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (1) , 23-32
Hypergeometry of the Parbelos
In the December 2013 issue of this Monthly, Sondow introduced a parabolic analog of the classical arbelos figure called the parbelos. He found that the ratio of the perimeter of an arbitrary parbelos to that of the corresponding arbelos is a constant S that has an elegant symbolic evaluation involving and the universal parabolic constant. Using the On-Line Encyclopedia of Integer Sequences, in 2016 Campbell experimentally discovered a hypergeometric formula for S. Zudilin then proved the formula, using recent results of Borwein, Borwein, Glasser, and Wan on the moments of Ramanujan’s generalized elliptic integrals. In the present article, we offer a variety of new proofs of Campbell’s hypergeometric formula for the parbelos constant S, including a creative proof that makes use of a Fourier–Legendre expansion.- 19 December 2019
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (1) , 23-32
Hypergeometry of the Parbelos
In the December 2013 issue of this Monthly, Sondow introduced a parabolic analog of the classical arbelos figure called the parbelos. He found that the ratio of the perimeter of an arbitrary parbelos to that of the corresponding arbelos is a constant S that has an elegant symbolic evaluation involving and the universal parabolic constant. Using the On-Line Encyclopedia of Integer Sequences, in 2016 Campbell experimentally discovered a hypergeometric formula for S. Zudilin then proved the formula, using recent results of Borwein, Borwein, Glasser, and Wan on the moments of Ramanujan’s generalized elliptic integrals. In the present article, we offer a variety of new proofs of Campbell’s hypergeometric formula for the parbelos constant S, including a creative proof that makes use of a Fourier–Legendre expansion.- Open Access
Extending Babbage's (Non-)Primality Tests
We recall Charles Babbage's 1819 criterion for primality, based on simultaneous congruences for binomial coefficients, and extend it to a least-prime-factor test. We also prove a partial converse of his non-primality test, based on a single congruence. Two problems are posed. Along the way we encounter Bachet, Bernoulli, Bezout, Euler, Fermat, Kummer, Lagrange, Lucas, Vandermonde, Waring, Wilson, Wolstenholme, and several contemporary mathematicians.
Open AccessExtending Babbage's (Non-)Primality Tests
We recall Charles Babbage's 1819 criterion for primality, based on simultaneous congruences for binomial coefficients, and extend it to a least-prime-factor test. We also prove a partial converse of his non-primality test, based on a single congruence. Two problems are posed. Along the way we encounter Bachet, Bernoulli, Bezout, Euler, Fermat, Kummer, Lagrange, Lucas, Vandermonde, Waring, Wilson, Wolstenholme, and several contemporary mathematicians.
- Open Access
Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation
A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to Sylvester's sequence, Giuga numbers, Zn\'am's problem, the inheritance problem, and Curtiss's bound on solutions of a unit fraction equation. Here we show $K \equiv 6 \pmod{6^2}$ if $6\mid K$, and uncover a remarkable $7$-term arithmetic progression of residues modulo $6^2\cdot8$ in the sequence of known PPNs. On that basis, we pose a conjecture which leads to a conditional proof of the new record lower bound $k>10^{3.99\times10^{20}}$ on any non-trivial solution to the Erd\H{o}s-Moser Diophantine equation $1^n + 2^n + \dotsb + k^n = (k+1)^n$.Open AccessPrimary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation
A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to Sylvester's sequence, Giuga numbers, Zn\'am's problem, the inheritance problem, and Curtiss's bound on solutions of a unit fraction equation. Here we show $K \equiv 6 \pmod{6^2}$ if $6\mid K$, and uncover a remarkable $7$-term arithmetic progression of residues modulo $6^2\cdot8$ in the sequence of known PPNs. On that basis, we pose a conjecture which leads to a conditional proof of the new record lower bound $k>10^{3.99\times10^{20}}$ on any non-trivial solution to the Erd\H{o}s-Moser Diophantine equation $1^n + 2^n + \dotsb + k^n = (k+1)^n$. - Open Access
The denominators of power sums of arithmetic progressions
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit criterion for integrality of the coefficients of these polynomials. As applications, we obtain new results on the sequence of denominators of the Bernoulli polynomials. A consequence is that certain quotients of successive denominators are infinitely often integers, which we characterize.
Open AccessThe denominators of power sums of arithmetic progressions
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit criterion for integrality of the coefficients of these polynomials. As applications, we obtain new results on the sequence of denominators of the Bernoulli polynomials. A consequence is that certain quotients of successive denominators are infinitely often integers, which we characterize.
- Open Access
Power-Sum Denominators
The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational coefficients. Here we consider the denominators of these polynomials, and prove some of their properties. A remarkable one is that such a denominator equals $n+1$ times the squarefree product of certain primes $p$ obeying the condition that the sum of the base-$p$ digits of $n+1$ is at least $p$. As an application, we derive a squarefree product formula for the denominators of the Bernoulli polynomials.Open AccessPower-Sum Denominators
The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational coefficients. Here we consider the denominators of these polynomials, and prove some of their properties. A remarkable one is that such a denominator equals $n+1$ times the squarefree product of certain primes $p$ obeying the condition that the sum of the base-$p$ digits of $n+1$ is at least $p$. As an application, we derive a squarefree product formula for the denominators of the Bernoulli polynomials. - Open Access
- 1 March 2017
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 124 (3) , 232-240
Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation
A primary pseudoperfect number (PPN) is an integer K > 1 such that the reciprocals of K and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebra...
- 1 March 2017
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 124 (3) , 232-240
Open AccessPrimary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation
A primary pseudoperfect number (PPN) is an integer K > 1 such that the reciprocals of K and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebra...
- 1 January 2017
- Published by Springer Nature
- p. 269-277
Extending Babbage’s (Non-)Primality Tests
- 1 January 2017
- Published by Springer Nature
- p. 205-213
Initial Sums of the Legendre Symbol: Is $\min + \max \ge 0$ ?- 1 January 2017
- Published by Springer Nature
- p. 205-213
Initial Sums of the Legendre Symbol: Is $\min + \max \ge 0$ ?- Open Access
Summation of rational series twisted by strongly B-multiplicative coefficients
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)} \frac{4n+1}{2n(2n+1)(2n+2)} = -\frac{1}{4} $$ where $s_2(n)$ is the sum of the binary digits of the integer $n$. Furthermore closed formulas for series involving automatic sequences that are not strongly $B$-multiplicative, such as the regular paperfolding and Golay-Shapiro-Rudin sequences, are obtained; for example, for integer $d \geq 0$: $$ \sum_{n \geq 0} \frac{v(n)}{(n+1)^{2d+1}} = \frac{\pi^{2d+1} |E_{2d}|}{(2^{2d+2}-2)(2d)!} $$ where $(v(n))_n$ is the $\pm 1$ regular paperfolding sequence and $E_{2d}$ is an Euler number.Open AccessSummation of rational series twisted by strongly B-multiplicative coefficients
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)} \frac{4n+1}{2n(2n+1)(2n+2)} = -\frac{1}{4} $$ where $s_2(n)$ is the sum of the binary digits of the integer $n$. Furthermore closed formulas for series involving automatic sequences that are not strongly $B$-multiplicative, such as the regular paperfolding and Golay-Shapiro-Rudin sequences, are obtained; for example, for integer $d \geq 0$: $$ \sum_{n \geq 0} \frac{v(n)}{(n+1)^{2d+1}} = \frac{\pi^{2d+1} |E_{2d}|}{(2^{2d+2}-2)(2d)!} $$ where $(v(n))_n$ is the $\pm 1$ regular paperfolding sequence and $E_{2d}$ is an Euler number.