Skip to content

elaqqad/HackerRank

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Computing binomial coefficients nCr modulo a composite number

This program uses the generalisation of Lucas's theorem to composite numbers in order to compute the binomial coefficients modulo that number

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages