Related papers: A Generalized Digit Map: Periodicity, Prouhet-Tarr…
Menon's identity states that for every positive integer $n$ one has $\sum (a-1,n) = \varphi(n) \tau(n)$, where $a$ runs through a reduced residue system (mod $n$), $(a-1,n)$ stands for the greatest common divisor of $a-1$ and $n$,…
In this paper we characterize, in terms of the prime divisors of $n$, the pairs $(k,n)$ for which $n$ divides $\sum_{j=1}^n j^{k}$. As an application, we study the sets $\mathcal{M}_f :=\{n: n \textrm{divides} \sum_{j=1}^n j^{f(n)} \}$ for…
Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…
We consider two sequences $a(n)$ and $b(n)$, $1\leq n<\infty$, generated by Dirichlet series $$\sum_{n=1}^{\infty}\frac{a(n)}{\lambda_n^{s}}\qquad\text{and}\qquad \sum_{n=1}^{\infty}\frac{b(n)}{\mu_n^{s}},$$ satisfying a familiar functional…
In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…
A given self-map $f\colon M\to M$ of a compact manifold determines the sequence $(L(f^n))$ of the Lefschetz numbers of its iterations. We consider its dual sequence $(a_n(f))$ given by the M\"obius inversion formula. The set ${\mathcal…
Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th…
Let $\psi_1,...,\psi_k$ be periodic maps from $\Bbb Z$ to a field of characteristic p (where p is zero or a prime). Assume that positive integers $n_1,...,n_k$ not divisible by p are their periods respectively. We show that…
This paper explores the Prouhet-Tarry-Escott problem (PTE), the Generalized PTE problem (GPTE), and the Fermat form of Generalized PTE problem (FPTE). The GPTE problem extends the PTE problem by allowing different sets of exponents, while…
The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor{\frac{n}{m_j}}\rfloor},$$ where the $m_i$'s are integers with $m_i\ge 2$. The main novelty of this…
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…
We consider the inverse problem for the polynomial map which sends an $m$-tuple of quadratic forms in $n$ variables to the sum of their $d$-th powers. This map captures the moment problem for mixtures of $m$ centered $n$-variate Gaussians.…
Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…
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…
When studying the least common multiple of some finite sequences of integers, the first author introduced the interesting arithmetic functions $g_k$ $(k \in \mathbb{N})$, defined by $g_k(n) := \frac{n (n + 1) ... (n + k)}{\lcm(n, n + 1,…
The Morse-Hedlund Theorem states that a bi-infinite sequence $\eta$ in a finite alphabet is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$. In dimension two,…
The classical Menon's identity [7] states that \begin{equation*}\label{oldbegin1} \sum_{\substack{a\in\Bbb Z_n^\ast }}\gcd(a -1,n)=\varphi(n) \sigma_{0} (n), \end{equation*} where for a positive integer $n$, $\Bbb Z_n^\ast$ is the group of…
It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an…
An exact formula \[ B(n) = \frac{n}{2}(\lfloor \lg n \rfloor + 1) - \sum _{k=0} ^{\lfloor \lg n \rfloor} 2^k Zigzag(\frac{n}{2^{k+1}}), \] where \[ Zigzag (x) = \min (x - \lfloor x \rfloor, \lceil x \rceil - x), \] for the minimal number $…