Related papers: Structure and asymptotics for Catalan numbers modu…

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

In this paper, we characterize the odd positive integers $n$ satisfying the congruence $\sum_{j=1} ^ {n-1} j^{\frac{n-1}{2}}\equiv 0 \pmod n$. We show that the set of such positive integers has an asymptotic density which turns out to be…

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

The existence of infinitely many consecutive prime triples $p_n$, $ p_{n+1}$, and $p_{n+2}$ as $n \to \infty$, is sufficient to prove that the Catalan constant $\beta(2)=0.9159655941\ldots $ is an irrational number. This note provides the…

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

We consider the problem of finding the density of 1's in a configuration obtained by $n$ iterations of a given cellular automaton (CA) rule, starting from disordered initial condition. While this problems is intractable in full generality…

The modular Catalan numbers $C_{k,n}$, introduced by Hein and Huang in 2016 count equivalence classes of parenthesizations of $x_0 * x_1 * \dots *x_n$ where $*$ is a binary $k$-associative operation and $k$ is a positive integer. The…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

For K a cyclic cubic number field with odd class number containing a unit w such that Norm(w)=Norm(1-w)=-1, we prove that the density of rational primes p that satisfy the given spin relation is equal to 1/2. Furthermore, we prove that this…

We prove the following conjecture of Zeilberger. Denoting by $C_n$ the Catalan number, define inductively $A_n$ by $(-1)^{n-1}A_n=C_n+\sum_{j=1}^{n-1} (-1)^{j} \binom{2n-1}{2j-1} A_j \,C_{n-j}$ and $a_n=2A_n/C_n$. Then $a_n$ (hence $A_n$)…

We prove the density of the sets of the form ${{\lambda}_1^m {\mu}_1^n {\xi}_1 +...+{\lambda}_k^m {\mu}_k^n {\xi}_k : m,n \in \mathbb N}$ modulo one, where $\lambda_i$ and $\mu_i$ are multiplicatively independent algebraic numbers…

Let $\{P_n\}$ be the Catalan-Larcombe-French numbers given by $P_0=1,\ P_1=8$ and $n^2P_n=8(3n^2-3n+1)P_{n-1}-128(n-1)^2P_{n-2}$ $(n\ge 2)$, and let $S_n=P_n/2^n$. In this paper we deduce congruences for $S_{mp^r}\pmod{p^{r+2}}$,…

We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this…

The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in…

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

We give an asymptotic formula for the number of non-zero coefficients of modular forms (mod p).

In this paper, we study an asymptotic distribution of sets of primes satisfying certain "linking conditions" in arithmetic topology, namely, conditions given by the Legendre and R\'edei symbols among sets of primes. As our Main Theorem, we…