Results 111 to 120 of about 2,595 (231)
Exponential Diophantine equations [PDF]
Brenner, J. L., Foster, Lorraine L.
openaire +3 more sources
Our purpose is to study a variety of Diophantine equations involving the Smarandache function.
Tuţescu, Lucian, Burton, Emil
openaire +2 more sources
Positive solutions of the diophantine equation
Integral solutions of x3+λy+1−xyz=0 are observed for all integral λ. For λ=2 the 13 solutions of the equation in positive integers are determined. Solutions of the equation in positive integers were previously determined for the case λ=1.
W. R. Utz
doaj +1 more source
From Diophantian Equations to Matrix Equations (Iv) - Diophantian Equations of Higher Degree [PDF]
In the context of training and developing the skills of teachers, students and children to solve exercises and problems in Mathematics, in this paper we propose to continue the steps started in the first three papers with the same generic title and ...
Teodor Dumitru Vălcan
doaj +1 more source
General Solution of the Diophantine equation involving Mersenne Prime
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers.
Ghosh, Arkabrata
core
All solutions of consecutive natural numbers sum equation and their closed forms
Purpose: This study aims to find a closed-form solution for all ordered pairs of natural numbers (?,?) satisfying the consecutive natural number sum equation 1 + 2 + ⋯ + ? sama dengan (? + 1) + (? + 2) + ⋯ + ?. This research contributes to number theory,
Sofihara Al Hazmy +3 more
doaj +1 more source
A Diophantine equation involving one Linnik prime
summary:Let $[\theta ]$ denote the integral part of the real number $\theta .$ We prove that for ...
Liu, Yuhui
core +1 more source
On the Diophantine equation x3=dy2±q6
Let q>3 denote an odd prime and d a positive integer without any prime factor p≡1(mod3). In this paper, we have proved that if (x,q)=1, then x3=dy2±q6 has exactly two solutions provided q≢±1(mod24).
Fadwa S. Abu Muriefah
doaj +1 more source
Let Bn = {xi · xj = xk : i, j, k ∈ {1, . . . , n}} ∪ {xi + 1 = xk : i, k ∈ {1, . . . , n}} denote the system of equations in the variables x1, . . . , xn. For a positive integer n, let _(n) denote the smallest positive integer b such that for each system
Tyszka Apoloniusz
doaj +1 more source
Computing all integer solutions of a genus 1 equation
The Elliptic Logarithm Method has been applied with great successto the problem of computing all integer solutions of equations ofdegree 3 and 4 defining elliptic curves. We extend this methodto include any equation f(u,v)=0 that defines a curve of genus
Stroeker, R.J., Tzanakis, N.
core

