Proof of a conjecture of Mircea Merca

DOI10.1016/J.JNT.2014.08.007MaRDI QIDQ472860zbMATH OpenOpenAlexWikidataFDO

Authors Victor J. W. Guo

Publication date 20 November 2014

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.4755

zbMATH Keywords

binomial coefficientsmultinomial coefficientsFine's formula

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20)

Abstract: We prove that, for any prime $p$ and positive integer $r$ with $p^r>2$, the number of multinomial coefficients such that ${\displaystyle }$ {kchoose k_1,k_2,ldots,k_n}=p^r,quad ext{and}quad k_1+2k_2+cdots+nk_n=n, ${\displaystyle }$ is given by ${\displaystyle }$ delta_{p^r,,k}left(leftlfloorfrac{n-1}{p^r-1} ight floor -delta_{0,,n�mod p^r} ight), ${\displaystyle }$ where $delt{a}_{i,j}$ is the Kronecker delta and $lfloorxfloor$ stands for the largest integer not exceeding $x$. This confirms a recent conjecture of Mircea Merca.

Recommendations

• On a problem of Mircea Merca
• On multinomial coefficients modulo a prime
• Publication:3033833
• Multinomial coefficients modulo a prime
• scientific article; zbMATH DE number 722337

Cites work

• New upper bounds for the number of partitions into a given number of parts

Cited in

(5)

• scientific article; zbMATH DE number 7306641 (Why is no real title available?)
• \(p\)-adic valuations of some sums of multinomial coefficients
• Inequalities involving the generating function for the number of partitions into odd parts
• Padovan numbers as sums over partitions into odd parts
• On a problem of Mircea Merca

This page was built for publication: Proof of a conjecture of Mircea Merca

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472860)