On Fibonomial sums identities with special sign functions: analytically q-calculus approach

2018 ◽  
Vol 68 (3) ◽  
pp. 501-512
Author(s):  
Emrah Kiliç ◽  
Ilker Akkus
Keyword(s):  
Fibonacci Numbers ◽  
Upper Bounds ◽  
Binomial Coefficients ◽  
Sign Function ◽  
Weighted Functions ◽  
Fibonomial Coefficients ◽  
Binomial Sums

Abstract Recently Marques and Trojovsky [On some new identities for the Fibonomial coefficients, Math. Slovaca 64 (2014), 809–818] presented interesting two sum identities including the Fibonomial coefficients and Fibonacci numbers. These sums are unusual as they include a rare sign function and their upper bounds are odd. In this paper, we give generalizations of these sums including the Gaussian q-binomial coefficients. We also derive analogue q-binomial sums whose upper bounds are even. Finally we give q-binomial sums formulæ whose weighted functions are different from the earlier ones. To prove the claimed results, we analytically use q-calculus.

Series representing transcendental numbers that are not U-numbers

2015 ◽  
Vol 11 (03) ◽  
pp. 869-892
Author(s):  
Emre Alkan
Keyword(s):  
Rational Functions ◽  
Rational Numbers ◽  
Upper Bounds ◽  
Integral Representations ◽  
Binomial Coefficients ◽  
Elementary Functions ◽  
Linear Combinations ◽  
Type Series ◽  
Transcendental Numbers ◽  
Mathematical Constants

Using integral representations with carefully chosen rational functions as integrands, we find new families of transcendental numbers that are not U-numbers, according to Mahler's classification, represented by a series whose terms involve rising factorials and reciprocals of binomial coefficients analogous to Apéry type series. Explicit descriptions of these numbers are given as linear combinations with coefficients lying in a suitable real algebraic extension of rational numbers using elementary functions evaluated at arguments belonging to the same field. In this way, concrete examples of transcendental numbers which can be expressed as combinations of classical mathematical constants such as π and Baker periods are given together with upper bounds on their wn measures.

scholarly journals A new family of combinatorial numbers and polynomials associated with peters numbers and polynomials

2020 ◽  
pp. 42-42
Author(s):  
Yilmaz Simsek
Keyword(s):  
Generating Functions ◽  
Fibonacci Numbers ◽  
Recurrence Formula ◽  
Binomial Coefficients ◽  
Combinatorial Identity ◽  
Lucas Numbers ◽  
Fundamental Properties ◽  
Special Polynomials ◽  
New Family ◽  
Special Numbers And Polynomials

The aim of this paper is to define new families of combinatorial numbers and polynomials associated with Peters polynomials. These families are also a modification of the special numbers and polynomials in [11]. Some fundamental properties of these polynomials and numbers are given. Moreover, a combinatorial identity, which calculates the Fibonacci numbers with the aid of binomial coefficients and which was proved by Lucas in 1876, is proved by different method with the help of these combinatorial numbers. Consequently, by using the same method, we give a new recurrence formula for the Fibonacci numbers and Lucas numbers. Finally, relations between these combinatorial numbers and polynomials with their generating functions and other well-known special polynomials and numbers are given.

scholarly journals Some identities of Gaussian binomial coefficients

2022 ◽  
Vol Accepted manuscript ◽  
Author(s):  
Tian-Xiao He ◽  
Anthony G. Shannon ◽  
Peter J.-S. Shiue
Keyword(s):  
Binomial Coefficients ◽  
Recursive Sequences ◽  
Fibonomial Coefficients ◽  
Complete Functions ◽  
Gaussian Binomial Coefficients

In this paper, we present some identities of Gaussian binomial coefficients with respect to recursive sequences, Fibonomial coefficients, and complete functions by use of their relationships.

On sums related to the numerator of generating functions for the kth power of Fibonacci numbers on sums related to the numerator of generating functions for the kth power of Fibonacci numbers

2010 ◽  
Vol 60 (6) ◽  
Author(s):  
Pavel Pražák ◽  
Pavel Trojovský
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Fibonacci Numbers ◽  
Similar Type ◽  
Lucas Numbers ◽  
Fibonomial Coefficients ◽  
Sums Of Products

