Related papers: L'\'equation diophantienne $ax^2-by^2=1$
In this paper, we study the exterior Dirichlet problem for the fully nonlinear elliptic equation $f(\lambda(D^{2}u))=1$. We obtain the necessary and sufficient conditions of existence of radial solutions with prescribed asymptotic behavior…
In this paper we investigate Diophantine equations of the form $T^2=G(\overline{X}),\; \overline{X}=(X_{1},\ldots,X_{m})$, where $m=3$ or $m=4$ and $G$ is specific homogenous quintic form. First, we prove that if…
In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…
We observe that the computation $5^2 = 25$ has the digital property of the result being equal to the exponent concatenated directly to the left of the base. The generalization to a Diophantine equation and inequality in number bases has…
We explicitly solve the diophantine equations of the form $$ A_{n_1}A_{n_2}\cdots A_{n_k}\pm 1 = B_m^2 $$ where $(A_n)_{n\geq 0}$ and $(B_m)_{m\geq 0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D.…
Let $m$ be a fixed square-free positive integer, then equivalence classes of solutions of Diophantine equation $x^2+m\cdot y^2=z^2$ form an infinitely generated abelian group under the operation induced by the complex multiplication. A…
The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such…
In this paper we use a natural iteration technique to prove existence of solutions to nonlinear Dirichlet problems. Among the examples included is the prescribed mean curvature equation. The nature of the technique allows applications to…
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
For fixed integer $a\ge3$, we study the binary Diophantine equation $\frac{a}n=\frac1x+\frac1y$ and in particular the number $E_a(N)$ of $n\le N$ for which the equation has no positive integer solutions in $x, y$. The asymptotic formula…
In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known…
In this work we proof the following theorem which is, in addition to someother lemmas, our main result:\noindent \textbf{theorem}. Let$\ X=\{ ( x\_{1}\text{, }%t\_{1}) \text{, }( x\_{2}\text{, }t\_{2}) \text{, ..., }(x\_{n}\text{,…
The title equation is completely solved in integers $(n,x,y,a,b)$, where $n\geq 3$, $\gcd(x,y)=1$ and $a,b\geq 0$. The most difficult stage of the resolution is the explicit resolution of a quintic Thue-Mahler equation. Since it is for the…
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…
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…
In a series of articles published in the C.R. Paris more than a century ago, T. P\'epin announced a list of ``theorems'' concerning the solvability of diophantine equations of the type $ax^4 + by^4 = z^2$. In this article, we show how to…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
The Riccati equations reducible to first-order linear equations by an appropriate change the dependent variable are singled out. All these equations are integrable by quadrature. A wide class of linear ordinary differential equations…