Related papers: Random multiplicative walks on the residues modulo…

Let $\lambda$ be a partition of the positive integer $n$ chosen umiformly at random among all such partitions. Let $L_n=L_n(\lambda)$ and $M_n=M_n(\lambda)$ be the largest part size and its multiplicity, respectively. For large $n$, we…

Let $C_n$ be the $n$th Catalan number. We show that the asymptotic density of the set $\{n: C_n \equiv 0 \mod p \}$ is $1$ for all primes $p$, We also show that if $n = p^k -1$ then $C_n \equiv -1 \mod p$. Finally we show that if $n \equiv…

The arithmetic average of the first $n$ primes, $\bar p_n = {1\over n} \sum_{i=1}^n p_i$, exhibits very many interesting and subtle properties. Since the transformation from $p_n \to \bar p_n$ is extremely easy to invert, $p_n = n\bar p_n -…

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

We solve a problem due to Recam\'an about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo $n$, as $n \to \infty$.

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

We numerically estimate the leading asymptotic behavior of the length $L_{n}$ of the longest increasing subsequence of random walks with step increments following Student's $t$-distribution with parameter in the range $1/2 \leq \nu \leq 5$.…

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

Let $(x_n)_{n=1}^\infty$ be a sequence of integers. We study the number variance of dilations $(\alpha x_n)_{n=1}^\infty$ modulo 1 in intervals of length $S$, and establish pseudorandom (Poissonian) behavior for Lebesgue-almost all $\alpha$…

The paper considers estimates for the asymptotics of summation functions of bounded multiplicative arithmetic functions. Several assertions on this subject are proved and examples are considered.

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…

We survey arithmetic and asymptotic properties of the alternating sum-of-divisors function $\beta$ defined by $\beta(p^a)=p^a-p^{a-1}+p^{a-2}-...+(-1)^a$ for every prime power $p^a$ ($a\ge 1$), and extended by multiplicativity. Certain open…

Given a probability measure $\mu$ on a finitely generated group $\Gamma$, the Green function $G(x,y|r)$ encodes many properties of the random walk associated with $\mu$. Finding asymptotics of $G(x,y|r)$ as $y$ goes to infinity is a common…

The $N$-step random walk, elongated in the vicinity of a disc (in 2D) or a sphere (in 3D) of radius $R$, demonstrates a non-algebraic stretched exponential decay $P_N\sim \exp\left(-{\rm const}\, N^{1/3}\right)$ for the first return…

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

Andrews and Newman introduced the mex-function $\text{mex}_{A,a}(\lambda)$ for an integer partition $\lambda$ of a positive integer $n$ as the smallest positive integer congruent to $a$ modulo $A$ that is not a part of $\lambda$. They then…

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

The functions $F_{G}(n)$ measures the asymptotic behavior of residual finiteness for a finitely generated group $G$. In previous work \cite{Pengitore_1}, the author claimed a characterization for $F_{N}(n)$ when $N$ is a finitely generated…