• 제목/요약/키워드: Fibonacci numbers

검색결과 56건 처리시간 0.019초

COEFFICIENT INEQUALITIES FOR ANALYTIC FUNCTIONS CONNECTED WITH k-FIBONACCI NUMBERS

  • Serap, Bulut;Janusz, Sokol
    • 호남수학학술지
    • /
    • 제44권4호
    • /
    • pp.521-534
    • /
    • 2022
  • In this paper, we introduce a new class 𝓡kλ(λ ≥ 1, k is any positive real number) of univalent complex functions, which consists of functions f of the form f(z) = z + Σn=2 anzn (|z| < 1) satisfying the subordination condition $$(1-{\lambda}){\frac{f(z)}{z}}+{\lambda}f^{\prime}(z){\prec}{\frac{1+r^2_kz^2}{1-k{\tau}_kz-{\tau}^2_kz^2}},\;{\tau}_k={\frac{k-{\sqrt{k^2+4}}}{2}$$, and investigate the Fekete-Szegö problem for the coefficients of f ∈ 𝓡kλ which are connected with k-Fibonacci numbers $F_{k,n}={\frac{(k-{\tau}_k)^n-{\tau}^n_k}{\sqrt{k^2+4}}}$ (n ∈ ℕ ∪ {0}). We obtain sharp upper bound for the Fekete-Szegö functional |a3-𝜇a22| when 𝜇 ∈ ℝ. We also generalize our result for 𝜇 ∈ ℂ.

GENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx2 AND wx2 ∓ 1

  • Keskin, Refik
    • 대한수학회보
    • /
    • 제51권4호
    • /
    • pp.1041-1054
    • /
    • 2014
  • Let $P{\geq}3$ be an integer and let ($U_n$) and ($V_n$) denote generalized Fibonacci and Lucas sequences defined by $U_0=0$, $U_1=1$; $V_0= 2$, $V_1=P$, and $U_{n+1}=PU_n-U_{n-1}$, $V_{n+1}=PV_n-V_{n-1}$ for $n{\geq}1$. In this study, when P is odd, we solve the equations $V_n=kx^2$ and $V_n=2kx^2$ with k | P and k > 1. Then, when k | P and k > 1, we solve some other equations such as $U_n=kx^2$, $U_n=2kx^2$, $U_n=3kx^2$, $V_n=kx^2{\mp}1$, $V_n=2kx^2{\mp}1$, and $U_n=kx^2{\mp}1$. Moreover, when P is odd, we solve the equations $V_n=wx^2+1$ and $V_n=wx^2-1$ for w = 2, 3, 6. After that, we solve some Diophantine equations.

피보나치트리에서 피보나치 에지 번호매김방법 (The Fibonacci Edge Labelings on Fibonacci Trees)

  • 김용석
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제36권6호
    • /
    • pp.437-450
    • /
    • 2009
  • 본 논문에서는 임의의 피보나치 트리에 에지번호매김을 하여 피보나치 수들의 집합 {$F_k|k\;{\geq}\;2$}, {$F_{2k}|k\;{\geq}\;1$} 그리고 {$F_{3k+2}|k\;{\geq}\;0$}인 세가지 경우의 에지번호 집합을 얻는 7가지의 에지번호매김방법들을 제안한다. 이러한 에지번호들의 집합은 상호연결망의 일종인 원형군의 설계시 점프열로 사용할 수 있으므로 망척도 중 하나인 분지수를 결정한다.

ON THE g-CIRCULANT MATRICES

  • Bahsi, Mustafa;Solak, Suleyman
    • 대한수학회논문집
    • /
    • 제33권3호
    • /
    • pp.695-704
    • /
    • 2018
  • In this paper, firstly we compute the spectral norm of g-circulant matrices $C_{n,g}=g-Circ(c_0,c_1,{\cdots},c{_{n-1}})$, where $c_i{\geq}0$ or $c_i{\leq}0$ (equivalently $c_i{\cdot}c_j{\geq}0$). After, we compute the spectral norms, determinants and inverses of the g-circulant matrices with the Fibonacci and Lucas numbers.

DIOPHANTINE TRIPLE WITH FIBONACCI NUMBERS AND ELLIPTIC CURVE

  • Park, Jinseo
    • 대한수학회논문집
    • /
    • 제36권3호
    • /
    • pp.401-411
    • /
    • 2021
  • A Diophantine m-tuple is a set {a1, a2, …, am} of positive integers such that aiaj+1 is a perfect square for all 1 ≤ i < j ≤ m. Let Ek be the elliptic curve induced by Diophantine triple {F2k, 5F2k+2, 3F2k + 7F2k+2}. In this paper, we find the structure of a torsion group of Ek, and find all integer points on Ek under assumption that rank(Ek(ℚ)) = 1 and some further conditions.

ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2

  • Bravo, Jhon J.;Luca, Florian;Yazan, Karina
    • 대한수학회보
    • /
    • 제54권3호
    • /
    • pp.1069-1080
    • /
    • 2017
  • The Tribonacci sequence ${\{T_n}\}_{n{\geq}0}$ resembles the Fibonacci sequence in that it starts with the values 0, 1, 1, and each term afterwards is the sum of the preceding three terms. In this paper, we find all integers c having at least two representations as a difference between a Tribonacci number and a power of 2. This paper continues the previous work [5].

THE GRAM AND HANKEL MATRICES VIA SPECIAL NUMBER SEQUENCES

  • Yasemin Alp;E.Gokcen Kocer
    • 호남수학학술지
    • /
    • 제45권3호
    • /
    • pp.418-432
    • /
    • 2023
  • In this study, we consider the Hankel and Gram matrices which are defined by the elements of special number sequences. Firstly, the eigenvalues, determinant, and norms of the Hankel matrix defined by special number sequences are obtained. Afterwards, using the relationship between the Gram and Hankel matrices, the eigenvalues, determinants, and norms of the Gram matrices defined by number sequences are given.

히스테리시스 특성을 고려한 전자계의 유한 요소 해석 (Finite Element Analysis of Electromagnetic Systems Considering Hysteresis Characteristics)

  • 김홍규;홍선기;정현교
    • 대한전기학회논문지:전기기기및에너지변환시스템부문B
    • /
    • 제48권3호
    • /
    • pp.118-123
    • /
    • 1999
  • This paper describes the finite element procedure including the magnetic hysteresis phenomena. The magnetization-dependent Preisach model is employed to simulate the magnetic hysteresis and applied to each elements. Magnetization is calculated by the Fibonacci search method for the applied field in the implementation of the magnetization-dependent model. This can calculate the magnetization very accurately with small iteration numbers. The magnetic field intensity and the magnetization corresponding to the magnetic flux density obtained by the finite element analysis(FEA) are computed at the same time under the condition that these balues must satisfy the constitutive equation. In order to reduce the total calculation cost, pseudo-permeability is used for the input for the FEA. It is found that the presented method is very useful in combining the hysteresis model with the finite element method.

  • PDF

SOME CONDITIONS ON THE FORM OF THIRD ELEMENT FROM DIOPHANTINE PAIRS AND ITS APPLICATION

  • Lee, June Bok;Park, Jinseo
    • 대한수학회지
    • /
    • 제55권2호
    • /
    • pp.425-445
    • /
    • 2018
  • A set {$a_1,\;a_2,{\ldots},\;a_m$} of positive integers is called a Diophantine m-tuple if $a_ia_j+1$ is a perfect square for all $1{\leq}i$ < $j{\leq}m$. In this paper, we show that the form of third element in Diophantine pairs and develop some results which are needed to prove the extendibility of the Diophantine pair {a, b} with some conditions. By using this result, we prove the extendibility of Diophantine pairs {$F_{k-2}F_{k+1},\;F_{k-1}F_{k+2}$} and {$F_{k-2}F_{k-1},\;F_{k+1}F_{k+2}$}, where $F_n$ is the n-th Fibonacci number.