Problem 56428. Easy Sequences 79: Trailing Zeros of Fibonorial Numbers at any Base
The fibonorial of an integer n is defined as follows:
where: is the i-th Fibonacci number ( and for ).
In other words, the fibonorial of n, , 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:
For and , the function should return 1.
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 CommentsShow comments
Problem Recent Solvers3