相关论文: On the last digit and the last non-zero digit of $…
In this paper we study the sequence of strings of $k$ last nonzero digits of $n!$ in a given base $b$. We determine for which $b$ this sequence is automatic and show how to generate it using a uniform morphism. We also compute how often…
We prove that the sequence of the last nonzero digits of factorials in every integer base $b>2$ is not eventually periodic. We also extend the Adamczewski--Bugeaud criterion, originally formulated for integer base expansions, to Cantor base…
Let $b \geq 2$ be an integer base with prime factors $p_1, \ldots, p_s$. In this paper we study sequences of "$b$-adic valuations" and last nonzero digits in $b$-adic expansions of the values $f(n) = (f_1(n), \ldots, f_s(n))$, where each…
Understanding the distribution of digits in the expansions of perfect powers in different bases is difficult. Rather than consider the asymptotic digit distributions, we consider the base-10 digits of a restricted sequence of powers of two.…
Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with…
In this paper will be proved the existence of a formula to reduce a tetration of base $2^{k}$ and $5^{k}$ $\mod 10^{n}$. Indeed, last digits of a tetration are the same starting from a certain hyper-exponent; In order to compute the last…
We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we…
If we form a decimal where the nth digit is the last non-zero digit of $n!$ (likewise, the last non-zero digit of $n^n$), we obtain an irrational number
We consider a variant of Stern's diatomic sequence, studied recently by Northshield. We prove that this sequence $b$ is invariant under \emph{digit reversal} in base $3$, that is, $b_n=b_{n^R}$, where $n^R$ is obtained by reversing the…
This paper investigates the behavior of the last digits of a tetration of generic base. In fact, last digits of a tetration are the same starting from a certain hyper-exponent and in order to compute them we reduce those expressions $\mod…
The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a…
The third-named author recently proved [Israel J. of Math. 258 (2023), 475--502] that there are infinitely many \textit{collisions} of the base-2 and base-3 sum-of-digits functions. In other words, the equation \[ s_2(n)=s_3(n) \] admits…
In 1962 O. A. Gross proved that the last digits of the Fubini numbers (or surjective numbers) have a simple periodicity property. We extend this result to a wider class of combinatorial numbers coming from restricted set partitions.
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
We first give a summary of the history of transcendental numbers then use a nice technique by G. Dresden to prove a new transcendental number. In particular, while previous work looked at the last non-zero digit of $n^n$, we consider the…
We study the problem of finding positive integers $n$ such that all the decimal digits of $2^n$ are even, i.e., belong to $\{0, 2, 4, 6, 8\}$. Computational checks up to $n = 10^{15}$ reveal the known cases $n = 1, 2, 3, 6, 11$ and no…
Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…
Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with…
A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…
We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…