中文
相关论文

相关论文: Perfect powers in Catalan and Narayana numbers

200 篇论文

The $q$-Narayana numbers $N_q(n,k)$ and $q$-Catalan numbers $C_n(q)$ are respectively defined by $$ N_q(n,k)=\frac{1-q}{1-q^n}{n\brack k}{n\brack k-1}\quad\text{and}\quad C_n(q)=\frac{1-q}{1-q^{n+1}}{2n\brack n}, $$ where ${n\brack…

数论 · 数学 2017-03-02 Victor J. W. Guo , Qiang-Qiang Jiang

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

综合数学 · 数学 2024-01-10 Atilla Akkuş

This work is devoted to proving that, given an integer $x \ge 2$, there are infinitely many perfect powers, coprime with $x$, having exactly $k \ge 3$ non-zero digits in their base $x$ representation, except for the case $x=2, k=4$, for…

数论 · 数学 2022-01-19 Alessio Moscariello

We study triples {a,b,c} of distinct nonzero rational numbers such that a+1,b+1,c+1,ab+1,ac+1,bc+1 and abc+1 are all perfect squares. We prove that there exist infinitely many such triples. In contrast, we show that no triple of positive…

数论 · 数学 2026-04-13 Andrej Dujella , Matija Kazalicki , Vinko Petričević

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

组合数学 · 数学 2008-05-12 Toufik Mansour , Yidong Sun

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

数论 · 数学 2017-07-24 Vandita Patel

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

数论 · 数学 2022-02-01 Sai Teja Somu , Vidyanshu Mishra

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

计算机科学中的逻辑 · 计算机科学 2015-09-22 John Cowles , Ruben Gamboa

We define a weighted analog for the multidimensional Catalan numbers, obtain matrix-based recurrences for some of them, and give conditions under which they are periodic. Building on this framework, we introduce two new sequences of…

组合数学 · 数学 2025-10-17 Ryota Inagaki , Dimana Pramatarova

We investigate the consecutive primes $p$ and $q$ ($p > q$) for which there exists a pair of natural numbers $(x,y)$ such that $p^x-q^y$ is a perfect square and make some conjectures.

数论 · 数学 2016-04-20 Alessandro Ventullo

Catalan's conjecture claims that the Diophantine equation $x^p-y^q=1$ admits the unique solution $3^2-2^3=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic…

数论 · 数学 2017-02-14 Paolo Leonetti

We prove the total positivity of the Narayana triangles of type $A$ and type $B$, and thus affirmatively confirm a conjecture of Chen, Liang and Wang and a conjecture of Pan and Zeng. We also prove the strict total positivity of the…

组合数学 · 数学 2017-02-28 Yi Wang , Arthur L. B. Yang

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

数论 · 数学 2011-03-25 Victor J. W. Guo , Jiang Zeng

Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…

数论 · 数学 2014-12-12 Colin Defant

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…

组合数学 · 数学 2018-07-02 Gwo Dong Lin

We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next,…

组合数学 · 数学 2025-05-26 Arthur Rodelet--Causse , Lenny Tevlin

The Super-Catalan numbers are a generalization of the Catalan numbers defined as $T(m,n) = \frac{(2m)!(2n)!}{2m!n!(m+n)!}$. It is an open problem to find a combinatorial interpretation for $T(m,n)$. We resolve this for $m=3,4$ using a…

组合数学 · 数学 2020-08-04 Irina Gheorghiciuc , Gidon Orelowitz

Given a sequence of integers b = (b_0,b_1,b_2,...) one gives a Dyck path P of length 2n the weight wt(P) = b_{h_1} b_{h_2} ... b_{h_n}, where h_i is the height of the ith ascent of P. The corresponding weighted Catalan number is C_n^b =…

组合数学 · 数学 2007-05-23 Alexander Postnikov , Bruce Sagan

In this note, we present some new results on even almost perfect numbers which are not powers of two. In particular, we show that $2^{r+1} < b$, if ${2^r}{b^2}$ is an even almost perfect number.

数论 · 数学 2017-02-07 John Rafael M. Antalan , Jose Arnaldo B. Dris

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

数论 · 数学 2016-02-16 Pedro J. Miana , Hideyuki Ohtsuka , Natalia Romero
‹ 上一页 1 2 3 10 下一页 ›