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 Solvers85
Suggested Problems
-
How to find the position of an element in a vector without using the find function
2823 Solvers
-
Change the sign of even index entries of the reversed vector
664 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
756 Solvers
-
Converts numbers into characters
2183 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
