Related papers: Somme des chiffres et changement de base
Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…
We prove that any set $A\subset \mathbb{N}$ of positive upper density contains a finite $S\subset A$ such that $\sum_{n\in S}\frac{1}{n}=1$, answering a question of Erd\H{o}s and Graham.
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new…
Practical numbers are positive integers $n$ such that every positive integer less than or equal to $n$ can be written as a sum of distinct positive divisors of $n$. In this paper, we show that all positive integers can be written as a sum…
A set A of positive integers is called a h-bais of [0,n] if each integer in [0,n]is a sum of no more than h members of A. In this paper, we will give a new construction for h-basis.
Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…
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$…
The main result in this paper concerns a new five-variable expander. It is proven that for any finite set of real numbers $A$, $$|\{(a_1+a_2+a_3+a_4)^2+\log a_5 :a_1,a_2,a_3,a_4,a_5 \in A \}| \gg \frac{|A|^2}{\log |A|}.$$ This bound is…
Let $b$ be an algebraic number with $|b|>1$ and $\mathcal{H}$ a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n}$ where $a_n \in \mathcal{H}$ for all $n\in\mathbb{N}$. We…
The set A = {a_n} of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be represented as the sum of h elements of A. If a_n ~ alpha n^h for some real number alpha > 0, then alpha is called an…
We answer two questions from {\it V.Bykov, On Baire class one functions on a product space, Topol. Appl. {199} (2016) 55--62,} and prove that every Baire one function on a subspace of a countable perfectly normal product is the pointwise…
We study the distribution of sequences of the form $(q_ny)_{n=1}^\infty$, where $(q_n)_{n=1}^\infty$ is some increasing sequence of integers. In particular, we study the Lebesgue measure and find bounds on the Hausdorff dimension of the set…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
Let $f(x)$ be a real function which has $(n+1)$-th derivative on an interval $[a, b]$. For any point $x_0\in (a, b)$ and any integer $0\leq k\leq n$, denote by $S_{k,x_0}(x)$ the $k$-th truncation of the Taylor expansion of $f(x)$ at $x_0$,…
When asymptotically analysing the summatory function of a $q$-regular sequence in the sense of Allouche and Shallit, the eigenvalues of the sum of matrices of the linear representation of the sequence determine the "shape" (in particular…
Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…
A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for…
We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…
A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H…
We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…