PERFECT POWERS THAT ARE SUMS OF TWO POWERS OF FIBONACCI NUMBERS

2018 ◽  
Vol 99 (1) ◽  
pp. 34-41
Author(s):  
ZHONGFENG ZHANG ◽  
ALAIN TOGBÉ
Keyword(s):  
Diophantine Equations ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Image Position ◽  
Positive Integers ◽  
Complete Solutions

In this paper, we consider the Diophantine equations $$\begin{eqnarray}\displaystyle F_{n}^{q}\pm F_{m}^{q}=y^{p} & & \displaystyle \nonumber\end{eqnarray}$$ with positive integers $q,p\geq 2$ and $\gcd (F_{n},F_{m})=1$, where $F_{k}$ is a Fibonacci number. We obtain results for $q=2$ or $q$ an odd prime with $q\equiv 3\;(\text{mod}\;4),3<q<1087$, and complete solutions for $q=3$.

The Diophantine equation Fn = P(x)

2020 ◽  
Vol 16 (09) ◽  
pp. 2095-2111
Author(s):  
Szabolcs Tengely ◽  
Maciej Ulas
Keyword(s):  
Diophantine Equation ◽  
Diophantine Equations ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Infinitely Many Solutions ◽  
Polynomial Formula ◽  
Positive Integers ◽  
Integral Solutions

We consider equations of the form [Formula: see text], where [Formula: see text] is a polynomial with integral coefficients and [Formula: see text] is the [Formula: see text]th Fibonacci number that is, [Formula: see text] and [Formula: see text] for [Formula: see text] In particular, for each [Formula: see text], we prove the existence of a polynomial [Formula: see text] of degree [Formula: see text] such that the Diophantine equation [Formula: see text] has infinitely many solutions in positive integers [Formula: see text]. Moreover, we present results of our numerical search concerning the existence of even degree polynomials representing many Fibonacci numbers. We also determine all integral solutions [Formula: see text] of the Diophantine equations [Formula: see text] for [Formula: see text] and [Formula: see text].

scholarly journals Some Diophantine Problems Related to k-Fibonacci Numbers

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1047
Author(s):  
Pavel Trojovský ◽  
Štěpán Hubálovský
Keyword(s):  
Recurrence Relation ◽  
Diophantine Equations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Recursive Relation ◽  
Initial Values ◽  
Lucas Sequence ◽  
Diophantine Problems ◽  
Positive Integers

Let k ≥ 1 be an integer and denote ( F k , n ) n as the k-Fibonacci sequence whose terms satisfy the recurrence relation F k , n = k F k , n − 1 + F k , n − 2 , with initial conditions F k , 0 = 0 and F k , 1 = 1 . In the same way, the k-Lucas sequence ( L k , n ) n is defined by satisfying the same recursive relation with initial values L k , 0 = 2 and L k , 1 = k . The sequences ( F k , n ) n ≥ 0 and ( L k , n ) n ≥ 0 were introduced by Falcon and Plaza, who derived many of their properties. In particular, they proved that F k , n 2 + F k , n + 1 2 = F k , 2 n + 1 and F k , n + 1 2 − F k , n − 1 2 = k F k , 2 n , for all k ≥ 1 and n ≥ 0 . In this paper, we shall prove that if k > 1 and F k , n s + F k , n + 1 s ∈ ( F k , m ) m ≥ 1 for infinitely many positive integers n, then s = 2 . Similarly, that if F k , n + 1 s − F k , n − 1 s ∈ ( k F k , m ) m ≥ 1 holds for infinitely many positive integers n, then s = 1 or s = 2 . This generalizes a Marques and Togbé result related to the case k = 1 . Furthermore, we shall solve the Diophantine equations F k , n = L k , m , F k , n = F n , k and L k , n = L n , k .

scholarly journals On Diophantine Equations Related to Order of Appearance in Fibonacci Sequence

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1073 ◽  
Author(s):  
Pavel Trojovský
Keyword(s):  
Natural Number ◽  
Diophantine Equations ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Prime Numbers ◽  
All Solutions ◽  
Adic Valuation

Let F n be the nth Fibonacci number. Order of appearance z ( n ) of a natural number n is defined as smallest natural number k, such that n divides F k . In 1930, Lehmer proved that all solutions of equation z ( n ) = n ± 1 are prime numbers. In this paper, we solve equation z ( n ) = n + ℓ for | ℓ | ∈ { 1 , … , 9 } . Our method is based on the p-adic valuation of Fibonacci numbers.

Complete solutions of the simultaneous Pell’s equations x2 − (a2 − 1)y2 = 1 and y2 − pz2 = 1

