Computational algorithm for solving the diophantine equations 2^n \pm \alpha \cdot 2^m + \alpha^2 = x^2
Saved in:
| Main Author: | Szalay László |
|---|---|
| Format: | Article |
| Published: |
2020
|
| Series: | HOUSTON JOURNAL OF MATHEMATICS
46 No. 2 |
| Subjects: | |
| Online Access: | http://publicatio.uni-sopron.hu/1948 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The equations 2(N) +/- 2(M) +/- 2(L) = z(2)
by: Szalay László
Published: (2002) -
On the equation (2^k-1)(2^l-1)=5^m-1
by: Luca Florian, et al.
Published: (2020) -
Algorithm to solve certain ternary quartic Diophantine equations
by: Szalay László
Published: (2013) -
Resolution of the equation (3x1 − 1)(3x2 − 1) = (5y1 − 1)(5y2 − 1)
by: Liptai Kálmán, et al.
Published: (2020) -
Reduced diophantine quadruples with the binary recurrence G(n) = AG(n-1) - G(n-2)
by: Alp M, et al.
Published: (2015)