Results 61 to 70 of about 2,595 (231)
On the exponential Diophantine equation mx+(m+1)y=(1+m+m2)z
Let m > 1 be a positive integer. We show that the exponential Diophantine equation mx + (m + 1)y = (1 + m + m2)z has only the positive integer solution (x, y, z) = (2, 1, 1) when m ≥ 2.
Alan Murat
doaj +1 more source
Abstract We survey ideas surrounding the study of the number of integers that can be represented as the sum of three positive cubes. We focus on the early contribution of Davenport using elementary techniques, and the subsequent developments due to Vaughan, which introduced Fourier analysis and mirrored many of the important developments of the Hardy ...
James Maynard
wiley +1 more source
The Exponential Diophantine Equation 4m2+1x+5m2-1y=(3m)z
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 +1 more source
Random Diophantine equations in the primes II
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley +1 more source
The Polynomial Solutions of Quadratic Diophantine Equation X2−ptY2+2KtX+2ptLtY = 0
In this study, we consider the number of polynomial solutions of the Pell equation x2−pty2=2 is formulated for a nonsquare polynomial pt using the polynomial solutions of the Pell equation x2−pty2=1.
Hasan Sankari, Ahmad Abdo
doaj +1 more source
Separable Diophantine equations [PDF]
Theoretically, as noted by Skolem [3, p. 21(1), the general problem of algebraic diophantine analysis is reducible to the case in which occur only equations and inequalities of degree not higher than the second. For the extensive class of separable systems defined in ?6, this reduction can be performed effectively, eventuating in the complete integer ...
openaire +2 more sources
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Solving the n $n$‐Player Tullock Contest
ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley +1 more source
Bound on some Diophantine equation
Diophantine equation is known as a polynomial equation with two or more unknowns which only integral solutions are sought. This paper will concentrate on finding the least upper bound to the Diophantine equation x 2 + 2a 7 b = y n for 1 ≤ α ≤ 8 and found
Amalulhair, N. H. +2 more
core
On the Diophantine equation [PDF]
This paper discusses an integral solution (a, b, c) of the Diophantine equations x3n+y3n = 2z2n for n ≥ 2 and it is found that the integral solution of these equation are of the form a = b = t2, c = t3 for any integers ...
Mohd Atan, Kamel Ariffin +5 more
core +1 more source

