English
Related papers

Related papers: An effective bound on Generalized Diophantine m-tu…

200 papers

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

Number Theory · Mathematics 2025-06-05 Sebastian Heintze , Volker Ziegler

We prove that the Diophantine equation N X^2 + 2^L 3^M = Y^N has no solutions (N,X,Y,L,M) in positive integers with N > 1 and gcd(NX,Y) = 1, generalizing results of Luca, Wang and Wang, and Luca and Soydan. Our proofs use results of Bilu,…

Number Theory · Mathematics 2014-04-18 Eva G. Goedhart , Helen G. Grundman

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

Number Theory · Mathematics 2023-01-31 Luke Pebody

We prove two generalizations of Furstenberg's Diophantine result regarding density of an orbit of an irrational point in the one-torus under the action of multiplication by a non-lacunary multiplicative semi-group of $\mathbb{N}$. We show…

Dynamical Systems · Mathematics 2016-09-28 Asaf Katz

Intrinsic Diophantine approximation on fractals, such as the Cantor ternary set, was undoubtedly motivated by questions asked by K. Mahler (1984). One of the main goals of this paper is to develop and utilize the theory of infinite de…

Combinatorics · Mathematics 2016-10-18 Lior Fishman , Keith Merrill , David Simmons

In this note we consider the title Diophantine equation from both theoretical as well as experimental point of view. In particular, we prove that for $k=4, 6$ and each choice of the signs our equation has infinitely many co-prime positive…

Number Theory · Mathematics 2025-08-26 Maciej Ulas

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

Number Theory · Mathematics 2011-06-15 Aran Nayebi

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $\nu(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $\nu(p)$…

Number Theory · Mathematics 2019-02-20 Manfred G. Madritsch , Robert F. Tichy

In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…

Number Theory · Mathematics 2026-03-30 Leo Hong , Dmitry Kleinbock , Vasiliy Neckrasov

In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \geq 1$ and $k \geq 3$. Here, $\{ F_t \}_{t=0}^{\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation…

Number Theory · Mathematics 2024-12-18 Seyran S. Ibrahimov , Nazim I. Mahmudov

Let E_n={x_k=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For any integer n \geq 2214, we define a system T \subseteq E_n which has a unique integer solution (a_1,...,a_n). We prove that the numbers a_1,...,a_n are positive and…

Number Theory · Mathematics 2015-10-05 Apoloniusz Tyszka

We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.

Number Theory · Mathematics 2018-03-08 Jose Arnaldo B. Dris

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

Number Theory · Mathematics 2017-09-05 Andrej Dujella , Matija Kazalicki

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

Number Theory · Mathematics 2018-04-18 Daniele Mastrostefano

For integers $n, m$ with $n \geq 1$ and $0 \leq m \leq n$, an $(n,m)$-Dyck path is a lattice path in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ using up steps $(0,1)$ and down steps $(1,0)$ that goes from the origin $(0,0)$ to the…

Combinatorics · Mathematics 2018-01-30 Rosena R. X. Du , Kuo Yu

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…

Number Theory · Mathematics 2025-03-20 Zhong-Peng Zhou

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

Number Theory · Mathematics 2025-03-25 Marco Aymone , Ana Paula Chaves , Maria Eduarda Ramos

A number alpha in R is diophantine if it is not well approximable by rationals, i.e. for some C, nu>0 and any relatively prime p, q in Z we have |alpha q -p|>C q^{-1-\vu}. It is well-known and easy to prove that almost every alpha in R is…

Number Theory · Mathematics 2007-05-23 Vadim Kaloshin , I. Rodnianski

We are studying the Diophantine exponent \mu_{n,l}$ defined for integers 1 \leq l < n and a vector \alpha \in \mathbb{R}^n by letting \mu_{n,l} = \sup{\mu \geq 0: 0 < ||x \cdot \alpha|| < H(x)^{-\mu} for infinitely many x \in C_{n,l} \cap…

Number Theory · Mathematics 2009-11-13 Yann Bugeaud , Simon Kristensen