On exponential Diophantine equation 17x +83y = z2 and 29x +71y = z2

This Diophantine is an equation that many researchers are interested in and studied in many form such 3x +5y · 7z = u2, (x+1)k + (x+2)k + … + (2x)k = yn and kax + lby = cz. The extensively studied form is ax + by = cz. In this paper we show that the Diophantine equations 17x +83y = z2 and 29x +71y = z2 has a unique non – negative integer solution (x, y, z) = (1,1,10)

On the exponential Diophantine equation mx +(m+1) y =(1+m+m 2) z

Let m > 1 be a positive integer. We show that the exponential Diophantine equation mx + (m + 1) y = (1 + m + m 2) z has only the positive integer solution (x, y, z) = (2, 1, 1) when m ≥ 2.

A note on the polynomial-exponential Diophantine equation (a^n − 1)(b^n − 1) = x^2

For any positive integer t, let ord_2 t denote the order of 2 in the factorization of t. Let a,\,b be two distinct fixed positive integers with \min\{a,b\}>1. In this paper, using some elementary number theory methods, the existence of positive integer solutions (x,n) of the polynomial-exponential Diophantine equation (*) (a^n-1)(b^n-1)=x^2 with n>2 is discussed. We prove that if \{a,b\}\ne \{13,239\} and ord_2(a^2-1)\ne ord_2(b^2-1), then (*) has no solutions (x,n) with 2\mid n. Thus it can be seen that if \{a,b\}\equiv \{3,7\},\{3,15\},\{7,11\},\{7,15\} or \{11,15\} \pmod{16}, where \{a,b\} \equiv \{a_0,b_0\} \pmod{16} means either a \equiv a_0 \pmod{16} and b \equiv b_0\pmod{16} or a\equiv b_0 \pmod{16} and b\equiv a_0 \pmod{16}, then (*) has no solutions (x,n).

On the Exponential Diophantine Equation (132m) + (6r + 1)n = z2

Nowadays, mathematicians are very interested in discovering new and advanced methods for determining the solution of Diophantine equations. Diophantine equations are those equations that have more unknowns than equations. Diophantine equations appear in astronomy, cryptography, abstract algebra, coordinate geometry and trigonometry. Congruence theory plays an important role in finding the solution of some special type Diophantine equations. The absence of any generalized method, which can handle each Diophantine equation, is challenging for researchers. In the present paper, the authors have discussed the existence of the solution of exponential Diophantine equation (132m) + (6r + 1)n = Z2, where m, n, r, z are whole numbers. Results of the present paper show that the exponential Diophantine equation (132m) + (6r + 1)n = Z2, where m, n, r, z are whole numbers, has no solution in the whole number.

On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

On the Diophantine Equation Mp^x + (Mq + 1)^y = z^2

In this paper, we study and solve the exponential Diophantine equation of the formMxp + (Mq + 1)y = z2 for Mersenne primes Mp and Mq and non-negative integers x, y, and z. We use elementary methods, such as the factoring method and the modular arithmetic method, to prove our research results. Several illustrations are presented, as well as cases where solutions to the Diophantine equation do not exist.

Exploration of Solutions for an Exponential Diophantine Equation px+ (p +1)y= z2

In this text, the exclusive exponential Diophantine equation px + (p + 1)y= z2such that the sum of integer powers and of two consecutive prime numbers engrosses a square is examined or estimating enormous integer solutions by exploiting the fundamental notion of Mathematics and the speculation of divisibility or all possibilities of x + y = 1, 2, 3, 4..