F₁F₂F₃F₄F₅F₆F₈F₁₀F₁₂=11!

MaRDI QIDQ854356zbMATH OpenFDO

Authors Pantelimon Stanica, Florian Luca

Publication date 11 December 2006

Published in Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/PM/63f3/1.html

zbMATH Keywords

Diophantine equations involving facultiesFibonacci numbers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Diophantine equations in many variables (11D72)

Review text

In this note, the authors extend the main result from [\textit{F. Luca}, Rocky Mt. J. Math. 29, No. 4, 1387--1411 (1999; Zbl 0978.11010)] and prove the following Theorem: The largest solution of the Diophantine equation \[ F_{n_1}\dots F_{n_k}=m_1!\dots m_t!, \] where \(0<n_1<\dots<n_k\) and \(1\leq m_1\leq m_2\leq\dots\leq m_t\) are integers, is \[ F_1F_2F_3F_4F_5F_6F_8F_{10}F_{12}=11!. \]

Recommendations

• On the solutions of the Diophantine equation \(F_n \pm \frac{a (10^m - 1)}{9} = k!\)
• On factorials which are products of factorials
• scientific article; zbMATH DE number 6151148
• scientific article; zbMATH DE number 6154285
• scientific article; zbMATH DE number 3539267

Cited in

(4)

• On members of Lucas sequences which are products of factorials
• Aeroelastic Simulations of Isolated Rotors Using Weak Fluid-Structure Coupling
• Sums or products of double factorials in Lucas sequences
• \(F_4 F_5^6 F_7 F_8^4 F_9 F_{10}^2 F_{12}^5 F_{14} F_{15}^{-1} F_{18} F_{24} F_{30}=36!\)

This page was built for publication: \(F_1F_2F_3F_4F_5F_6F_8F_{10}F_{12}=11!\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854356)