Problema matematico

[ABG]

@davidefa

if I'm not wrong ai2 uses 64 bits for an integer, which is enough for everyday tasks ; - )

See

Fibonacci fun with matrix exponentiation

The Fibonacci sequence starts with 1,1,2,3,5,8,13,... and has the property that F(n) = F(n-1) + F(n-2). What if you want to see how far you can follow it, for example to n=10,000? [image] The result has 2,090 digits. Luckily, AI2 can handle large exact numbers. But can Ai2 handle inefficient algorithms? Here's a beautifully simple recursive Fibonacci calculator, in a draggable procedure you can pull into your projects: [Fibonacci_recursive_simple] It's called recursive because it calls…

for an example of AI2 exact integer math, with unlimitted digits.