Related papers: Only finitely many Tribonacci Diophantine triples …

Nobody has discovered any perfect cuboid and there is no formula to deliver all possible Euler bricks. During investigations of famous open problems regarding the perfect cuboid and Euler brick; I have found new important conjectures on…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

The relevance of this paper lies in the fact that it resolves two previously unsolved open problems. In the first part of the paper, a new lemma is proved, from which it follows that if there exists a triangle with integer sides and…

A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…

Let $\alpha$ and $\beta$ be real numbers such that $1$, $\alpha$ and $\beta$ are linearly independent over $\mathbb{Q}$. A classical result of Dirichlet asserts that there are infinitely many triples of integers $(x_0,x_1,x_2)$ such that…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

We prove that for every irrational number $\alpha$, real number $\beta$, real number $c$ satisfying $1<c<9/8$ and positive real number $\theta$ satisfying $\theta<(9/c-8)/10$, there exist infinitely many primes of the form…

We give an infinite number of integer solutions to the Diophantine equation x^5 - (x+1)^5 -(x+2)^5 +(x+3)^5 = 5^m + 5^n, and some solutions to some similar equations.

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

In this paper, we prove that there are no $k$-th power Diophantine triples of the form $\{a^k,b,c\}$ for $k\geq 3$ and $1<a^k<b<c$.

We disprove a 2002 conjecture of Dombi from additive number theory. More precisely, we find examples of sets $A \subset \mathbb{N}$ with the property that $\mathbb{N} \setminus A$ is infinite, but the sequence $n \rightarrow |\{ (a,b,c) \,…

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…

We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.

Fix an irrational number $\theta$. For a real number $\tau >0$, consider the numbers $y$ satisfying that for all large number $Q$, there exists an integer $1\leq n\leq Q$, such that $\|n\theta-y\|<Q^{-\tau}$, where $\|\cdot\|$ is the…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…

A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

An integer of the form $T_x=\frac{x(x+1)}2$ for some positive integer $x$ is called a triangular number. A ternary triangular form $aT_{x}+bT_{y}+cT_{z}$ for positive integers $a,b$ and $c$ is called regular if it represents every positive…