This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
This article has been automatically rated by a bot or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the |auto= parameter.
Surely there's a formula to calculate the number of trailing zeroes for n! in arbitrary bases; I can already figure out what's probably right, though not checked and requiring confirmation for edge cases: t(n, b) would be equal to the minimum of that-expression-you-see-there with 5 replaced with each prime factor of b, where the terms are integer-divided by the multiplicity of the prime. Or something like that.
Perhaps such a formula should be added to the article? I can't be the first one to think this out, and it seems like a useful bit of knowledge (or, well, just as useful as the factorial formula in the first place). Hppavilion1 (talk) 01:31, 21 March 2017 (UTC)[reply]
