Displaying similar documents to “Multiplicative relations on binary recurrences”

Diophantine triples with values in binary recurrences

Clemens Fuchs, Florian Luca, Laszlo Szalay (2008)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper, we study triples a , b and c of distinct positive integers such that a b + 1 , a c + 1 and b c + 1 are all three members of the same binary recurrence sequence.

On the Lebesgue-Nagell equation

Andrzej Dąbrowski (2011)

Colloquium Mathematicae

Similarity:

We completely solve the Diophantine equations x ² + 2 a q b = y (for q = 17, 29, 41). We also determine all C = p a p k a k and C = 2 a p a p k a k , where p , . . . , p k are fixed primes satisfying certain conditions. The corresponding Diophantine equations x² + C = yⁿ may be studied by the method used by Abu Muriefah et al. (2008) and Luca and Togbé (2009).

Finiteness results for Diophantine triples with repdigit values

Attila Bérczes, Florian Luca, István Pink, Volker Ziegler (2016)

Acta Arithmetica

Similarity:

Let g ≥ 2 be an integer and g be the set of repdigits in base g. Let g be the set of Diophantine triples with values in g ; that is, g is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set g . We prove effective finiteness results for the set g .

On systems of diophantine equations with a large number of solutions

Jerzy Browkin (2010)

Colloquium Mathematicae

Similarity:

We consider systems of equations of the form x i + x j = x k and x i · x j = x k , which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.

Diophantine equations involving factorials

Horst Alzer, Florian Luca (2017)

Mathematica Bohemica

Similarity:

We study the Diophantine equations ( k ! ) n - k n = ( n ! ) k - n k and ( k ! ) n + k n = ( n ! ) k + n k , where k and n are positive integers. We show that the first one holds if and only if k = n or ( k , n ) = ( 1 , 2 ) , ( 2 , 1 ) and that the second one holds if and only if k = n .

Further remarks on Diophantine quintuples

Mihai Cipu (2015)

Acta Arithmetica

Similarity:

A set of m positive integers with the property that the product of any two of them is the predecessor of a perfect square is called a Diophantine m-tuple. Much work has been done attempting to prove that there exist no Diophantine quintuples. In this paper we give stringent conditions that should be met by a putative Diophantine quintuple. Among others, we show that any Diophantine quintuple a,b,c,d,e with a < b < c < d < e s a t i s f i e s d < 1.55·1072 a n d b < 6.21·1035 w h e n 4 a < b , w h i l e f o r b < 4 a o n e h a s e i t h e r c = a + b + 2√(ab+1)...

On the diophantine equation x y - y x = c z

Zhongfeng Zhang, Jiagui Luo, Pingzhi Yuan (2012)

Colloquium Mathematicae

Similarity:

Applying results on linear forms in p-adic logarithms, we prove that if (x,y,z) is a positive integer solution to the equation x y - y x = c z with gcd(x,y) = 1 then (x,y,z) = (2,1,k), (3,2,k), k ≥ 1 if c = 1, and either ( x , y , z ) = ( c k + 1 , 1 , k ) , k ≥ 1 or 2 x < y m a x 1 . 5 × 10 10 , c if c ≥ 2.

On X 1 4 + 4 X 2 4 = X 3 8 + 4 X 4 8 and Y 1 4 = Y 2 4 + Y 3 4 + 4 Y 4 4

Susil Kumar Jena (2015)

Communications in Mathematics

Similarity:

The two related Diophantine equations: X 1 4 + 4 X 2 4 = X 3 8 + 4 X 4 8 and Y 1 4 = Y 2 4 + Y 3 4 + 4 Y 4 4 , have infinitely many nontrivial, primitive integral solutions. We give two parametric solutions, one for each of these equations.

A note on the article by F. Luca “On the system of Diophantine equations a ² + b ² = ( m ² + 1 ) r and a x + b y = ( m ² + 1 ) z ” (Acta Arith. 153 (2012), 373-392)

Takafumi Miyazaki (2014)

Acta Arithmetica

Similarity:

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying A + B ( - 1 ) = ( m + ( - 1 ) ) r . We prove that the Diophantine equation | A | x + | B | y = ( m ² + 1 ) z has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever r > 10 74 or m > 10 34 . Our result is an explicit refinement of a theorem due to F. Luca.

Inhomogeneous Diophantine approximation with general error functions

Lingmin Liao, Michał Rams (2013)

Acta Arithmetica

Similarity:

Let α be an irrational and φ: ℕ → ℝ⁺ be a function decreasing to zero. Let ω ( α ) : = s u p θ 1 : l i m i n f n n θ | | n α | = 0 . F o r a n y α w i t h a g i v e n ω ( α ) , w e g i v e s o m e s h a r p e s t i m a t e s f o r t h e H a u s d o r f f d i m e n s i o n o f t h e s e t E φ ( α ) := y ∈ ℝ: ||nα -y|| < φ(n) for infinitely many n, where ||·|| denotes the distance to the nearest integer.

The Diophantine Equation X³ = u+v over Real Quadratic Fields

Takaaki Kagawa (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let k be a real quadratic field and let k and k × be the ring of integers and the group of units, respectively. A method of solving the Diophantine equation X³ = u+v ( X k , u , v k × ) is developed.