Exact Recurrent Computations with Integers

n

0

Exact computations with large integers are possible, simple, efficient, and reliable with Mathematica. Download the notebook, try the calculation, and check it for yourself doing it by hand.

You can change 20 to 100 or 500 if you want….

The sequence

u

is defined by its first term

u[0]

and a computational process that allows the computation of

u[1]

,

u[2]

, etc.:

u[n]=1000u[n-1]+1

.

Once you have computed

u[p]

for some

p

, then all values from 0 to

p

are remembered by Mathematica.