When does F^L_m divide F_n? A combinatorial solution
From MaRDI portal
Publication:2883384
zbMATH Open1263.11021MaRDI QIDQ2883384FDOQ2883384
Authors: Arthur T. Benjamin, Jeremy Rouse 
Publication date: 10 May 2012
Published in: Congressus Numerantium (Search for Journal in Brave)
Recommendations
- ON DIVISIBILITY OF ${\fontsize{9}{11}\selectfont\Big(\!\!\begin{array}{c}n-i-1\\[2pt]i-1\end{array}\!\!\Big)}$ by i
- scientific article; zbMATH DE number 1175380
- On composite \(n\) dividing \(\varphi(n)\sigma(n)+1\)
- On the divisibility of \(a^n \pm b^n\) by powers of \(n\)
- scientific article; zbMATH DE number 3243896
- On divisibility by \(\frac{a^k-b^k}{a-b}\)
- The Divisibility of an – bn by Powers of n
- On numbers \(n\) dividing the \(n\)th term of a linear recurrence
- On the divisibility \(a! + b! \mid (a + b)!\)
- Publication:3478473
Cited In (8)
- Exact divisibility by powers of the integers in the Lucas sequence of the first kind
- Exact divisibility by powers of the integers in the Lucas sequences of the first and second kinds
- Some new and old Gibonacci identities
- On divisibility of a relation of the Fibonacci numbers
- Extended Fibonacci numbers and polynomials with probability applications
- Exact divisibility by powers of the Pell and associated Pell numbers
- Subsequences and divisibility by powers of the Fibonacci numbers
- Exact divisibility properties of some subsequences of Fibonacci numbers
This page was built for publication: When does \(F^L_m\) divide \(F_n\)? A combinatorial solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883384)
