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.
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.*
#. 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
-
290 Solvers
-
Find the maximum number of decimal places in a set of numbers
3599 Solvers
-
Polite numbers. N-th polite number.
171 Solvers
-
Convert to Binary Coded Decimal
155 Solvers
-
find "greatest common divisor" of two integer value
200 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
