Cody Problem 44068 asked us to count the trailing zeros in a factorial. This problem deals with the primorial. If
is the nth prime number, then the primorial
# is the product of the prime numbers up to and including
. For example, if n = 5, then
# =
= 2310, which has one trailing zero.
Count the trailing zeros in the primorial
#. Because primorials become large quickly, for large n it helps to derive a formula for the number of trailing zeros.*
Please make your code general because I might add more tests later.
See also Cody Problems 46057 "Find the last non-zero digit in a primorial" and 46060 "Identify primorial primes".
*;-)
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers84
Suggested Problems
-
21540 Solvers
-
318 Solvers
-
296 Solvers
-
Matrix indexing with two vectors of indices
781 Solvers
-
Create a Multiplication table matrix...
696 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!