Results 1 to 10 of about 3,148,152 (262)

The Diophantine Equation 8x+py=z2 [PDF]

open access: yesThe Scientific World Journal, 2015
Let p be a fixed odd prime. Using certain results of exponential Diophantine equations, we prove that (i) if p≡±3(mod  8), then the equation 8x+py=z2 has no positive integer solutions (x,y,z); (ii) if p≡7(mod  8), then the equation has only the solutions
Lan Qi, Xiaoxue Li
doaj   +3 more sources

The Exponential Diophantine Equation 2x+by=cz [PDF]

open access: yesThe Scientific World Journal, 2014
Let b and c be fixed coprime odd positive integers with min{b,c}>1. In this paper, a classification of all positive integer solutions (x,y,z) of the equation 2x+by=cz is given. Further, by an elementary approach, we prove that if c=b+2, then the equation
Yahui Yu, Xiaoxue Li
doaj   +3 more sources

A hypothetical upper bound on the heights of the solutions of a Diophantine equation with a finite number of solutions

open access: yesOpen Computer Science, 2018
We define a computable function f from positive integers to positive integers. We formulate a hypothesis which states that if a system S of equations of the forms xi· xj = xk and xi + 1 = xi has only finitely many solutions in non-negative integers x1, .
Tyszka Apoloniusz
doaj   +2 more sources

The Exponential Diophantine Equation 4m2+1x+5m2-1y=(3m)z

open access: yesAbstract and Applied Analysis, 2014
Let m be a positive integer. In this paper, using some properties of exponential diophantine equations and some results on the existence of primitive divisors of Lucas numbers, we prove that if m>90 and 3|m, then the equation 4m2+1x + 5m2-1y=(3m)z has ...
Juanli Su, Xiaoxue Li
doaj   +2 more sources

On solutions of the Diophantine equation $L_n+L_m=3^a$ [PDF]

open access: yesMalaya Journal of Matematik, 2022
Let $(L_n)_{n\geq 0}$ be the Lucas sequence given by $L_0 = 2, L_1 = 1$ and $L_{n+2} = L_{n+1}+L_n$ for $n \geq 0$. In this paper, we are interested in finding all powers of three which are sums of two Lucas numbers, i.e., we study the exponential ...
P. Tiebekabe, I. Diouf
semanticscholar   +1 more source

On the solution of the exponential Diophantine equation 2x+m2y=z2, for any positive integer m [PDF]

open access: yesJournal of Hyperstructures, 2023
It is well known that the exponential Diophantine equation 2x+ 1=z2 has the unique solution x=3 and z=3 innon-negative integers, which is closely related to the Catlan's conjecture.
Mridul Dutta, Padma Bhushan Borah
doaj   +1 more source

The integer solutions of the cubic Diophantine equation x3±33=pqy2

open access: yesXi'an Gongcheng Daxue xuebao, 2021
The solvability of a class of cubic Diophantine equations is studied by using properties of congruence, Legendre symbol and the methods of elementary number theory.
Heng LI, Hai YANG, Yongliang LUO
doaj   +1 more source

Gaussian Integer Solutions of the Diophantine Equation x^4+y^4=z^3 for x≠ y

open access: yesمجلة بغداد للعلوم, 2023
The investigation of determining solutions for the Diophantine equation  over the Gaussian integer ring for the specific case of  is discussed.
Shahrina Ismail   +3 more
doaj   +1 more source

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

open access: yesMathematics, 2021
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 ...
S. Subburam   +6 more
doaj   +1 more source

From Diophantian Equations to Matrix Equations (III) - Other Diophantian Quadratic Equations and Diophantian Equations of Higher Degree [PDF]

open access: yesEducaţia 21, 2023
In this paper, we propose to continue the steps started in the first two papers with the same generic title and symbolically denoted by (I) and (II), namely, the presentation of ways of achieving a systemic vision on a certain mathematical notional ...
Teodor Dumitru Vălcan
doaj   +1 more source

Home - About - Disclaimer - Privacy