Problem 56393. Easy Sequences 77: Powers of Fibonacci Numbers

Given integers x and n, we are asked to evaluate the following function: . That is, P equals x raised to the power of the n-th Fibonacci number. We define as follows: and for .
Example: .
Please reduce the output, modulo .
HINT: One solution is already shown, however java math is not allowed.

Solution Stats

80.0% Correct | 20.0% Incorrect
Last Solution submitted on Feb 19, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers3

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!