In this paper we present an alternative approach to a problem dealt with by Rosales et al. In particular, once a base $b$ for the representation of the integers is fixed, we describe a procedure for constructing the smallest multiplicative subsemigroup of the positive integers closed with respect to the number of digits which contains a set of positive integers.
This paper studies the multiplicative semigroup generated by all rationals of the form (3n+2)/(2n+1) for nonnegative integers n, together with 1/2. The subsemigroup of integers in this semigroup is called the wild integer semigroup, and the wild numbers are the irreducible elements in this subsemigroup. This paper presents evidence that the wild numbers consist of all the prime numbers p except 3. The subsemigroup of integers in the multiplicative semigroup generated by all rationals of the form (3n+2)/(2n+1) for nonnegative integers n is called the Wooley integer semigroup and its irreducible…
In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $Δ(n)$ is obtained. $Δ(n)$ is called the \textsl{multiplicative digital root of $n$} or \textsl{the target of $n$}. The number of steps $Ξ(n)$ needed to reach $Δ(n)$, called the multiplicative persistence of $n$ or \textsl{the height of $n$} is conjectured to always be at most $11$. Like many other very simple to state number-theoretic conjectures, the multiplicative persistence mystery resisted numero…
Let $b$ be a numeration base. A $b$-additive Ramanujan-Hardy number $N$ is an integer for which there exists at least an integer $M$, called additive multiplier, such that the product of $M$ and the sum of base $b$ digits of $N$, added to the reversal of the product, gives $N$. We show that for any $b$ there exists an infinity of $b$-additive Ramanujan-Hardy numbers and an infinity of additive multipliers. A $b$-multiplicative Ramanujan-Hardy number $N$ is an integer for which there exists at least an integer $M$, called multiplicative multiplier, such that the product of $M$ and the sum of ba…
We show that the (morphic) sequence $(-1)^{s_φ(n)}$ is asymptotically orthogonal to all bounded multiplicative functions, where $s_φ$ denotes the Zeckendorf sum-of-digits function. In particular we have $\sum_{n<N} (-1)^{s_φ(n)} μ(n) = o(N)$, that is, this sequence satisfies the Sarnak conjecture.
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)} \frac{4n+1}{2n(2n+1)(2n+2)} = -\frac{1}{4} $$ where $s_2(n)$ is the sum of the binary digits of the integer $n$. Furthermore closed formulas for series involving automatic sequences that are not strongly $B$-multiplicative, such as the regular paperfolding and Golay-Shapiro-Rudin sequences, are obtained; for example, for integer $d \geq 0$: $$ \sum_{n \geq 0} \frac{v(n)}{(n…
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or primitive roots, in sets which are described in an additive way, such as sumsets or Hilbert cubes. In particular, we show that if one fixes any proportion less than $40\%$ of the digits of all numbers of a given binary bit length, then the remaining set still has the asymptotically expected number of squarefree integers. Next, we investigate the distribution of primitive roots modulo a large prime $p$, establishing a new upper bound on the largest dimension of a Hilbert cu…
In this paper, we discuss a connection between geometric measure theory and number theory. This method brings a new point of view for some number-theoretic problems concerning digit expansions. Among other results, we showed that for each integer $k,$ there is a number $M>0$ such that if $b_1,\dots,b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose base $b_1,b_2,\dots,b_k$ expansions all do not have any zero digits.
Motivated by a question of Erdős, this paper considers questions concerning the discrete dynamical system on the 3-adic integers given by multiplication by 2. Let the 3-adic Cantor set consist of all 3-adic integers whose expansions use only the digits 0 and 1. The exception set is the set of 3-adic integers whose forward orbits under this action intersects the 3-adic Cantor set infinitely many times. It has been shown that this set has Hausdorff dimension 0. Approaches to upper bounds on the Hausdorff dimensions of these sets leads to study of intersections of multiplicative translates of Can…
Let $s_a(n)$ denote the sum of digits of an integer $n$ in the base $a$ expansion. Answering, in a extended form, a question of Deshouillers, Habsieger, Laishram, and Landreau, we show that, provided $a$ and $b$ are multiplicatively independent, any positive real number is a limit point of the sequence $\{s_b(n)/s_a(n)\}_{n=1}^{\infty}$. We also provide upper and lower bounds for the counting functions of the corresponding subsequences.
Paul Erdos asked how frequently the ternary expansion of 2^n omits the digit 2. He conjectured this happens only for finitely many values of n. We generalize this question to consider iterates of two discrete dynamical systems. The first is over the real numbers, and considers the integer part of lambda 2^n for a real input lambda. The second is over the 3-adic integers, and considers the sequence lambda 2^n for a 3-adic integer input lambda. We show that the number of input values that have infinitely many iterates omitting the digit 2 in their ternary expansion is small in a suitable sense. …
Let $λ(n)$ denote the exponent of the multiplicative group modulo $n$. We show that when $q$ is odd, each coprime residue class modulo $q$ is hit equally often by $λ(n)$ as $n$ varies. Under the stronger assumption that $\gcd(q,6)=1$, we prove that equidistribution persists throughout a Siegel--Walfisz-type range of uniformity. By similar methods we show that $λ(n)$ obeys Benford's leading digit law with respect to natural density. Moreover, if we assume GRH, then Benford's law holds for the order of $a$ mod $n$, for any fixed integer $a\notin \{0,\pm 1\}$.
Let $b$ be a positive integer greater than 1, $N$ a positive integer relatively prime to $b$, $ |b|_{N}$ the order of $b$ in the multiplicative group $% \mathbb{U}_{N}$ of positive integers less than $N$ and relatively primes to $% N,$ and $x\in\mathbb{U}_{N}$. It is well known that when we write the fraction $\frac{x}{N}$ in base $b$, it is periodic. Let $d,\,k$ be positive integers with $% d\geq2$ and such that $|b|_{N}=kd$ and $\frac{x}{N}=0.% bar{a_{1}a_{2}...a_{|b|_{N}}}$ with the bar indicating the period and $a_{i}$ are digits in base $b$. We separate the period ${a_{1}a_{2}... a_{|b|_{…
