• Kyungpook Mathematical Journal
• /
• v.57 no.1
• /
• pp.1-84
• /
• 2017

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where p is a prime of a certain type. We also define period of a Fibonacci sequence modulo an integer, m and derive certain interesting properties related to them. Afterwards, we derive some new properties of a class of generalized Fibonacci numbers. In the last part of the paper we introduce some generalized Fibonacci polynomial sequences and we derive some results related to them.

• Kyungpook Mathematical Journal
• /
• v.59 no.1
• /
• pp.23-34
• /
• 2019

In this paper, we first define generalizations of Pell and Pell-Lucas sequences by the recurrence relations $$p_n=2ap_{n-1}+(b-a^2)p_{n-2}\;and\;q_n=2aq_{n-1}+(b-a^2)q_{n-2}$$ with initial conditions $p_0=0$, $p_1=1$, and $p_0=2$, $p_1=2a$, respectively. We give generating functions and Binet's formulas for these sequences. Also, we obtain some identities of these sequences.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.4
• /
• pp.327-334
• /
• 2021

In this paper, we find all the prime numbers p that satisfy the following statement. If a positive integer k is a divisor of p - 1, then there is a sequence consisting of all k-th power residues modulo p, satisfying the recurrence equation of the Fibonacci sequence modulo p.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1269-1277
• /
• 2022

In this paper we consider a sequence of polynomials defined by some recurrence relation. They include, for instance, Poupard polynomials and Kreweras polynomials whose coefficients have some combinatorial interpretation and have been investigated before. Extending a recent result of Chapoton and Han we show that each polynomial of this sequence is a self-reciprocal polynomial with positive coefficients whose all roots are unimodular. Moreover, we prove that their arguments are uniformly distributed in the interval [0, 2𝜋).

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.385-391
• /
• 2003

A sequence of n Bernoulli trials which violates the constant success probability assumption is termed as "Poisson trials". In this paper, the recurrence formula for the r-th central moment of number of successes with n Poisson trials is derived. Romanovsky's method, based on the differentiation of characteristic function, is used in the derivation of recurrence formula for the central moments of conventional binomial distribution. Romanovsky's method is applied to that of Poisson trials in this paper. Some central moment calculation results are given to compare the central moments of Poisson trials with those of conventional binomial distribution.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.723-734
• /
• 2019

We study the negative trinomial table T' of $(x^2+x+1)^{-n}$ and its t/u-slope diagonals for any t, u > 0. We investigate recurrence formula of the t/u-slope diagonal sums of T' and find interrelationships with t/u-slope diagonal sums of the trinomial table T.

• Communications of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.341-354
• /
• 2023

In this article, an alternating Fibonacci sequence is defined from a second-order linear homogeneous recurrence relation with constant coefficients. Then, the determinant, inverse, and eigenvalues of the circulant matrices with entries in the first row having the formation of the sequence are formulated explicitly in a simple way. In this study, the method for deriving the formulation of the determinant and inverse is simply using traditional elementary row or column operations. For the eigenvalues, the known formulation from the case of general circulant matrices is simplified by considering the specialty of the sequence and using cyclic group properties. We also propose algorithms for the formulation to show how efficient the computations are.

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.463-469
• /
• 2004

In this paper we establish some recurrence relations satisfied by quotient moments of upper record values from the exponential distribution. Let $\{X_n,\;n{\geq}1\}$ be a sequence of independent and identically distributed random variables with a common continuous distribution function F(x) and probability density function(pdf) f(x). Let $Y_n=max\{X_1,\;X_2,\;{\cdots},\;X_n\}$ for $n{\geq}1$. We say $X_j$ is an upper record value of $\{X_n,\;n{\geq}1\}$, if $Y_j>Y_{j-1}$, j > 1. The indices at which the upper record values occur are given by the record times {u(n)}, $n{\geq}1$, where u(n)=min\{j{\mid}j>u(n-1),\;X_j>X_{u(n-1)},\;n{\geq}2\} and u(1) = 1. Suppose $X{\in}Exp(1)$. Then $\Large{E\;\left.{\frac{X^r_{u(m)}}{X^{s+1}_{u(n)}}}\right)=\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n)}}}\right)}$ and $\Large{E\;\left.{\frac{X^{r+1}_{u(m)}}{X^s_{u(n)}}}\right)=\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m-1)}}{X^s_{u(n-1)}}}\right)}$.

• Kyungpook Mathematical Journal
• /
• v.49 no.3
• /
• pp.483-492
• /
• 2009

In this paper we give formulae for sums of products of two Horadam type generalized Fibonacci numbers with the same recurrence equation and with possibly different initial conditions. Analogous improved alternating sums are also studied as well as various derived sums when terms are multiplied either by binomial coefficients or by members of the sequence of natural numbers. These formulae are related to the recent work of Belbachir and Bencherif, $\v{C}$erin and $\v{C}$erin and Gianella.

• Korean Journal of Mathematics
• /
• v.16 no.3
• /
• pp.301-307
• /
• 2008

Let $R_n$ be the the first return time to its initial n-word. Then the Ornstein-Weiss first return time theorem implies that log$R_n$ divided by n converges to entropy. We consider the convergence of log$R_n$ for Sturmian sequences which has the lowest complexity. In this case, we normalize the logarithm of the first return time by log n. We show that for any numbers $1{\leq}{\alpha},\;{\beta}{\leq}{\infty}$, there is a Sturmian sequence of which limsup is ${\alpha}$ and liminf is $1/{\beta}$.