Fast computation of binomial coefficients

DOI10.1007/S11075-020-00912-XMaRDI QIDQ2220750zbMATH OpenOpenAlexFDO

Authors Leonardo C. Araujo, João P. H. Sansão, Adriano S. Vale-Cardoso

Publication date 25 January 2021

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-020-00912-x

zbMATH Keywords

binomial coefficientnumerical analysisdiscrete Fourier transformfast Fourier transform

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Strategies on the evaluation of binomial coefficients for all integers
• Computing Binomial Coefficients
• The binomial coefficient \(\binom{n}{x}\) for arbitrary \(x\)
• Calculation of binomial and multinomial coefficients by sequences of summations
• Efficient computation for the Poisson binomial distribution

Cites work

• scientific article; zbMATH DE number 1131976 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Computing Binomial Coefficients

Cited in

(2)

• Fast computation of multinomial coefficients
• High-precision arithmetic in mathematical physics

Describes a project that uses

Uses Software

• SumTools
• WolframAlpha
• Octave
• Matlab

This page was built for publication: Fast computation of binomial coefficients

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