相关论文: Markoff Equation and Nilpotent Matrices

A linear Diophantine equation $ax + by = n$ is solvable if and only if gcd$(a; b)$ divides $n$. A graph $G$ of order $n$ is called Diophantine if there exists a labeling function $f$ of vertices such that gcd$(f(u); f(v))$ divides $n$ for…

Let $(a, b, c)$ be a primitive Pythagorean triple parameterized as $a=u^2-v^2,\ b=2uv,\ c=u^2+v^2$,\ where $u>v>0$ are co-prime and not of the same parity. In 1956, L. Je{\'s}manowicz conjectured that for any positive integer $n$, the…

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…

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

In this paper, we use some extension of the Cayley-Hamilton theorem to find a family of matrices with integer entries that satisfy the non-linear Diophantine equation $ x^{n}+y^{p}=z^{q}$ where $n,p$ and $q$ are arbitrary positive integers.

The Diophantine equation (x^n-1)/(x-1)=y^q has four known solutions in integers x, y, q and n with |x|, |y|, q > 1 and n > 2. Whilst we expect that there are, in fact, no more solutions, such a result is well beyond current technology. In…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

The elements of Markoff triples are given by coefficients in certain matrix products defined by Christoffel words, and the Markoff injectivity conjecture, a long-standing open problem (also known as the uniqueness conjecture), is then…

Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…

For a nonzero integer $n$, a set of distinct nonzero integers $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i<j\leq m$, is called a Diophantine $m$-tuple with the property $D(n)$ or simply $D(n)$-set.…

We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.

A Pythagorean triple is a triple of positive integers $(x,y,z)$ such that $x^2+y^2=z^2$. If $x,y$ are coprime and $x$ is odd, then it is called a primitive Pythagorean triple. Berggren showed that every primitive Pythagorean triple can be…

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 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…

Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…

We consider the Diophantine inequality \[ \left| p_1^{c} + p_2^{c} + p_3^c- N \right| < (\log N)^{-E} , \] where $1 < c < \frac{15}{14}$, $N$ is a sufficiently large real number and $E>0$ is an arbitrarily large constant. We prove that the…

Problem 2 at the 56th International Mathematical Olympiad (2015) asks for all triples (a,b,c) of positive integers for which ab-c, bc-a, and ca-b are all powers of 2. We show that this problem requires only a primitive form of arithmetic,…

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…