相关论文: Finiteness results for Diophantine triples with re…

Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1^c+p_2^c+p_3^c-R|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$…

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.

In this paper we find a parametric solution to the hitherto unsolved problem of finding three positive integers such that their sum, the sum of their squares and the sum of their cubes are simultaneously perfect squares.

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

Let $\bar{X}_{n}=(x_{1},\ldots,x_{n})$ and $\sigma_{i}(\bar{X}_{n})=\sum x_{k_{1}}\ldots x_{k_{i}}$ be $i$-th elementary symmetric polynomial. In this note we prove that there are infinitely many triples of integers $a, b, c$ such that for…

The aim of this paper is to consider the extensibility of the Diophantine triple $\{2,b,c\}$, where $2<b<c$, and to prove that such a set cannot be extended to an irregular Diophantine quadruple. We succeed in that for some families of…

In this paper, we define a $k$-Diophantine $m$-tuple to be a set of $m$ positive integers such that the product of any $k$ distinct positive integers is one less than a perfect square. We study these sets in finite fields $\mathbb{F}_p$ for…

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

Let $1<c<\frac{26088036}{12301745},c\not=2$ and $N$ be a sufficiently large real number. In this paper, it is proved that, for almost all $R\in (N,2N]$, the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N…

For fixed integers $D \geq 0$ and $c \geq 3$, we demonstrate how to use $2$-adic valuation trees of sequences to analyze Diophantine equations of the form $x^2+D=2^cy$ and $x^3+D=2^cy$, for $y$ odd. Further, we show for what values $D \in…

We investigate Diophantine definability and decidability over some subrings of algebraic numbers contained in quadratic extensions of totally real algebraic extensions of $\mathbb Q$. Among other results we prove the following. The big…

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

In this paper, we show that there are only finitely many Narayana's numbers which can be written as product of three repdigits in base $g$ with $g \geq 2$. Moreover, for $2 \leq g \leq 10$, we determine all these numbers.

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 $G$ be a finite group and $d$ the degree of a complex irreducible character of $G$, then write $|G|=d(d+e)$ where $e$ is a nonnegative integer. We prove that $|G|\leq e^4-e^3$ whenever $e>1$. This bound is best possible and improves on…