English
Related papers

Related papers: Shifted powers in Lucas-Lehmer sequences

200 papers

We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…

Number Theory · Mathematics 2017-08-17 Natalia Garcia-Fritz

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

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}…

Number Theory · Mathematics 2018-05-09 Carsten Elsner , Niclas Technau

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

Number Theory · Mathematics 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

Dynamical Systems · Mathematics 2014-02-26 Nikos Frantzikinakis , Emmanuel Lesigne , Mate Wierdl

A $4^-$-power is a non-empty word of the form $XXXX^-$, where $X^-$ is obtained from $X$ by erasing the last letter. A binary word is called {\em faux-bonacci} if it contains no $4^-$-powers, and no factor 11. We show that faux-bonacci…

Combinatorics · Mathematics 2023-11-23 James D. Currie , Narad Rampersad

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

Combinatorics · Mathematics 2021-05-21 Kunle Adegoke

Let $m$ be a positive integer and $q$ be a prime power. For large finite base fields $\mathbb F_q$, we show that any curve can be used to produce a complete $m$-arc as long as some generic explicit geometric conditions on the curve are…

Combinatorics · Mathematics 2023-03-27 Luca Bastioni , Giacomo Micheli

The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…

Probability · Mathematics 2016-11-11 Arulalan Rajan , R. Vittal Rao , Ashok Rao , H. S. Jamadagni

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $B_k$ denote the $k^{th}$ term of balancing sequence. In this paper we find all positive integer solutions of the Diophantine equation $B_n+B_m = x^q$ in variables $(m, n,x,q)$ under the assumption $n\equiv m \pmod 2$. Furthermore, we…

Number Theory · Mathematics 2023-08-21 Pritam Kumar Bhoi , Sudhansu Sekhar Rout , Gopal Krishna Panda

We consider finite deformations of the Hull--Strominger system. Starting from the heterotic superpotential, we identify complex coordinates on the off-shell parameter space. Expanding the superpotential around a supersymmetric vacuum leads…

High Energy Physics - Theory · Physics 2022-02-04 Anthony Ashmore , Xenia de la Ossa , Ruben Minasian , Charles Strickland-Constable , Eirik Eik Svanes

Let (F_n)_{n} be the classical Fibonacci sequence. It is well-known that it satisfies F_{n}^2 + F_{n+1}^2 = F_{2n+1}. In this study, we explore generalizations of this Diophantine equation in several directions. First, we solve the…

Number Theory · Mathematics 2025-01-16 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized…

Combinatorics · Mathematics 2018-01-08 Sümeyra Uçar , Nihal Yilmaz Özgür

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

We obtain exact solution of the Dirac equation with the Coulomb potential as an infinite series of square integrable functions. This solution is for all energies, the discrete as well as the continuous. The spinor basis elements are written…

High Energy Physics - Theory · Physics 2011-07-28 A. D. Alhaidari

We prove that a non-degenerate simple linear recurrence sequence $ (G_n(x))_{n=0}^{\infty} $ of polynomials satisfying some further conditions cannot contain arbitrary large powers of polynomials if the order of the sequence is at least…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…

Number Theory · Mathematics 2023-03-24 José L. Cereceda

Let $E$ be an elliptic curve over the rationals given by an integral Weierstrass model and let $P$ be a rational point of infinite order. The multiple $nP$ has the form $(A_n/B_n^2,C_n/B_n^3)$ where $A_n$, $B_n$, $C_n$ are integers with…

Number Theory · Mathematics 2023-12-15 Maryam Nowroozi , Samir Siksek

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

History and Overview · Mathematics 2008-05-20 Adilson J. V. Brandao , Joao L. Martins
‹ Prev 1 3 4 5 6 7 10 Next ›