The middle-third Cantor set C_3 is a fractal consisting of all the points in [0, 1] which have non-terminating base-3 representations involving only the digits 0 and 2. It is easily shown that the reciprocals of all prime numbers p > 3 satisfying an equation of the form 2p + 1 = 3^q belong to C_3. Such prime numbers have base-3 representations consisting of a contiguous sequence of 1's and are known as base-3 repunit primes. It is natural to ask whether all prime numbers with reciprocals in C_3 satisfy this equation. In this paper we show that the answer is no, but all primes with reciprocals in C_3 do satisfy a closely related equation of the form 2pK + 1 = 3^q. The base-3 repunit primes are thus shown to be a special case corresponding to K = 1.
In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this direct approach is a consequence of the the Kummer's characterization of summable sequences of positive terms. Some interesting consequences are then presented. In particular, we show how the twin-prime conjecture is related to our main result.
Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^αd_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log X}~\qquad\quad~ &α=-1,\\ \frac{X}{\log X}\frac{(\log\log X)^{1+α}}{1+α}\qquad &α>-1, \end{cases} \end{align*} and establish asymptotic properties for some series of $d_n$ without the Hardy--Littlewood prime-pair conjecture.
Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals $a\mathbb Z_K$ such that $a$ is an atom of $\mathbb Z_K$ and $a$ divides $m$ for some $m \in X$. Building upon the ideas of Clarkson from [Proc. Amer. Math. Soc. 17 (1966), 541], we show that, if the series $\sum_{m \in X} 1/m$ diverges, then so does the series $\sum_{\mathfrak a \in \mathcal A} |N(\mathfrak a)|^{-1/n}$. Most notably, this generalizes a class…
A Fixed-Prime Criterion for Reciprocals in Missing-Digit Sets
Harvard Business School（哈佛商学院）；Department of Economics and Center of Mathematical Sciences and Applications, Harvard University（哈佛大学经济与数学科学及应用中心）；a16z crypto（a16z 加密）
The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime sequences $\{n_\ell\}_{\ell\geq1}$. For example, the three numbers \[ 1,\qquad\sum_{p\text{:prime}}^{}\frac{1}{F_{p^2}},\qquad\sum_{p\text{:prime}}^{}\frac{1}{L_{p^2}} \] are linearly independent over $\mathbb{Q}(\sqrt{5})$, where $\{F_n\}$ and $\{L_n\}$ are the Fibonacci and Lucas numbers, respectively.
We show that the series expansions of certain $q$-products have \textit{matching coefficients} with their reciprocals. Several of the results are associated to Ramanujan's continued fractions. For example, let $R(q)$ denote the Rogers-Ramanujan continued fraction having the well-known $q$-product repesentation $$R(q)=\dfrac{(q;q^5)_\infty(q^4;q^5)_\infty}{(q^2;q^5)_\infty(q^3;q^5)_\infty}.$$ If \begin{align*} \sum_{n=0}^{\infty}α(n)q^n=\dfrac{1}{R^5\left(q\right)}=\left(\sum_{n=0}^{\infty}α^{\prime}(n)q^n\right)^{-1},\\ \sum_{n=0}^{\infty}β(n)q^n=\dfrac{R(q)}{R\left(q^{16}\right)}=\left(\sum_{…
It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is simply related to an infinite product over primes. We then generalize the form of the series (and its related product), extending this idea to other number theoretic sets such as twin primes. Evaluating a product made from twin primes gives a new mathematical constant.
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision. Consequently, after having possibly lifted the problem in the $p$-adics, we derive fast algorithms for computing explicitly Cantor's division polynomials of hyperelliptic curves defined over finite fields.
In 1978, Allan.Wm.Johnson obtained an example of the representation of 1 by the sum of reciprocals of the product of two distinct prime numbers. His example has 48 terms [1], and we had no examples which have less than 48 terms until now. In this paper, we construct 17 new examples that have less than 48 terms. Since all of the new examples have 47 terms and we have no examples which have less than 47 terms, it is assumed that the minimum number of terms is 47.
In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime counting function. A further main tool is the usage of estimates concerning the reciprocal of $\log p_n$. As an application we derive refined estimates for $\vartheta(p_n)$ in terms of $n$, where $\vartheta(x)$ is Chebyshev's $\vartheta$-function.
For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a finer-scale estimate for $R_2(x)$ up to $(\log x)^{-N}$ error for any $N > 0$. In this article, we establish the limiting behavior of the higher Mertens constants from the $R_2(x)$ estimate. We also extend these results to $R_3(x)$, and we remark on the general case $k\ge4$.
Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.
We investigate various questions concerning the reciprocal sum of divisors, or prime divisors, of the Mersenne numbers $2^n-1$. Conditional on the Elliott-Halberstam Conjecture and the Generalized Riemann Hypothesis, we determine $\max_{n\le x} \sum_{p \mid 2^n-1} 1/p$ to within $o(1)$ and $\max_{n\le x} \sum_{d\mid 2^n-1}1/d$ to within a factor of $1+o(1)$, as $x\to\infty$. This refines, conditionally, earlier estimates of Erdős and Erdős-Kiss-Pomerance. Conditionally (only) on GRH, we also determine $\sum 1/d$ to within a factor of $1+o(1)$ where $d$ runs over all numbers dividing $2^n-1$ fo…
Wright proved that there exists a number $c$ such that if $g_0 = c$ and $g_{n+1} = 2^{g_n}$, then $\lfloor g_n \rfloor$ is prime for all $n > 0$. Wright gave $c = 1.9287800$ as an example. This value of $c$ produces three primes, $\lfloor g_1 \rfloor = 3$, $\lfloor g_2 \rfloor = 13$, and $\lfloor g_3 \rfloor = 16381$. But with this $c$, $\lfloor g_4 \rfloor$ is a 4932-digit composite number. However, this slightly larger value of $c$, \[ c = 1.9287800 + 8.2843 \cdot 10^{-4933}, \] reproduces Wright's first three primes and generates a fourth: \[ \lfloor g_4 \rfloor = 19139664204631104984038373…
The classical congruences satisfied by the Fibonacci and Lucas sequences are reflected with the decomposition of primes in the ring generated by the gold number. This generalizes to establish a correspondence that we hope will be new between Chebotarev's theorem and the congruences satisfied by linear sequences. This link is done into the context of number field extensions. In particular we characterize primes ideals totally decomposed by simple congruences on the terms of linear recurrent sequences. Our results are illustrated by numerous examples, including Padovan sequencesof group $S_3$ an…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number…
Let $(c_k)_{k\in \mathbb{N}}$ be a sequence of positive integers. We investigate the set of $A>1$ such that the integer part of $A^{c_1\cdots c_k}$ is always a prime number for every positive integer $k$. Let $\mathcal{W}(c_k)$ be this set. The first goal of this article is to determine the topological structure of $\mathcal{W}(c_k)$. Under some conditions on $(c_k)_{k\in \mathbb{N}}$, we reveal that $\mathcal{W}(c_k)\cap [0,a]$ is homeomorphic to the Cantor middle third set for some $a$. The second goal is to propose an algebraically independent subset of $\mathcal{W}(c_k)$ if $c_k$ is rapidl…
Second order Recurrences, quadratic number fields and cyclic codes
Anhui University（安徽大学）；École Supérieure de l’Education et de la Formation（教育与高等师范学院）；Sogang University（西江大学）；Aix Marseille Univ, CNRS（艾克斯-马赛大学，法国国家科学研究中心）
This is an English translation of the Latin original "De summa seriei ex numeris primis formatae ${1/3}-{1/5}+{1/7}+{1/11}-{1/13}-{1/17}+{1/19}+{1/23}-{1/29}+{1/31}-$ etc. ubi numeri primi formae $4n-1$ habent signum positivum formae autem $4n+1$ signum negativum" (1775). E596 in the Enestrom index. Let $χ$ be the nontrivial character modulo 4. Euler wants to know what $\sum_p χ(p)/p$ is, either an exact expression or an approximation. He looks for analogies to the harmonic series and the series of reciprocals of the primes. Another reason he is interested in this is that if this series has a …
The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number ${\bf u}_n$ is the countable sequence of the nth roots of unity having frequencies k/n for all integer phases k. The space U is closed under a commutative and associative binary operation ${\bf u}_m \odot{\bf u}_n={\bf u}_{mn}$, termed the circular product, and is isomorphic with N under their respective product operators. Functions are defined on U that partition wav…
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ám'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 cond…
