Related papers: Six equations in search of a finite-fold-ness proo…

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

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 connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…

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 formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…

Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…

This paper gives parametric solutions to quartic equations of the type,(4-3-3),(4-4-4),(4-5-5) and (4-6-6), According to Lander, Parkin, and Selfridge (2) conjecture, there are non-trivial solutions of the quartic…

In this paper, we deal with the quartic Diophantine equation $X^4-Y^4=R^2-S^2$ to present its infinitely many integer solutions.

We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many $l$ such that…

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

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…