This paper is concerned with the diophantine equation $\sum_{i=1}^na_ix_i^4= \sum_{i=1}^na_iy_i^4$ where $n \geq 3$ and $a_i,\,i=1,\,2,\,\ldots,\,n$, are arbitrary integers. While a method of obtaining numerical solutions of such an equation has recently been given, it seems that an explicit parametric of this diophantine equation has not yet been published. We obtain a multi-parameter solution of this equation for arbitrary values of $a_i$ and for any positive integer $n \geq 3$, and deduce specific solutions when $n=3$ and $n=4$. The numerical solutions thus obtained are much smaller than the integer solutions of such equations obtained earlier.
The beautiful quartic Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been studied by some mathematicians for many years. Although Choudhry, Gerardin and Piezas presented solutions of this equation for many values of $h$, the solutions were not known for arbitrary positive integer values of $h$. In a separate paper (see the arxiv), the authors completely solved the equation for arbitrary values of $h$, and worked out many examples for different values of $h$, in particular for the values which has not already been given a solution. Our method, giv…
In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform each case of the above Diophantine equations to a cubic elliptic curve of positive rank, then get infinitely many integer solutions for each case. We also solve these Diophantine equations for some values of n, a, a_i, t_i, and obtain infinitely many solutions for each case, and show among the other things that how sums of four, five, or more cubics can be wr…
In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for some values of $a_i$ and $n=3,4$, and find nontrivial solutions for each case in natural numbers. By our method, we may find infinitely many nontrivial solutions for the above Diophantine equation and show, among the other things, that how some numbers can be written as sums of three, four, or more biquadrates in two different ways. While our method can be used…
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
In this paper we obtain a parametric solution of the hitherto unsolved diophantine equation $(x_1^5+x_2^5)(x_3^5+x_4^5)=(y_1^5+y_2^5)(y_3^5+y_4^5)$. Further, we show, using elliptic curves, that there exist infinitely many parametric solutions of the aforementioned diophantine equation, and they can be effectively computed.
By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
Many authors studied the problem that rational triangle pairs (triangle-parallelogram pairs) with the same area and the same perimeter. They investigated this problem by solving the rational solutions of the corresponding Diophantine equations. In this paper, we give a unified description of this problem by using the affine transformation in a rectangular coordinate system. According to the fact that two triangles with the same area and the same perimeter determine an affine transformation, this problem can be reduced to solving a specific Diophantine system. Moreover, we will give some ration…
In this article the Diophantine equations of the form $x^{2}-8C_{n}xy+ 16y^{2}=\pm2^{r}$, $x^{4}-8C_{n}x^{2}y+ 16y^{2}=\pm2^{r}$ and $x^{2}-8C_{n}xy^{2}+ 16y^{4}=\pm2^{r}$ are taken into consideration for the investigations of existence of any positive integer solutions. Furthermore, the solutions are manifested in terms of the balancing, Pell and Lucas-Pell numbers.
Let $\bar{X}_{n}=(x_{1},\ldots,x_{n})$ and $σ_{i}(\bar{X}_{n})=\sum x_{k_{1}}\ldots x_{k_{i}}$ be $i$-th elementary symmetric polynomial. In this note we prove that there are infinitely many triples of integers $a, b, c$ such that for each $1\leq i\leq n$ the system of Diophantine equations \begin{equation*} σ_{i}(\bar{X}_{2n})=a, \quad σ_{2n-i}(\bar{X}_{2n})=b, \quad σ_{2n}(\bar{X}_{2n})=c \end{equation*} has infinitely many rational solutions. This result extend the recent results of Zhang and Cai, and the author. Moreover, we also consider some Diophantine systems involving sums of powers. …
Let $r\ge 1$ be an integer and ${\bf U}:=\{U_n\}_{n\ge 0}$ be the Lucas sequence given by $U_0=0,~U_1=1$, and $U_{n+2}=rU_{n+1}+U_n$ for $n\ge 0$. In this paper, we explain how to find all the solutions of the Diophantine equation, $AU_{n}+BU_{m}=CU_{n_1}+DU_{m_1}$, in integers $r\ge 1$, $0\le m<n,~0\le m_1<n_1$, $AU_n\ne CU_{n_1}$, where $A,B,C,D$ are given integers with $A\ne 0,~B\ne 0$, $m,n,m_1,n_1$ are nonnegative integer unknowns and $r$ is also unknown.
In this paper, we consider the equations involving Euler's totient function $ϕ$ and Lucas type sequences. In particular, we prove that the equation $ϕ(x^m-y^m)=x^n-y^n$ has no solutions in positive integers $x, y, m, n$ except for the trivial solutions $(x, y, m , n)=(a+1, a, 1, 1)$, where $a$ is a positive integer, and the equation $ϕ((x^m-y^m)/(x-y))=(x^n-y^n)/(x-y)$ has no solutions in positive integers $x, y, m, n$ except for the trivial solutions $(x, y, m , n)=(a, b, 1, 1)$, where $a, b$ are integers with $a>b\ge 1$.
On the Diophantine Equation Involving Elementary Symmetric Polynomials and the Decomposition of Unity
Budapest University of Technology and Economics（布达佩斯技术与经济大学）；HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利研究与教育网络阿尔弗雷德·雷尼数学研究所）；Cracow University of Technology（克拉科夫理工大学）
We prove that there are infinitely many solutions of $$ |λ_0+λ_1p+λ_2P_r|<p^{-τ}, $$ where $r=3,$ $τ=\frac1{118}$, and $λ_0$ is an arbitrary real number and $λ_1,λ_2\in\BR$ with $λ_2\neq0$ and $0>\frac{λ_1}{λ_2}$ not in $\mathbb{Q}$. This improves a result by Harman. Moreover, we show that one can require the prime $p$ to be of the form $\floor{n^c}$ for some positive integer $n$, i.e. $p$ is a Piatetski-Shapiro prime, with $r=13$ and $τ=ρ(c),$ a constant explicitly determined by $c$ supported in $\left(1, 1+\frac1{149}\right].$
In this paper, we show that the equation $φ(|x^{m}-y^{m}|)=|x^{n}-y^{n}|$ has no nontrivial solutions in integers $x,y,m,n$ with $xy\neq0, m>0, n>0$ except for the solutions $(x,y,m,n)=((2^{t-1}\pm1),-(2^{t-1}\mp1),2,1), (-(2^{t-1}\pm1),(2^{t-1}\mp1),2,1),$ where $t$ is a integer with $t\geq 2.$ The equation $φ(|\frac{x^{m}-y^{m}}{x-y}|)=|\frac{x^{n}-y^{n}}{x-y}|$ has no nontrivial solutions in integers $x,y,m,n$ with $xy\neq0, m>0, n>0$ except for the solutions $(x,y,m,n)=(a\pm1, -a, 1, 2), (a\pm i, -a, 2, 1),$ where $a$ is a integer with $i=1,2.$
Let $σ_{i}(x_{1},\ldots, x_{n})=\sum_{1\leq k_{1}<k_{2}<\ldots <k_{i}\leq n}x_{k_{1}}\ldots x_{k_{i}}$ be the $i$-th elementary symmetric polynomial. In this note we generalize and extend the results obtained in a recent work of Zhang and Cai \cite{ZC,ZC2}. More precisely, we prove that for each $n\geq 4$ and rational numbers $a, b$ with $ab\neq 0$, the system of diophantine equations \begin{equation*} σ_{1}(x_{1},\ldots, x_{n})=a, \quad σ_{n}(x_{1},\ldots, x_{n})=b, \end{equation*} has infinitely many solutions depending on $n-3$ free parameters. A similar result is proved for the system \beg…
A Pair of Diophantine Equations Involving the Fibonacci Numbers
Carnegie Mellon University（卡内基梅隆大学）；Texas A&M University（德克萨斯农工大学）；Institut Teknologi Bandung（万隆理工学院）；University of California, Berkeley（加州大学伯克利分校）；University of Virginia（弗吉尼亚大学）；Williams College（威廉姆斯学院）；University of Waterloo（滑铁卢大学）
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving every prime $p$ with $p\equiv 13, 17, 19, 23 \pmod{24}$. In this paper, we investigate the parity of $b_{21}(n)$ involving the primes $p$ with $p\equiv 1, 5, 7, 11 \pmod{24}$. We prove new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving the odd pr…
In this note we present some results concerning the unirationality of the algebraic variety $\cal{S}_{f}$ given by the equation \begin{equation*} N_{K/k}(X_{1}+αX_{2}+α^2 X_{3})=f(t), \end{equation*} where $k$ is a number field, $K=k(α)$, $α$ is a root of an irreducible polynomial $h(x)=x^3+ax+b\in k[x]$ and $f\in k[t]$. We are mainly interested in the case of pure cubic extensions, i.e. $a=0$ and $b\in k\setminus k^{3}$. We prove that if $\op{deg}f=4$ and the variety $\cal{S}_{f}$ contains a $k$-rational point $(x_{0},y_{0},z_{0},t_{0})$ with $f(t_{0})\neq 0$, then $\cal{S}_{f}$ is $k$-unirat…
This thesis is about the study of Diophantine equations involving binary recurrent sequences with arithmetic functions. Various Diophantine problems are investigated and new results are found out of this study. Firstly, we study several questions concerning the intersection between two classes of non-degenerate binary recurrence sequences and provide, whenever possible, effective bounds on the largest member of this intersection. Our main study concerns Diophantine equations of the form $φ(|au_n |)=|bv_m|,$ where $φ$ is the Euler totient function, $\{u_n\}_{n\geq 0}$ and $\{v_m\}_{m\geq 0}$ ar…
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ θ,$ where $ θ>2$ is real and non-integral. For fixed non-zero real numbers $ λ_i $ not all of the same sign we write \begin{equation*} \mathcal F (\textbf{x}) = λ_1 x_1^θ+ \cdots + λ_s x_s^θ. \end{equation*} For a fixed positive real number $ τ$ we give an asymptotic formula for the number of positive integer solutions of the inequality $ | \mathcal F (\textbf{x}) | < τ$ inside a box of side length $P.$ Moreover, we investigate the problem of representing a large positive real number by a positiv…
In this paper we examine the diophantine equation $x^k-y^k=x-y$ where $k$ is a positive integer $\geq 2$, and consider its applications. While the complete solution of the equation $x^k-y^k=x-y$ in positive rational numbers is already known when $k=2$ or $3$, till now only one numerical solution of the equation in positive rational numbers has been published when $k=4$, and no nontrivial solution is known when $k \geq 5$. We describe a method of generating infinitely many positive rational solutions of the equation when $k=4$. We use the positive rational solutions of the equation with $k=2,\,…
Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime …
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses lower bounds for linear forms in logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.
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 Diophantine Equations $a_1!a_2!\cdots a_n! \pm a_1a_2 \cdots a_n = b_1!b_2! \cdots b_k! \pm b_1b_2 \cdots b_k$, where $a_i$ majorizes $b_i$. Furthermore we find a sufficient condition on a function $f:N\to R^+$ to guarantee that $f$ gives a monotone function on the POSET of all finite sequences of natural numbers. We then use that to solve other Diophant…
In this paper, by solving Diophantine equations involving simple $K_4$-groups, we will try to point out that it is not easy to prove the infinitude of simple $K_4$-groups. This problem goes far beyond what is known about Dickson's conjecture at present.
We prove the existence of S-integral solutions of simultaneous diophantine inequalities for pairs (Q,L) involving one quadratic form and one linear form satisfying some arithmetico-geometric conditions. The proof uses strong approximation in algebraic groups and Ratner's topological rigidity of unipotent actions on homogeneous spaces.
Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots B_{m+(k-1)d}=y^\ell \end{align*} in positive integers $m,d,k,y$ with $\gcd(m,d)=1$ and $k\geq 2$, where $\ell\geq 2$ is a fixed integer and $B=(B_n)_{n=1}^\infty$ is an elliptic divisibility sequence, an important class of non-linear recurrences. We prove that the above equation admits only finitely many solutions. In fact, we present an algorithm to find all possible solu…
