Related papers: A variant of Ostrowski numeration

For $\alpha>1$ we represent a real number in $(0,1]$ in the form \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $d_{i}\in\mathbb{N}$. We discuss ergodic theoretical and dimension theoretical aspects of this…

This paper deals more generally with @-numbers defined as follows: Call `\textit{alpha number}' of order $(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2$, (denote its family by @$_{(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2;…

An $n$-bit Gray code is a sequence of all $n$-bit strings such that consecutive strings differ in a single bit. It is well-known that given $\alpha,\beta\in\{0,1\}^n$, an $n$-bit Gray code between $\alpha$ and $\beta$ exists iff the Hamming…

For an irrational $\alpha\in(0,1)$, we investigate the Ostrowski sum-of-digits function $\sigma_\alpha$. For $\alpha$ having bounded partial quotients and $\vartheta\in\mathbb R\setminus\mathbb Z$, we prove that the function $g:n\mapsto…

Congruences modulo prime powers involving generalized Harmonic numbers are known. While looking for similar congruences, we have encountered a curious triangular array of numbers indexed with positive integers $n,k$, involving the Bernoulli…

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

We will provide algorithmic implementation with proofs of existence and uniqueness for the Absolute and Alternating Ostrowski Numeration Systems.

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

It is a classical result of Mahler that for any rational number $\alpha$ > 1 which is not an integer and any real 0 < c < 1, the set of positive integers n such that $\alpha$ n < c n is necessarily finite. Here for any real x, x denotes the…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…

Let $\alpha$ and $\beta$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n \alpha + \beta \rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input…

Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…

Let $n$ be a positive integer and $\alpha_n$ be the arithmetic function which assigns the multiplicative order of $a^n$ modulo $n$ to every integer $a$ coprime to $n$ and vanishes elsewhere. Similarly, let $\beta_n$ assign the projective…

In 1960, Sierpi\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\'nski's theorem with $2^n$…

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

For $\alpha>1$, set $\beta=1/(\alpha-1)$. We show that, for every $1<\alpha<(\sqrt{21}+4)/5\approx1.717$, the number of pairs $(m,n)$ of positive integers with $d=\lfloor{n^\alpha}\rfloor - \lfloor{m^\alpha}\rfloor$ is equal to…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…