Project Euler 100 - Arranged Probability

Official link: https://projecteuler.net/problem=100

Thought Process

We can use Dario Alpern’s Generic Two integer variable equation solver to produce the following recursive equations:

bn+1 = 3 ⁢bn + 2 ⁢tn - 2 ⁢

tn+1 = 4 ⁢bn + 3 ⁢tn - 3 ⁢

With initial condition b = 15, t = 21 given to us

Interactive Code

Enter a number (yourinput)

Code will output the anwser for yourinput number of discs