相关论文: Integer Algorithms to Solver Diophantine Linear Eq…

In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…

In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.

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}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

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…

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

New formulae are presented for the number $P(b)$ of non-negative integer solutions of a Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ and for the number $Q(b)$ of non-negative integer solutions of the Diophantine inequality…

In this note we recall the definition of the digital root, and apply the notion of the digital root to searching solutions of Diophantine equations. A table of arithmetic operations with digital roots is given. This method is incapable of…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

In our preceding paper, we have proposed an algorithm for obtaining finite-norm solutions of higher-order linear ordinary differential equations of the Fuchsian type [\sum_m p_m (x) (d/dx)^m] f(x) = 0 (where p_m is a polynomial with…

We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…

The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

We generalize the notions of singularities and ordinary points from linear ordinary differential equations to D-finite systems. Ordinary points of a D-finite system are characterized in terms of its formal power series solutions. We also…

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

We implement four algorithms for solving linear Diophantine equations in the naturals: a lexicographic enumeration algorithm, a completion procedure, a graph-based algorithm, and the Slopes algorithm. As already known, the lexicographic…

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for…

In this work, we accomplish three goals. First, we determine the entire family of positive integer solutions to the three- variable Diophantine equation, xy=z^2; for n=2,3,4,5,6. For n=2, we obtain a 3-parameter family of solutions; for…

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…