AbstractNew results about some sums s n(k, l) of products of the Lucas numbers, which are of similar type as the sums in [SEIBERT, J.—TROJOVSK Ý, P.: On multiple sums of products of Lucas numbers, J. Integer Seq. 10 (2007), Article 07.4.5], and sums σ(k) = $$ \sum\limits_{l = 0}^{\tfrac{{k - 1}} {2}} {(_l^k )F_k - 2l^S n(k,l)} $$ are derived. These sums are related to the numerator of generating function for the kth powers of the Fibonacci numbers. s n(k, l) and σ(k) are expressed as the sum of the binomial and the Fibonomial coefficients. Proofs of these formulas are based on a special inverse formulas.

scholarly journals On the Number of Shortest Weighted Paths in a Triangular Grid

Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 118
Author(s):  
Benedek Nagy ◽  
Bashar Khassawneh
Keyword(s):  
Euclidean Distance ◽  
Fibonacci Numbers ◽  
Shortest Paths ◽  
Combinatorial Problem ◽  
Infinite Graph ◽  
Binomial Coefficients ◽  
Triangular Grid ◽  
Weighted Graphs ◽  
Different Types ◽  
Weighted Paths

Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its dual, the triangular grid, paths between triangle pixels (we abbreviate this term to trixels) are counted. The number of shortest weighted paths between any two trixels of the triangular grid is discussed. For each trixel, there are three different types of neighbor trixels, 1-, 2- and 3-neighbours, depending the Euclidean distance of their midpoints. When considering weighted distances, the positive values α, β and γ are assigned to the ‘steps’ to various neighbors. We gave formulae for the number of shortest weighted paths between any two trixels in various cases by the respective weight values. The results are nicely connected to various numbers well-known in combinatorics, e.g., to binomial coefficients and Fibonacci numbers.

scholarly journals Certain subclasses of univalent and bi-univalent functions related to shell-like curves connected with Fibonacci numbers

2020 ◽  
Vol 28 (1) ◽  
pp. 125-140
Author(s):  
Gurmeet Singh ◽  
Gagandeep Singh ◽  
Gurcharanjit Singh
Keyword(s):  
Fibonacci Numbers ◽  
Univalent Functions ◽  
Upper Bounds ◽  
Hankel Determinant ◽  
Second Hankel Determinant

AbstractThis paper is concerned with certain subclasses of univalent and bi-univalent functions related to shell-like curves connected with Fibonacci numbers. We find estimates of the initial coefficients |a2| and |a3| for the functions in these classes. Also we investigate upper bounds for the Fekete-Szegö functional and second Hankel determinant for these classes.

scholarly journals Some properties of k-generalized Fibonacci numbers

2021 ◽  
Vol 50 ◽  
pp. 73-79
Author(s):  
Nazmiye Yılmaz ◽  
Ali Aydoğdu ◽  
Engin Özkan
Keyword(s):  
Fibonacci Numbers ◽  
Binomial Coefficients ◽  
Generalized Fibonacci Numbers ◽  
New Family

In the present paper, we propose some properties of the new family 𝑘-generalized Fibonacci numbers which related to generalized Fibonacci numbers. Moreover, we give some identities involving binomial coefficients for 𝑘-generalized Fibonacci numbers.

From golden-ratio equalities to Fibonacci and Lucas identities

2013 ◽  
Vol 97 (539) ◽  
pp. 234-241
Author(s):  
Martin Griffiths
Keyword(s):  
High School Students ◽  
Generating Functions ◽  
Golden Ratio ◽  
Fibonacci Numbers ◽  
Binomial Coefficients ◽  
Lucas Numbers ◽  
School Students ◽  
Simple Method ◽  
Matrix Methods ◽  
Binet’S Formula

We demonstrate here a remarkably simple method for deriving a large number of identities involving the Fibonacci numbers, Lucas numbers and binomial coefficients. As will be shown, this is based on the utilisation of some straightforward properties of the golden ratio in conjunction with a result concerning irrational numbers. Indeed, for the simpler cases at least, the derivations could be understood by able high-school students. In particular, we avoid the use of exponential generating functions, matrix methods, Binet's formula, involved combinatorial arguments or lengthy algebraic manipulations.

Sign in / Sign up

Export Citation Format

Share Document