Displaying similar documents to “Around the Littlewood conjecture in Diophantine approximation”

A note on the weighted Khintchine-Groshev Theorem

Mumtaz Hussain, Tatiana Yusupova (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let W ( m , n ; ψ ̲ ) denote the set of ψ 1 , ... , ψ n –approximable points in m n . The classical Khintchine–Groshev theorem assumes a monotonicity condition on the approximating functions ψ ̲ . Removing monotonicity from the Khintchine–Groshev theorem is attributed to different authors for different cases of m and n . It can not be removed for m = n = 1 as Duffin–Schaeffer provided the counter example. We deal with the only remaining case m = 2 and thereby remove all unnecessary conditions from the Khintchine–Groshev theorem. ...

On the Diophantine equation j = 1 k j F j p = F n q

Gökhan Soydan, László Németh, László Szalay (2018)

Archivum Mathematicum

Similarity:

Let F n denote the n t h term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation F 1 p + 2 F 2 p + + k F k p = F n q in the positive integers k and n , where p and q are given positive integers. A complete solution is given if the exponents are included in the set { 1 , 2 } . Based on the specific cases we could solve, and a computer search with p , q , k 100 we conjecture that beside the trivial solutions only F 8 = F 1 + 2 F 2 + 3 F 3 + 4 F 4 , F 4 2 = F 1 + 2 F 2 + 3 F 3 , and F 4 3 = F 1 3 + 2 F 2 3 + 3 F 3 3 satisfy the title equation.

The exceptional set for Diophantine inequality with unlike powers of prime variables

Wenxu Ge, Feng Zhao (2018)

Czechoslovak Mathematical Journal

Similarity:

Suppose that λ 1 , λ 2 , λ 3 , λ 4 are nonzero real numbers, not all negative, δ > 0 , 𝒱 is a well-spaced set, and the ratio λ 1 / λ 2 is algebraic and irrational. Denote by E ( 𝒱 , N , δ ) the number of v 𝒱 with v N such that the inequality | λ 1 p 1 2 + λ 2 p 2 3 + λ 3 p 3 4 + λ 4 p 4 5 - v | < v - δ has no solution in primes p 1 , p 2 , p 3 , p 4 . We show that E ( 𝒱 , N , δ ) N 1 + 2 δ - 1 / 72 + ε for any ε > 0 .

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.

Approximation properties of β-expansions

Simon Baker (2015)

Acta Arithmetica

Similarity:

Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence ( ϵ i ) i = 1 0 , 1 a β-expansion for x if x = i = 1 ϵ i β - i . We call a finite sequence ( ϵ i ) i = 1 n 0 , 1 n an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given Ψ : 0 , we introduce the following subset of ℝ: W β ( Ψ ) : = m = 1 n = m ( ϵ i ) i = 1 n 0 , 1 n [ i = 1 n ( ϵ i ) / ( β i ) , i = 1 n ( ϵ i ) / ( β i ) + Ψ ( n ) ] In other words, W β ( Ψ ) is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities 0 x - i = 1 n ( ϵ i ) / ( β i ) Ψ ( n ) . When n = 1 2 n Ψ ( n ) < , the Borel-Cantelli lemma tells us that the Lebesgue measure...

Mersenne numbers as a difference of two Lucas numbers

Murat Alan (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let ( L n ) n 0 be the Lucas sequence. We show that the Diophantine equation L n - L m = M k has only the nonnegative integer solutions ( n , m , k ) = ( 2 , 0 , 1 ) , ( 3 , 1 , 2 ) , ( 3 , 2 , 1 ) , ( 4 , 3 , 2 ) , ( 5 , 3 , 3 ) , ( 6 , 2 , 4 ) , ( 6 , 5 , 3 ) where M k = 2 k - 1 is the k th Mersenne number and n > m .

On a conjecture of Dekking : The sum of digits of even numbers

Iurie Boreico, Daniel El-Baz, Thomas Stoll (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let q 2 and denote by s q the sum-of-digits function in base q . For j = 0 , 1 , , q - 1 consider # { 0 n &lt; N : s q ( 2 n ) j ( mod q ) } . In 1983, F. M. Dekking conjectured that this quantity is greater than N / q and, respectively, less than N / q for infinitely many N , thereby claiming an absence of a drift (or Newman) phenomenon. In this paper we prove his conjecture.

On the Diophantine equation ( 2 x - 1 ) ( p y - 1 ) = 2 z 2

Ruizhou Tong (2021)

Czechoslovak Mathematical Journal

Similarity:

Let p be an odd prime. By using the elementary methods we prove that: (1) if 2 x , p ± 3 ( mod 8 ) , the Diophantine equation ( 2 x - 1 ) ( p y - 1 ) = 2 z 2 has no positive integer solution except when p = 3 or p is of the form p = 2 a 0 2 + 1 , where a 0 > 1 is an odd positive integer. (2) if 2 x , 2 y , y 2 , 4 , then the Diophantine equation ( 2 x - 1 ) ( p y - 1 ) = 2 z 2 has no positive integer solution.

Complete solution of the Diophantine equation x y + y x = z z

Mihai Cipu (2019)

Czechoslovak Mathematical Journal

Similarity:

The triples ( x , y , z ) = ( 1 , z z - 1 , z ) , ( x , y , z ) = ( z z - 1 , 1 , z ) , where z , satisfy the equation x y + y x = z z . In this paper it is shown that the same equation has no integer solution with min { x , y , z } > 1 , thus a conjecture put forward by Z. Zhang, J. Luo, P. Z. Yuan (2013) is confirmed.

Padovan and Perrin numbers as products of two generalized Lucas numbers

Kouèssi Norbert Adédji, Japhet Odjoumani, Alain Togbé (2023)

Archivum Mathematicum

Similarity:

Let P m and E m be the m -th Padovan and Perrin numbers respectively. Let r , s be non-zero integers with r 1 and s { - 1 , 1 } , let { U n } n 0 be the generalized Lucas sequence given by U n + 2 = r U n + 1 + s U n , with U 0 = 0 and U 1 = 1 . In this paper, we give effective bounds for the solutions of the following Diophantine equations P m = U n U k and E m = U n U k , where m , n and k are non-negative integers. Then, we explicitly solve the above Diophantine equations for the Fibonacci, Pell and balancing sequences.

A Diophantine inequality with four squares and one k th power of primes

Quanwu Mu, Minhui Zhu, Ping Li (2019)

Czechoslovak Mathematical Journal

Similarity:

Let k 5 be an odd integer and η be any given real number. We prove that if λ 1 , λ 2 , λ 3 , λ 4 , μ are nonzero real numbers, not all of the same sign, and λ 1 / λ 2 is irrational, then for any real number σ with 0 < σ < 1 / ( 8 ϑ ( k ) ) , the inequality | λ 1 p 1 2 + λ 2 p 2 2 + λ 3 p 3 2 + λ 4 p 4 2 + μ p 5 k + η | < max 1 j 5 p j - σ has infinitely many solutions in prime variables p 1 , p 2 , , p 5 , where ϑ ( k ) = 3 × 2 ( k - 5 ) / 2 for k = 5 , 7 , 9 and ϑ ( k ) = [ ( k 2 + 2 k + 5 ) / 8 ] for odd integer k with k 11 . This improves a recent result in W. Ge, T. Wang (2018).

Bartz-Marlewski equation with generalized Lucas components

Hayder R. Hashim (2022)

Archivum Mathematicum

Similarity:

Let { U n } = { U n ( P , Q ) } and { V n } = { V n ( P , Q ) } be the Lucas sequences of the first and second kind respectively at the parameters P 1 and Q { - 1 , 1 } . In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation x 2 - 3 x y + y 2 + x = 0 , where ( x , y ) = ( U i , U j ) or ( V i , V j ) with i , j 1 . Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

The number of solutions to the generalized Pillai equation ± r a x ± s b y = c .

Reese Scott, Robert Styer (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We consider N , the number of solutions ( x , y , u , v ) to the equation ( - 1 ) u r a x + ( - 1 ) v s b y = c in nonnegative integers x , y and integers u , v { 0 , 1 } , for given integers a &gt; 1 , b &gt; 1 , c &gt; 0 , r &gt; 0 and s &gt; 0 . When gcd ( r a , s b ) = 1 , we show that N 3 except for a finite number of cases all of which satisfy max ( a , b , r , s , x , y ) &lt; 2 · 10 15 for each solution; when gcd ( a , b ) &gt; 1 , we show that N 3 except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving N = 3 solutions.

Thompson’s conjecture for the alternating group of degree 2 p and 2 p + 1

Azam Babai, Ali Mahmoudifar (2017)

Czechoslovak Mathematical Journal

Similarity:

For a finite group G denote by N ( G ) the set of conjugacy class sizes of G . In 1980s, J. G. Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N ( G ) = N ( L ) , then G L . We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z ( G ) = 1 and N ( G ) = N ( A i ) is necessarily isomorphic to A i , where i { 2 p , 2 p + 1 } .

An approximation property of quadratic irrationals

Takao Komatsu (2002)

Bulletin de la Société Mathématique de France

Similarity:

Let α &gt; 1 be irrational. Several authors studied the numbers m ( α ) = inf { | y | : y Λ m , y 0 } , where m is a positive integer and Λ m denotes the set of all real numbers of the form y = ϵ 0 α n + ϵ 1 α n - 1 + + ϵ n - 1 α + ϵ n with restricted integer coefficients | ϵ i | m . The value of 1 ( α ) was determined for many particular Pisot numbers and m ( α ) for the golden number. In this paper the value of  m ( α ) is determined for irrational numbers  α , satisfying α 2 = a α ± 1 with a positive integer a .