In other words, the fibonorial of n, 
, is the product of all Fibonacci numbers from 
to 
.
, is the product of all Fibonacci numbers from to .Given an integer n and a number base b, write a function that calculates the number of trailing zeros of the fibonorial of n when written in base-b.
For example, for 
and 
, the function should return 2, because:
and , the function should return 2, because: >> dec2base(prod([1 1 2 3 5 8 13 21 34 55]),4)
>> '13103120230200'
For and 
, the function should return 1.
and , the function should return 1. >> dec2base(prod([1 1 2 3 5 8 13 21 34 55]),13)
>> '1C4CB080'
--------------------
Hint: As a practice, you may want to solve first, the previous problem: Easy Sequences 78: Trailing Zeros of Factorial Numbers at any Base.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
2425 Solvers
-
Mersenne Primes vs. All Primes
855 Solvers
-
216 Solvers
-
Easy Sequences 2: Trigonometric function with integral input and output
46 Solvers
-
Easy Sequences 9: Faithful Pairs
22 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Note that in addition to global, persistent, java and BigInteger; for, if, case, and switch are forbidden.
Only needs scalar inputs - test cases do arrayfun()s.