Related papers: Somme des chiffres et changement de base

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Let $\mathcal{H}_\infty$ be the set of all ordinary Dirichlet series $D=\sum_n a_n n^{-s}$ representing bounded holomorphic functions on the right half plane. A multiplicative sequence $(b_n)$ of complex numbers is said to be an…

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

We examine the sum of a decaying exponential (depending non-linearly on the summation index) and a Bessel function in the form \[\sum_{n=1}^\infty e^{-an^p}\frac{J_\nu(an^px)}{(an^px/2)^\nu}\qquad (x>0),\] in the limit $a\to0$, where…

Let $f(n)$ count the number of subsets of $\{1,...,n\}$ without an element dividing another. In this paper I show that $f(n)$ grows like the $n$-th power of some real number, in the sense that $\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists.…

We show the existence of ``good'' approximations to a real number $\gamma$ using rationals with denominators formed by digits $0$ and $1$ in base $b$. We derive an elementary estimate and enhance this result by managing exponential sums.

For an integer $b\geq 2$, a positive integer is called a $b$-Niven number if it is a multiple of the sum of the digits in its base-$b$ representation. In this article, we show that every arithmetic progression contains infinitely many…

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by setting its values on primes $f(p)$ to be independent random variables distributed uniformly on the unit circle. Recent work of Harper shows…

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

We consider the generalised Mathieu series \[\sum_{n=1}^\infty \frac{n^\gamma}{(n^\lambda+a^\lambda)^\mu}\qquad (\mu>0)\] when the parameters $\lambda$ ($>0$) and $\gamma$ are even integers for large complex $a$ in the sector…

For an integer b>=2, let s_b(n) be the sum of the digits of the integer n when written in base b, and let S_b(N) be the sum of s_b(n) over n=0,...,N-1, so that S_b(N) is the sum of all b-ary digits needed to write the numbers 0,1,...,N-1.…

We show by a constructive proof that in all aperiodic dynamical system, for all sequences $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and $\frac{a_n}{n}\to 0$ as $n\to\infty$, there exists a set $A\in\A$ having the property…

Similarly to Parry's characterization of $\beta$-expansions of real numbers in real bases $\beta > 1$, Ito and Sadahiro characterized digital expansions in negative bases, by the expansions of the endpoints of the fundamental interval.…