Sums or products of double factorials in Lucas sequences
From MaRDI portal
Publication:6591601
DOI10.1142/S1793042124500957MaRDI QIDQ6591601
Shaonan Zhang, Tianxin Cai, Peng Yang
Publication date: 22 August 2024
Published in: International Journal of Number Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(F_1F_2F_3F_4F_5F_6F_8F_{10}F_{12}=11!\)
- The product of consecutive integers is never a power
- Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
- Products of factorials in binary recurrence sequences
- Sums of factorials in binary recurrence sequences
- On members of Lucas sequences which are either products of factorials or product of middle binomial coefficients and Catalan numbers
- On members of Lucas sequences which are products of factorials
- Note on products of consecutive integers.
- Über diophantische Gleichungen der Form \(n!=x^p\pm y^p\) und \(n!\pm m!=x^p\).
- A new kind of Diophantine equations
- Logarithmic forms and group varieties.
- Perfect powers from products of consecutive terms in arithmetic progression
- The Diophantine Equation n ! + 1 = m2
- On the diophantine equation ${n \choose k} = x^l$
- On the diophantine equation $n(n+1)...(n+k-1) = bx^l$
- On factorials expressible as sums of at most three Fibonacci numbers
- On the Diophantine equation $F_{n}-F_{m}=2^{a}$
- On The diophantine equationFn+Fm=2a
- On a Diophantine Equation
- On the numerical factors of the arithmetic forms \(\alpha^n\pm \beta^n\).
This page was built for publication: Sums or products of double factorials in Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591601)