2019 ◽  
Vol 15 (05) ◽  
pp. 1069-1074 ◽  
Author(s):  
Hai Yang ◽  
Ruiqin Fu
Keyword(s):  
Positive Integer ◽  
Diophantine Equations ◽  
Integer Solution ◽  
System Of Equations ◽  
Positive Integer Solution ◽  
Elementary Methods ◽  
Integer Solutions ◽  
Positive Integers ◽  
Complete Solutions

Let [Formula: see text] be a positive integer with [Formula: see text], and let [Formula: see text] be an odd prime. In this paper, by using certain properties of Pell’s equations and quartic diophantine equations with some elementary methods, we prove that the system of equations [Formula: see text] [Formula: see text] and [Formula: see text] has positive integer solutions [Formula: see text] if and only if [Formula: see text] and [Formula: see text] satisfy [Formula: see text] and [Formula: see text], where [Formula: see text], [Formula: see text] and [Formula: see text] are positive integers. Further, if the above condition is satisfied, then [Formula: see text] has only the positive integer solution [Formula: see text]. By the above result, we can obtain the following corollaries immediately. (i) If [Formula: see text] or [Formula: see text], then [Formula: see text] has no positive integer solutions [Formula: see text]. (ii) For [Formula: see text], [Formula: see text] has only the positive integer solutions [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].

Universal diophantine equation

1982 ◽  
Vol 47 (3) ◽  
pp. 549-571 ◽  
Author(s):  
James P. Jones
Keyword(s):  
Diophantine Equation ◽  
Diophantine Equations ◽  
Recursively Enumerable Set ◽  
Integer Coefficients ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets ◽  
Image Position ◽  
Positive Integers ◽  
Martin Davis ◽  
Exponential Relation

In 1961 Martin Davis, Hilary Putnam and Julia Robinson [2] proved that every recursively enumerable set W is exponential diophantine, i.e. can be represented in the formHere P is a polynomial with integer coefficients and the variables range over positive integers.In 1970 Ju. V. Matijasevič used this result to establish the unsolvability of Hilbert's tenth problem. Matijasevič proved [11] that the exponential relation y = 2x is diophantine This together with [2] implies that every recursively enumerable set is diophantine, i.e. every r.e. set Wcan be represented in the formFrom this it follows that there does not exist an algorithm to decide solvability of diophantine equations. The nonexistence of such an algorithm follows immediately from the existence of r.e. nonrecursive sets.Now it is well known that the recursively enumerable sets W1, W2, W3, … can be enumerated in such a way that the binary relation x ∈ Wv is also recursively enumerable. Thus Matijasevič's theorem implies the existence of a diophantine equation U such that for all x and v,

scholarly journals The Divisibility of Divisor Functions

1961 ◽  
Vol 5 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Positive Integer ◽  
Divisor Functions ◽  
Image Position ◽  
Positive Integers

For any positive integers n and v letwhere d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

scholarly journals On Fibonacci Numbers of Order r Which Are Expressible as Sum of Consecutive Factorial Numbers

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 962
Author(s):  
Eva Trojovská  ◽  
Pavel Trojovský
Keyword(s):  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Initial Values

Let (tn(r))n≥0 be the sequence of the generalized Fibonacci number of order r, which is defined by the recurrence tn(r)=tn−1(r)+⋯+tn−r(r) for n≥r, with initial values t0(r)=0 and ti(r)=1, for all 1≤i≤r. In 2002, Grossman and Luca searched for terms of the sequence (tn(2))n, which are expressible as a sum of factorials. In this paper, we continue this program by proving that, for any ℓ≥1, there exists an effectively computable constant C=C(ℓ)>0 (only depending on ℓ), such that, if (m,n,r) is a solution of tm(r)=n!+(n+1)!+⋯+(n+ℓ)!, with r even, then max{m,n,r}<C. As an application, we solve the previous equation for all 1≤ℓ≤5.

scholarly journals Monochromatic solutions to equations with unit fractions

1991 ◽  
Vol 43 (3) ◽  
pp. 387-392 ◽  
Author(s):  
Tom C. Brown ◽  
Voijtech Rödl
Keyword(s):  
Solutions To Equations ◽  
Unit Fractions ◽  
Image Position ◽  
Positive Integers

Our main result is that if G(x1, …, xn) = 0 is a system of homogeneous equations such that for every partition of the positive integers into finitely many classes there are distinct y1,…, yn in one class such that G(y1, …, yn) = 0, then, for every partition of the positive integers into finitely many classes there are distinct Z1, …, Zn in one class such thatIn particular, we show that if the positive integers are split into r classes, then for every n ≥ 2 there are distinct positive integers x1, x1, …, xn in one class such thatWe also show that if [1, n6 − (n2 − n)2] is partitioned into two classes, then some class contains x0, x1, …, xn such that(Here, x0, x2, …, xn are not necessarily distinct.)

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

Sign in / Sign up

Export Citation Format

Share Document