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:
>> dec2base(prod([1 1 2 3 5 8 13 21 34 55]),4)
>> '13103120230200'
For 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.
Solve

Solution Stats

20 Solutions

6 Solvers

Last Solution submitted on Aug 28, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers6

Chris Cleveland George Berken GeeTwo kanna

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!