中文
相关论文

相关论文: Lucas sequences whose 12th or 9th term is a square

200 篇论文

A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…

组合数学 · 数学 2007-05-23 Karola Meszaros

The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $\Gamma\_n$ isomorphic to $Q\_k$, and…

组合数学 · 数学 2015-04-06 Sylvain Gravier , Michel Mollard , Simon Spacapan , Sara Zemljic

Let $\{P_n\}_{n\ge 0}$ and $\{R_n\}_{n\ge 0}$ denote the Padovan and Perrin sequences, both satisfying the recurrence $U_{n+3} = U_{n+1} + U_n$, but with initial values $P_0 = P_1 = P_2 = 1$ and $R_0 = 3$, $R_1 = 0$, $R_2 = 2$,…

数论 · 数学 2026-05-25 Herbert Batte , Eric F. Bravo , Florian Luca

This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…

数论 · 数学 2023-12-06 Ahmet Daşdemir , Ahmet Emin

In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…

数论 · 数学 2022-06-22 Elchin Hasanalizade

Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partially filled $9 \times 9$ square with numbers 1 through 9,…

组合数学 · 数学 2017-04-27 Mohammad Mahdian , Ebadollah S. Mahmoodian

Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, respectively. Four corresponding zeta functions in $s$ are defined by \[\zeta_F(s) \,:=\, \sum_{n=1}^{\infty} \frac{1}{F_n^s}\,,\quad \zeta_F^*(s) \,:=\,\sum_{n=1}^{\infty}…

数论 · 数学 2018-05-09 Carsten Elsner , Niclas Technau

In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…

数论 · 数学 2016-01-19 Nazmiye Yilmaz , Yasin Yazlik , Necati Taskara

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

组合数学 · 数学 2007-05-23 H. A. Verrill

A frequency $n$-cube $F^n(4;2,2)$ is an $n$-dimensional $4$-by-...-by-$4$ array filled by $0$s and $1$s such that each line contains exactly two $1$s. We classify the frequency $4$-cubes $F^4(4;2,2)$, find a testing set of size $25$ for…

组合数学 · 数学 2023-02-21 Minjia Shi , Shukai Wang , Xiaoxiao Li , Denis S. Krotov

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

数论 · 数学 2014-07-18 Vladimir Pletser

In this study, we introduce a new classes of quaternion numbers. We show that this new classes quaternion numbers include all of quaternion numbers such as Fibonacci, Lucas, Pell, Jacobsthal, Pell-Lucas, Jacobsthal-Lucas quaternions have…

环与代数 · 数学 2016-11-24 Serpil Halıcı

In this work, by using Pauli matrices, we introduce four families of polynomials indexed over the positive integers. These polynomials have rational or imaginary rational coefficients. It turns out that two of these families are closely…

代数几何 · 数学 2016-08-22 Ayberk Zeytin

Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to…

数论 · 数学 2010-08-10 C. L. Stewart

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

This article gives an alternative proof of the fact that N_{Q(zeta)/Q}(1-zeta)=p where p is an odd prime number and zeta is a primitive p-th root of unity, and uses it to prove that N_{Q(zeta)/Q}(1+zeta-zeta^2)=L(p) the p-th Lucas number.…

数论 · 数学 2012-02-20 Alexandre Aksenov

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

数论 · 数学 2012-04-18 Ruslan Sharipov

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

历史与综述 · 数学 2018-11-07 Bernhard Moser

The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the…

离散数学 · 计算机科学 2015-09-14 Pietro Codara , Ottavio M. D'Antona

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…