A note on Fibonomial coefficients. (English) Zbl 1459.11039

Let \(F_0, F_1, \dots\) be the Fibonacci numbers. For \(n \geq 1\) it is put \[[0]_F = 1, [n]_F = \prod_{u=1}^n F_k.\]
For \(n \geq k \geq 0\), the Fibonomial coefficient is given by \[ \binom{n}{k}_F = \frac{[n]_F}{[k]_F [n-k]_F} = \frac{F_{n-k+1} \cdots F_n}{F_1 \cdots F_k}.\]
In the paper it is proved that for almost primes \(p\), each residue class \(\lambda\) modulo \(p\) can be written as \[ \binom{ u_1}{v_1}_F + \ldots + \binom{ u_8}{v_8}_F \equiv \lambda \pmod p, \] for positive integers \(u_1, v_1, \ldots, u_8, v_8 \ll p^{3/2}\log^2 p\).


11B39 Fibonacci and Lucas numbers and polynomials and generalizations
11B50 Sequences (mod \(m\))
Full Text: DOI Euclid


[1] M.Z. Garaev and J. Hernández, A note on \(n!\) modulo \(p\), Monatsh. Math. 182 (2017), 23–31. · Zbl 1364.11137
[2] M.Z. Garaev, F. Luca and I. Shparlinski, Catalan and Apéry numbers in residue classes, J. Combin. Theory. 113 (2006), 851–865. · Zbl 1101.11010
[3] V.C. García, F. Luca and J. Mejía, On sums of Fibonacci numbers modulo \(p\), Bull. Aust. Math. Soc. 83 (2011), 413–419. · Zbl 1238.11011
[4] V.C. García, On the distribution of sparse sequences in prime fields and applications, J. Théor. Nombres Bordeaux 25 (2013), 317–329.
[5] A. Glibichuk, Combinatorial properties of sets of residues modulo a prime an the Erdos-Graham problem, Mat. Zametki 79 (2006), 384–395; English transl., Math. Notes 79 (2006), 356–365. · Zbl 1129.11004
[6] Hong Hu and Zhi-Wei Sun, An extension of Lucas’ theorem, Proc. Amer. Math. Soc. 129 (2001), 3471–3478. · Zbl 1077.11502
[7] D.E. Knuth and H.S. Wilf, The power of a prime that divides a generalized binomial coefficient, J. reine angew. Math. 396 (1989), 212–219. · Zbl 0657.10008
[8] F. Luca, D. Marques and P. Stanica, On the spacings between \(C\)-nomial coefficients, J. Number Theory 130 (2010), 82–100. · Zbl 1242.11068
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.