Related papers: Perfect powers in Catalan and Narayana numbers
In this paper, we generalize the Catalan number to the $(n,k)$-th Catalan numbers and find a combinatorial description that the $(n,k)$-th Catalan numbers is equal to the number of partitions of $n(k-1)+2$ polygon by $(k+1)$-gon where all…
The generating functions of some sequences of Catalan numbers and Narayana polynomials have simple expansions as continued fractions of Jacobi type. We give an overview of these facts and prove analogous results for q-Narayana polynomials…
Let $\mathbb K$ be a perfect field of characterstic $p\ge 0$ and let $R\in \mathbb K(x)$ be a rational function. This paper studies the number $\Delta_{\alpha, R}(n)$ of distinct solutions of $R^{(n)}(x)=\alpha$ over the algebraic closure…
The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…
Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the…
We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…
A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…
In this paper we study practical numbers of some special forms. For any integers $b\ge0$ and $c>0$, we show that if $n^2+bn+c$ is practical for some integer $n>1$, then there are infinitely many nonnegative integers $n$ with $n^2+bn+c$…
A positive quadratic form is $(k,\ell)$-universal if it represents all the numbers $kx+\ell$ where $x$ is a non-negative integer, and almost $(k,\ell)$-universal if it represents all but finitely many of them. We prove that for any $k,\ell$…
We prove that there are finitely many perfect powers in elliptic divisibility sequences generated by a non-integral point on elliptic curves of the from $y^2=x(x^2+b)$, where $b$ is any positive integer. We achieve this by using the…
In this paper, we focus on Narayana numbers which can be written as a products of four repdigits in base $g$, where $g$ is an integer with $g\geq2$. We prove that for $g$ between $2$ and $12$, there are finitely many of these numbers.…
The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q=1, to the Catalan numbers: 1, 1, 2, 5, 14,..., a log-convex sequence. We use a combinatorial interpretation of…
In the present paper we find a new interpretation of Narayana polynomials N_n(x) which are the generating polynomials for the Narayana numbers N_{n,k} counting Dyck paths of length n and with exactly k peaks. Strangely enough Narayana…
Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…
We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…
In this note, we show that if $N$ is an odd perfect number and $q^{\alpha}$ is some prime power exactly dividing it, then $\sigma(N/q^{\alpha})/q^{\alpha}>5$. In general, we also show that if $\sigma(N/q^{\alpha})/q^{\alpha}<K$, where $K$…
Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…
(Below, \Box means "perfect square") Let $P$ and $Q$ be non-zero integers. The Lucas sequence $\{U_n(P,Q)\}$ is defined by $U_0=0$, $U_1=1$, $U_n=P U_{n-1}-Q U_{n-2}$, $(n \geq 2)$. Historically, there has been much interest in when the…