Related papers: Notes on Divisibility of Catalan Numbers

This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…

For any real number $s$, let $\sigma_s$ be the generalized divisor function, i.e., the arithmetic function defined by $\sigma_s(n) := \sum_{d \, \mid \, n} d^s$, for all positive integers $n$. We prove that for any $r > 1$ the topological…

We present new expressions for the $k$-generalized Fibonacci numbers, say $F_k(n)$. They satisfy the recurrence $F_k(n) = F_k(n-1) +\dots+F_k(n-k)$. Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are…

For a fixed $z\in\mathbb{C}$ and a fixed $k\in\mathbb{N}$, let $\sigma_{z}^{(k)}(n)$ denote the sum of $z$-th powers of those divisors $d$ of $n$ whose $k$-th powers also divide $n$. This arithmetic function is a simultaneous generalization…

We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued…

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

We extend the notion of polynomial integration over an arbitrary circle $C$ in the Euclidean geometry over general fields $\mathbb F$ of characteristic zero as a normalized $\mathbb F$-linear functional on $\mathbb{F}\left[\alpha_1,…

A probability distribution is n-divisible if its nth convolution root exists. While modeling the dependence structure between several (re)insurance losses by an additive risk factor model, the infinite divisibility, that is the…

Let $C_n$ be the $n$th Catalan number. For any prime $p \geq 5$ we show that the set $\{C_n : n \in \mathbb{N} \}$ contains all residues mod $p$. In addition all residues are attained infinitely often. Any positive integer can be expressed…

After defining continuous extensions of binary relations on the set N of natural numbers to its Stone-Cech compactification \beta N, we establish some results about one of such extensions. This provides us with one possible divisibility…

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

We study sigma-additive set functions defined on a hereditary subclass of a sigma-algebra and taken values in the extended real line. Analogs of the Jordan decomposition theorem and the Radon-Nikodym theorem are obtained.

In this paper we establish a new formula for the arithmetic functions that verify $ f(n) = \sum_{d|n} g(d)$ where $g$ is also an arithmetic function. We prove the following identity, $$\forall n \in \mathbb{N}^*, \ \ \ f(n) = \sum_{k=1}^n…

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(\zeta_1,\ldots,\zeta_N)$, where $\zeta_1,\ldots,\zeta_N$ range over…

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…