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
-
3046 Solvers
-
Test if a Number is a Palindrome without using any String Operations
256 Solvers
-
Back to basics 22 - Rotate a matrix
937 Solvers
-
1240 Solvers
-
Sums of cubes and squares of sums
375 Solvers
More from this Author325
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
