February 15, 2017
A permutiple is a number which is an integer multiple of some permutation of its digits. A well-known example is 9801 since it is an integer multiple of its reversal, 1089. In this paper, we consider the permutiple problem in an entirely different setting: continued fractions. We pose the question of when the simple continued fraction representation of a rational number is an integer multiple of a permutation of its partial quotients (or digits, as we shall call them). We dev...
January 24, 2008
Prime reciprocals have applications in coding and cryptography and for generation of random sequences. This paper investigates the structural redundancy of prime reciprocals in base 10 in a manner that parallels an earlier study for binary prime reciprocals. Several different kinds of structural relationships amongst the digits in reciprocal sequences are classified with respect to the digit in the least significant place of the prime. It is also shown that the frequency of d...
July 16, 2024
In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$ satisfying $|\alpha-p/q|<1/(\sqrt{k^2+4}q^2)$. In this paper we refine this result.
April 11, 2017
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
December 20, 2006
Consider the set $\uu$ of real numbers $q \ge 1$ for which only one sequence $(c_i)$ of integers $0 \le c_i \le q$ satisfies the equality $\sum_{i=1}^{\infty} c_i q^{-i} = 1$. In this note we show that the set of algebraic numbers in $\uu$ is dense in the closure $\uuu$ of $\uu$.
October 4, 2012
In this paper we show that numerous patterns exist in the properties of the convergents formed by truncating the Continued Fraction Expansion (CFE) of the Champernowne Constant in base 10 (C10) immediately before the High Water Marks (HWMs). From these patterns, we have formulated conjectures that may be used to predict the first position in C10 that is incorrect as calculated by the convergent, the error of the convergent, the denominator of the convergent, and the number of...
August 8, 2021
A Trott number is a number $x\in(0,1)$ whose continued fraction expansion is equal to its base $b$ expansion for a given base $b$, in the following sense: If $x=[0;a_1,a_2,\dots]$, then $x=(0.\hat{a}_1\hat{a}_2\dots)_b$, where $\hat{a}_i$ is the string of digits resulting from writing $a_i$ in base $b$. In this paper we characterize the set of bases for which Trott numbers exist, and show that for these bases, the set $T_b$ of Trott numbers is a complete $G_\delta$ set. We pr...
July 22, 2008
It is well known since A. J. Kempner's work that the series of the reciprocals of the positive integers whose the decimal representation does not contain any digit 9, is convergent. This result was extended by F. Irwin and others to deal with the series of the reciprocals of the positive integers whose the decimal representation contains only a limited quantity of each digit of a given nonempty set of digits. Actually, such series are known to be all convergent. Here, letting...
February 25, 2015
Let $q\in(1,2)$. A $q$-expansion of a number $x$ in $[0,\frac{1}{q-1}]$ is a sequence $(\delta_i)_{i=1}^\infty\in\{0,1\}^{\mathbb{N}}$ satisfying $$ x=\sum_{i=1}^\infty\frac{\delta_i}{q^i}.$$ Let $\mathcal{B}_{\aleph_0}$ denote the set of $q$ for which there exists $x$ with a countable number of $q$-expansions, and let $\mathcal{B}_{1, \aleph_0}$ denote the set of $q$ for which $1$ has a countable number of $q$-expansions. In \cite{Sidorov6} it was shown that $\min\mathcal{B}...
May 6, 2014
Bourgain, Konyagin and Shparlinski obtained a lower bound for the size of the product set AB when A and B are sets of positive rational numbers with numerator and denominator less or equal than Q. We extend and slightly improve that lower bound using a different approach.