Abstract
Let (Fn)n≥o be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as {equation presented}, for k > m. In this paper, we shall prove that if p is a prime number such that p ≡ -2 or 2 (mod 5), then p | {equation presented} for all a ≥ 1.
Original language | English (US) |
---|---|
Pages (from-to) | 78-83 |
Number of pages | 6 |
Journal | Fibonacci Quarterly |
Volume | 51 |
Issue number | 1 |
State | Published - Feb 2013 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory