Related papers: How to Solve a Diophantine Equation
We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
We extend the key formula which intertwines multiplicative Markoff-Lagrange spectrum and symbolic dynamics. The proof uses complex analysis and elucidates the strategy of the problem. Moreover, the new method applies to a wide variety of…
In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials…
In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive…
The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
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 deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.
We propose a method to determine the solvability of the diophantine equation $x^2-Dy^2=n$ for the following two cases: $(1)$ $D=pq$, where $p,q\equiv 1 \mod 4$ are distinct primes with $(\frac{q}{p})=1$ and…
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…
In this paper we give a survey of what is currently known about Diophantine exponents of lattices and propose several problems.
In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…
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…
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.