Distance Fibonacci Polynomials by Graph Methods

In this paper we introduce and study a new generalization of Fibonacci polynomials which generalize Fibonacci, Jacobsthal and Narayana numbers, simultaneously. We give a graph interpretation of these polynomials and we obtain a binomial formula for them. Moreover by modification of Pascal’s triangle, which has a symmetric structure, we obtain matrices generated by coefficients of generalized Fibonacci polynomials. As a consequence, the direct formula for generalized Fibonacci polynomials was given. In addition, we determine matrix generators for generalized Fibonacci polynomials, using the symmetric matrix of initial conditions.

On $$F_3(k,n)$$-numbers of the Fibonacci type

In this paper, we study a generalization of Narayana’s numbers and Padovan’s numbers. This generalization also includes a sequence whose elements are Fibonacci numbers repeated three times. We give combinatorial interpretations and a graph interpretation of these numbers. In addition, we examine matrix generators and determine connections with Pascal’s triangle.

Triangle of Triangular Numbers

Among several interesting number triangles that exist in mathematics, Pascal’s triangle is one of the best triangle possessing rich mathematical properties. In this paper, I will introduce a number triangle containing triangular numbers arranged in particular fashion. Using this number triangle, I had proved five interesting theorems which help us to generate Pythagorean triples as well as establish bijection between whole numbers and set of all integers.

Partial factorizations of products of binomial coefficients

Let [Formula: see text] the product of the elements of the [Formula: see text]th row of Pascal’s triangle. This paper studies the partial factorizations of [Formula: see text] given by the product [Formula: see text] of all prime factors [Formula: see text] of [Formula: see text] having [Formula: see text], counted with multiplicity. It shows [Formula: see text] as [Formula: see text] for a limit function [Formula: see text] defined for [Formula: see text]. The main results are deduced from study of functions [Formula: see text] that encode statistics of the base [Formula: see text] radix expansions of the integer [Formula: see text] (and smaller integers), where the base [Formula: see text] ranges over primes [Formula: see text]. Asymptotics of [Formula: see text] and [Formula: see text] are derived using the prime number theorem with remainder term or conditionally on the Riemann hypothesis.

PASCAL TRIANGLE AND PYTHAGOREAN TRIPLES

The concept of Pascal’s triangle has fascinated mathematicians for several centuries. Similarly, the idea of Pythagorean triples prevailing for more than two millennia continue to surprise even today with its abundant properties and generalizations. In this paper, I have demonstrated ways through four theorems to determine Pythagorean triples using entries from Pascal’s triangle.

Entropic Explanation of Power Set

A power set of a set S is defined as the set of all subsets of S, including set S itself and empty set, denoted as P(S) or 2S. Given a finite set S with |S|=n hypothesis, one property of power set is that the amount of subsets of S is |P(S)| = 2n. However, the physica meaning of power set needs exploration. To address this issue, a possible explanation of power set is proposed in this paper. A power set of n events can be seen as all possible k-combination, where k ranges from 0 to n. It means the power set extends the event space in probability theory into all possible combination of the single basic event. From the view of power set, all subsets or all combination of basic events, are created equal. These subsets are assigned with the mass function, whose uncertainty can be measured by Deng entropy. The relationship between combinatorial number, Pascal's triangle and power set is revealed by Deng entropy quantitively from the view of information measure.

GENERALIZED PASCAL’S TRIANGLE AND METALLIC RATIOS

In this paper, I had demonstrated the way to determine the sequence of metallic ratios by generalizing the usual Pascal’s triangle. In doing so, I found several interesting properties that had been discussed in detail in this paper. I had proved four new results upon generalizing Pascal’s triangle. Thus, the primary aim of this paper is to connect the idea of Generalized Pascal’s triangle with that to the sequence of metallic ratios.