中文
相关论文

相关论文: New Identities for Padovan Numbers

200 篇论文

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

组合数学 · 数学 2024-07-08 Yahia Djemmada , Abdelghani Mehdaoui , László Németh , László Szalay

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

数论 · 数学 2023-06-16 Carlo Sanna

We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…

数论 · 数学 2023-11-27 Jovan Mikić

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Recently Jianxin Wei and Yujun Yang introduced a one parameter generalization, Fibonacci $p$-cubes $\Gamma_n^p$, which are…

组合数学 · 数学 2025-02-12 Michel Mollard

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…

组合数学 · 数学 2025-12-22 Kunle Adegoke

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

数论 · 数学 2025-10-14 Tomohiro Yamada

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

数论 · 数学 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

In this article, we will discover some new generalized identity regarding continued fractions. We will connect the results to Fibonacci numbers and Lucas numbers. For all the proof, we will use induction.

数论 · 数学 2019-07-31 Shaoxiong Yuan

We study a new connection between multidimensional continued fractions, such as Jacobi--Perron algorithm, and additively indecomposable integers in totally real cubic number fields. First, we find the indecomposables of all signatures in…

数论 · 数学 2025-03-19 Vítězslav Kala , Ester Sgallová , Magdaléna Tinková

In this paper, we give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the nth Fibonacci number can be calculated without having any knowledge about the previous…

组合数学 · 数学 2013-02-28 Indhumathi Raman

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

离散数学 · 计算机科学 2017-05-03 Alexander V. Evako

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

交换代数 · 数学 2026-04-14 Francesca Cioffi , Margherita Guida , Enrica Pirozzi

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

数论 · 数学 2016-07-14 Joseph Vandehey

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…

We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…

组合数学 · 数学 2021-10-12 Jovan Mikić

In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…

数论 · 数学 2021-04-27 Ingrid Vukusic , Volker Ziegler

The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…

综合数学 · 数学 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

Semispecial quasi-Jordan algebras (also called Jordan dialgebras) are defined by the polynomial identities $a(bc) = a(cb)$, $(ba)a^2 = (ba^2)a$, and $(b,a^2,c) = 2(b,a,c)a$. These identities are satisfied by the product $ab = a \dashv b + b…

环与代数 · 数学 2010-08-17 Murray R. Bremner , Luiz A. Peresi

In this paper, we give closed form expressions of the Frobenius number for the triple of the $2$-step star numbers $an(n-2) + 1$ for an integer $a \geq 4$. These numbers have been studied from different aspects for some $a$'s. These numbers…

组合数学 · 数学 2024-09-24 Takao Komatsu , Ritika Goel , Neha Gupta

Let $\left\lbrace P_{k}\right\rbrace_{k\geq0}$ be the Padovan sequence defined by $P_{k}=P_{k-2}+P_{k-3}$ with initial values are $P_{0}=P_{1}=P_{2}=1$. Let $\left\lbrace R_{k}\right\rbrace_{k\geq0}$ be the Perrin sequence defined by…

数论 · 数学 2024-09-23 Mustafa Ismail , Ahmed Gaber , M. Anwar