On the Diophantine Equation Fn = x^a \pm x^b \pm 1 in Mersenne and Fermat Numbers (Q5872495): Difference between revisions

@@ Property / cites work @@
+Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
+Normal rank
@@ Property / cites work @@
+Powers of two as sums of two k-Fibonacci numbers
@@ Property / cites work: Powers of two as sums of two k-Fibonacci numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215652
@@ Property / cites work: Q4215652 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
+Normal rank
@@ Property / cites work @@
+Q4556999
@@ Property / cites work: Q4556999 / rank @@
+Normal rank
@@ Property / cites work @@
+Pell and Pell-Lucas numbers of the form \(x^a\pm x^b+1\)
+Normal rank
@@ Property / cites work @@
+Q5179103
@@ Property / cites work: Q5179103 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3598632
@@ Property / cites work: Q3598632 / rank @@
+Normal rank
@@ Property / cites work @@
+An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
+Normal rank