A note on Fibonomial coefficients (Q2422595)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7068527
Language Label Description Also known as
default for all languages
No label defined
    English
    A note on Fibonomial coefficients
    scientific article; zbMATH DE number 7068527

      Statements

      A note on Fibonomial coefficients (English)
      0 references
      0 references
      20 June 2019
      0 references
      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\).
      0 references
      Fibonacci numbers
      0 references
      sum-product phenomenon
      0 references

      Identifiers