中文
相关论文

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

200 篇论文

This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…

组合数学 · 数学 2018-04-10 Johann Cigler

Let $p/q$ ($p, q \in \mathbb{N}^*$) be a positive rational number such that $p > q^2$. We show that for any $\epsilon > 0$, there exists a set $A(\epsilon) \subset [0, 1[$, with finite border and with Lebesgue measure $< \epsilon$, for…

数论 · 数学 2007-05-23 Bakir Farhi

Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and…

数论 · 数学 2019-02-20 Michael Bennett , Vandita Patel , Samir Siksek

Let $\{N_m\}_{m\ge0}$ be the Narayana's cows sequence given by $N_0=0$, $N_1=1=N_2=1$ and \[ N_{m+3}=N_{m+2}+N_m,\quad \text{ for }\; m\geq 0 \] and let $\{F_n\}_{n\ge0}$ be the Fibonacci sequence. In this paper we solve explicitely the…

数论 · 数学 2025-08-06 Japhet Odjoumani

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

数论 · 数学 2017-08-28 Jose Arnaldo B. Dris

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

数论 · 数学 2016-10-19 Dave Platt , Tim Trudgian

For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…

数论 · 数学 2023-09-27 Zhiguo Ding , Michael E. Zieve

A number is perfect if it is the sum of its proper divisors; here we call a finite group `perfect' if its order is the sum of the orders of its proper normal subgroups. (This conflicts with standard terminology but confusion should not…

群论 · 数学 2007-05-23 Tom Leinster

We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters . There exist no other nontrivial perfect quantum codes.

量子物理 · 物理学 2009-07-05 Zhuo Li , Lijuan Xing

Bugeaud, Mignotte, and Siksek proved that the only perfect powers in Fibonacci sequence are 0, 1, 8, and 144. In this paper, we study the polynomial analogue of the problem. Especially, we give a complete characterization of the Fibonacci…

数论 · 数学 2026-01-07 Graeme Bates , Ryan Jesubalan , Seewoo Lee , Jane Lu , Hyewon Shim

We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…

数论 · 数学 2025-02-25 Joel Louwsma

We study the problem of finding positive integers $n$ such that all the decimal digits of $2^n$ are even, i.e., belong to $\{0, 2, 4, 6, 8\}$. Computational checks up to $n = 10^{15}$ reveal the known cases $n = 1, 2, 3, 6, 11$ and no…

数论 · 数学 2025-08-13 Bogdan C. Dumitru

We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…

数论 · 数学 2025-01-03 Daniel Flores

We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) =…

数论 · 数学 2022-02-02 Jakub Konieczny

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

数论 · 数学 2021-03-29 Volker Ziegler

We prove that at least one of the six numbers $\beta(2i)$ for $i=1,\dots,6$ is irrational. Here $\beta(s)=\sum_{k=0}^\infty(-1)^k(2k+1)^{-s}$ denotes Dirichlet's beta function, so that $\beta(2)$ is Catalan's constant.

数论 · 数学 2019-07-23 Wadim Zudilin

Let $a$ and $b=ka$ be positive integers with $k\in \{2, 3, 6\},$ such that $ab+4$ is a perfect square. In this paper, we study the extensibility of the $D(4)$-pairs $\{a, ka\}.$ More precisely, we prove that by considering three families of…

Let $k, l, a$ and $b$ be positive integers with $\max\{a, \, b\}\ge2$. In this paper, we show that every positive rational number can be written as the form $\varphi(km^{a})/\varphi(ln^{b})$, where $m, \, n\in\mathbb{N}$ if and only if…

数论 · 数学 2022-12-05 Hongjian Li , Pingzhi Yuan , Hairong Bai

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

组合数学 · 数学 2010-01-13 Sandro Mattarei

In this paper we determine the perfect powers that are sums of three fifth powers in an arithmetic progression. More precisely, we completely solve the Diophantine equation $$ (x-d)^5 + x^5 + (x + d)^5 = z^n,~n\geq 2, $$ where $d,x,z \in…