Results 21 to 30 of about 1,430,683 (165)
On some Diophantine equations [PDF]
Journal of Inequalities and Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sakarya Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü +3 more
openaire +1 more source
Open 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 +1 more source
Glasgow Mathematical Journal, 1985 I was recently challenged to find all the cases when the sum of three consecutive integral cubes is a square; that is to find all integral solutions x, y ofy2=(x−1)3+x3+(x+1)3=3x(x2+2)This is an example of a curve of genus 1. There is an effective procedure for finding all integral points on a given curve of genus 1 ([1, Theorem 4.2], [2]): that is, it
openaire +2 more sources
The Solution of a Diophantine Equation [PDF]
Proceedings of the American Mathematical Society, 1952 in which we suppose that f(y) =f(yi, * ya) is a homogeneous polynomial, with integral coefficients, of degree m, where m is of the form 2P(2q+1), q being a non-negative integer, p is one of the integers 0, 1, * * *, n -1, and thus m 0 0 (mod 2n). We suppose further that the rank of the matrix of the forms Enl aajx (i= 1, , 2n) is 2n -1 and thus we may ...
openaire +2 more sources
Systems of Diophantine Equations [PDF]
Proceedings of the American Mathematical Society, 1951 where fi and gi are homogeneous polynomials with integral coefficients, fi being of degree n and gi being of degree m. If there are no integers s> 1, a k, 3' such that ak = sla , ij = s, where X, g are positive integers such that Xn =,m, then Xk= ak, yij=gi3 is defined to be a primitive solution of (1). If Xk=aQk, yij=fi3 is a primitive solution of (1),
openaire +1 more source
On the Relationship Between Matiyasevich's and Smorynski's Theorems
Scientific Annals of Computer Science, 2019 Let R be a non-zero subring of Q with or without 1. We assume that for every positive integer n there exists a computable surjection from N onto Rn. Every R \in {Z,Q} satisfi es these conditions.
Agnieszka Peszek, Apoloniusz Tyszka
doaj +1 more source
A note on the Diophantine equation (xᵏ-1)(yᵏ-1)²=zᵏ-1 [PDF]
Notes on Number Theory and Discrete MathematicsWe prove that, for k≥10, the Diophantine equation (xᵏ-1)(yᵏ-1)²=zᵏ-1 in positive integers x, y, z, k with z>1, has no solutions satisfying ...
Yangcheng Li
doaj +1 more source
An Introduction to Refined Neutrosophic Number Theory [PDF]
Neutrosophic Sets and Systems, 2021 Number theory is concerned with properties of integers and Diophantine equations. The objective of this paper is dedicated to introduce the basic concepts in refined neutrosophic number theory such as division, divisors, congruencies, and Pell's equation
Mohammad Abobala, Muritala Ibrahim
doaj +1 more source
A CLASS OF DIOPHANTINE EQUATIONS [PDF]
Proceedings of the National Academy of Sciences, 1959 Nach Verf. hat \[ \alpha^x+\beta^x=\alpha^n+\beta^n,\quad \alpha,\beta=\tfrac 12 (1\pm\sqrt{-7}), \] für gegebene \(n\) höchstens zwei Lösungen und für \(n=2^m\) genau die triviale Lösung \(x=2^m\).
openaire +3 more sources
We solve a problem posed recently by J.H.E. Cohn, in proving that x = y = 1 is the only solution in nonnegative integers to the diophantine equation x^2 - 3 y^4 = -2.diophantine ...
Weger, B.M.M. de
core +4 more sources