Related papers: Sparse solutions of linear Diophantine equations

Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the…

Let $a_1,\ldots,a_n$ and $b_1,\ldots,b_m$ be fixed positive integers, and let ${\mathcal S}$ denote the set of all nonnegative integer solutions of the equation $x_1a_1+\ldots +x_na_n=y_1b_1+\ldots +y_mb_m$. A solution…

We derive a closed expression for the number of nonnegative solutions of a certain system of linear Diophantine equations. The motivation comes from high energy physics where the nonnegative solutions play a crucial role in the perturbative…

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 paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…

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…

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be…

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 establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.

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…

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…

Given three positive integers $a,b,c$, a proportionally modular Diophantine inequality is an expression of the form $ax \mod{b} \le cx$. Our aim is to give a recursive formula for the least solution to such an inequality. We then use the…

In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…

The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…

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 consider the Diophantine equation $$ a!b! = c! $$ due to Erd\H{o}s, where we assume $a \leq b$. It is widely believed that there are only finitely many nontrivial solutions, and considerable work has been dedicated to showing this. In…

For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative…

By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

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.