Related papers: Diophantine equations with three monomials
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.
In recent years, differential equations have become the method of choice to compute multi-loop Feynman integrals. Whenever they can be cast into canonical form, their solution in terms of special functions is straightforward. Recently,…
Diophantine equations are a popular and active area of research in number theory. In this paper we consider Mordell equations, which are of the form $y^2=x^3+d$, where $d$ is a (given) nonzero integer number and all solutions in integers…
In this paper we obtain the Lebesgue and Hausdorff measure results for the set of vectors satisfying infinitely many fully non-linear Diophantine inequalities. The set is associated with a class of linear inhomogeneous partial differential…
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…
We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…
Ramanujan, in his lost notebook, gave an interesting identity, which generates infinite families of solutions to Euler's Diophantine equation $A^3 + B^3 = C^3 + D^3$. In this paper, we produce a few infinite families of solutions to the…
This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…
This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
Let $d\ge 2$ and $n\ge d$ with $(d,n)\notin \{(2,2),(3,3)\}$. We consider homogeneous Diophantine equations of degree $d$ in $n+1$ variables and whether they have solutions in the primes. In particular, we show that a certain local-global…
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…
Let $\{x_{n}\}_{n \geq 0}$ be the balancing-like sequence defined by $x_{n+1} = A x_{n} - x_{n-1}$, for $A>2$, where $x_0 = 0$ and $x_1 = 1$. In this paper, we demonstrate how to find all the solutions of the Diophantine equation,…
We give a non-iterative solution to a particular case of the four-point three-views pose problem when three camera centers are collinear. Using the well-known Cayley representation of orthogonal matrices, we derive from the epipolar…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
In this article we go deeply into the formulation and meaning of the monomiality principle and employ it to study the properties of a set of polynomials, which, asymptotically, reduce to the ordinary two variable Kampe de Feriet family. We…
We search points in a Vogel plane with regular universal expression for character of adjoint representation. This gives seven patterns of singularities cancellation, each giving a certain Diophantine equation of third order on three…
In this short note we study the existence and number of solutions in the set of integers ($Z$) and in the set of natural numbers ($N$) of Diopahntine Equations of second degree with two variables of the general form $ax^2-by^2=c$.
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…