English
Related papers

Related papers: Computer experiments with Mersenne primes

200 papers

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods…

Number Theory · Mathematics 2025-11-05 Jean-Christophe Pain

There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{n\|n\alpha-\gamma\|}~~~\text{and}~~~ R_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{\|n\alpha-\gamma\|}\,, \] where…

Number Theory · Mathematics 2017-04-04 Victor Beresnevich , Alan Haynes , Sanju Velani

Khinchin proved that the arithmetic mean of continued fraction digits of Lebesgue almost every irrational number in $(0,1)$ diverges to infinity. Hence, none of the classical limit theorems such as the weak and strong laws of large numbers…

Dynamical Systems · Mathematics 2018-03-29 Hiroki Takahasi

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

Number Theory · Mathematics 2026-04-24 Jungwon Lee

Two sums over the inverse of the product of an integer n and its greatest prime factor G(n), are computed to first 13 decimal digits. These sums converge, but converge very slowly. They are transformed into sums involving Mertens' prime…

General Mathematics · Mathematics 2024-07-18 Tengiz O. Gogoberidze

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

Number Theory · Mathematics 2022-01-31 Jonathan Bayless , Paul Kinlaw , Jared Duker Lichtman

This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…

Combinatorics · Mathematics 2019-08-23 Ilke Canakci , Ralf Schiffler

The direct calculation of the Generalized operator entropy proves difficult by the appearance of rational exponents of matrices. The main motivation of this work is to overcome these difficulties and to present a practical and efficient…

Numerical Analysis · Mathematics 2022-10-17 Sarra Ahallal , Said Mennou , Ali Kacha

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

General Mathematics · Mathematics 2019-04-02 N. A. Carella

Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. We denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…

Number Theory · Mathematics 2016-03-04 Lulu Fang , Min Wu , Bing Li

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

Number Theory · Mathematics 2014-08-27 Faustin Adiceam

Motivated by recently developed interest to the distribution of $q$-ary digits of Mersenne numbers $M_p = 2^p-1$, where $p$ is prime, we estimate rational exponential sums with $M_p$, $p \leq X$, modulo a large power of a fixed odd prime…

Number Theory · Mathematics 2021-07-16 Bryce Kerr , László Mérai , Igor E. Shparlinski

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

Number Theory · Mathematics 2025-12-09 Zhen Chen , Junrong Luo

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Dynamical Systems · Mathematics 2024-12-09 Niels Langeveld , David Ralston

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

We prove an estimate for the number of lattice points lying in certain non-convex Euclidean domains of interest in Diophantine approximation. As an application, we generalise a result of Kruse (1964) concerning the almost sure order of…

Number Theory · Mathematics 2025-11-11 Reynold Fregoli

New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers $L(n) = 2^{2n}\pm2^n\pm1$ are investigated. Wonderful formulas $gcd $ for numbers $L (n) $ and numbers repunit are proved.

General Mathematics · Mathematics 2008-04-25 Boris V. Tarasov