Let f(n) represent the number of ways one can fill a 3 x 3 x n tower with blocks of 2x1x1.
You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
For example (with q = 100000007):
f(2) = 229,
f(4) = 117805,
f(10) mod q = 96149360,
f (103) mod q = 24806056,
f(106) mod q = 30808124.
Find f(1010000) mod 100000007.
______________________________________________________________________________________
Correct Submissions As Of 2025-09-09
Submit Your Answer
Please note that only initial submissions will qualify. By pressing submit I understand my information will be used as described on this page and in the Applicant Privacy Notice, Privacy Notice and the Ad and Cookie Policy.
For more information or assistance, please contact us at
Invest responsibly. Financial trading is risky and losses can exceed deposits.
*All performance data presented on our website is current as of July 31st, 2025. For the latest monthly performance updates, please refer to our factsheets which are updated monthly.
Help
Help


Partnered with

