English
Related papers

Related papers: Notes on Divisibility of Catalan Numbers

200 papers

An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…

Combinatorics · Mathematics 2014-04-28 Antoine Genitrini , Cécile Mailler

For a positive integer $k$, let \[ \sigma_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $\nu_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of…

Number Theory · Mathematics 2026-03-13 Kaimin Cheng , Ke Zhang

The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the…

Combinatorics · Mathematics 2022-02-03 Parth Chavan , Andrew Lee , Karthik Seetharaman

Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…

Probability · Mathematics 2007-05-23 James Allen Fill , Nevin Kapur

We study the Weierstrass division theorem for function germs in strongly non-quasianalytic Denjoy-Carleman classes $\mathcal{C}_M$. For suitable divisors $P(x,t)=x^d+a_1(t)x^{d-1}+\cdots+a_d(t)$ with real-analytic coefficients $a_j$, we…

Complex Variables · Mathematics 2016-03-24 Vincent Thilliez

In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…

Number Theory · Mathematics 2011-08-01 Apoorva Khare

A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.

Combinatorics · Mathematics 2007-05-23 Siu-Ah Ng

For $r \in \mathbb{R}, r> 1$ and $n \in \mathbb{Z}^+$, the divisor function $\sigma_{-r}$ is defined by $\sigma_{-r}(n) := \sum_{d \vert n} d^{-r}$. In this paper we show the number $C_r$ of connected components of…

Number Theory · Mathematics 2017-12-06 Nina Zubrilina

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

Sequences of the form $(\gcd(u_n,v_n))_{n \in \mathbb N}$, with $(u_n)_n$, $(v_n)_n$ sums of $S$-units, have been considered by several authors. The study of $\gcd(n,u_n)$ corresponds, following Silverman, to divisibility sequences arising…

Number Theory · Mathematics 2024-08-16 Abhishek Jha , Ayan Nath , Emanuele Tron

One of the main goals in this paper is to establish convolution sums of functions for the divisor sums $\widetilde{\sigma}_s(n)=\sum_{d|n}(-1)^{d-1}d^s$ and $\widehat{\sigma}_s(n)=\sum_{d|n}(-1)^{\frac{n}{d}-1}d^s$, for certain $s$, which…

Number Theory · Mathematics 2015-07-17 Heekyoung Hahn

Let p be any odd prime. We mainly show that $$\sum_{k=1}^{p-1}binomial(3k,k)*2^k/k=0 (mod p)$$ and $$\sum_{k=1}^{p-1}2^{k-1}C_k^{(2)}=(-1)^{(p-1)/2}-1 (mod p),$$ where $C_k^{(2)}=binomial(3k,k)/(2k+1)$ is the $k$th Catalan number of order…

Number Theory · Mathematics 2009-09-27 Li-Lu Zhao , Hao Pan , Zhi-Wei Sun

The Catalan number sequence is one of the most famous number sequences in combinatorics and is well studied in the literature. In this paper we further investigate its fundamental properties related to the moment problem and prove for the…

Combinatorics · Mathematics 2018-07-02 Gwo Dong Lin

N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can…

Number Theory · Mathematics 2015-10-21 Andrew V. Lelechenko

We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface $\Sigma$ and introduce the number $C_{\Sigma}(n)$ of non-crossing partitions of a set of $n$ points laying on…

Combinatorics · Mathematics 2015-03-19 Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos

We consider the function $G(n)=\frac{\sigma(n)}{n\log\log n}$ (where $\sigma(n)=\sum_{d|n}d$) and set an imposed condition on its argument $n$, the fulfillment of which is sufficient for the existence of a prime $p$, at which $G(np)>G(n)$.…

Number Theory · Mathematics 2013-07-02 Aleksandr Morkotun

In this paper, we study arithmetic properties of weighted Catalan numbers. Previously, Postnikov and Sagan found conditions under which the $2$-adic valuations of the weighted Catalan numbers are equal to the $2$-adic valutations of the…

Combinatorics · Mathematics 2019-08-13 Yibo Gao , Andrew Gu

A finitization of the Catalan numbers $ C_n $ can be defined as Euler characteristics of an algebraic structure. We conjecture the existence of a $ q $-deformed version of such structure, and provide evidence for the first two non-trivial…

Combinatorics · Mathematics 2020-11-20 Keke Zhang

We study some divisibility properties related to the factors of the discriminant of the characteristic polynomial of generalized Fibonacci sequences $(G_n)_{n\ge0}$ defined by $G_0=0$, $G_1=1$ and $G_n=pG_{n-1}+qG_{n-2}$ for $n\ge2$, where…

Number Theory · Mathematics 2020-07-03 Yao-Qiang Li

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Number Theory · Mathematics 2021-09-22 Tomohiro Yamada