Modular periodicity of binomial coefficients (Q2488831): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 08:20, 5 March 2024

scientific article
Language Label Description Also known as
English
Modular periodicity of binomial coefficients
scientific article

    Statements

    Modular periodicity of binomial coefficients (English)
    0 references
    0 references
    16 May 2006
    0 references
    The author's main result is the following: Let \(p\) be a prime. Let \(h,k\) be positive integers with \(h\not\equiv 0\pmod p)\) and \(k\geq 5\). Suppose that \(h\) is not too large compared to \(k\), and that \[ {k\choose i+h}\equiv(-1)^h{h\choose i}\pmod p \] for \(0\leq i\leq k-h\). Then \(k+1\) is a power of \(p\). As a consequence, the author obtains a result concerning multiplicative subgroups of a finite field.
    0 references
    0 references
    finite fields
    0 references
    multiplicative subgroups
    0 references