Answered step by step
Verified Expert Solution
Question
1 Approved Answer
i need help putting this into mathematica code plz, im having trouble getting output A frog's trip Problem 416 A row of n squares contains
i need help putting this into mathematica code plz, im having trouble getting output
A frog's trip Problem 416 A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited For example, F(1, 3) = 4, F(1,4) = 15, F(1, 5) = 46, F(2, 3)-16 and F(2, 100) mod 10. 429619151 Find the last 9 digits of F(10, 1012 A frog's trip Problem 416 A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited For example, F(1, 3) = 4, F(1,4) = 15, F(1, 5) = 46, F(2, 3)-16 and F(2, 100) mod 10. 429619151 Find the last 9 digits of F(10, 1012Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started