Minimal Algorithm of Fibonacci Numbers

How to print with Java Fibonacci numbers with 50 iterations. The Fibonacci sequence is one of the most famous formulas in mathematics. Each number in the sequence is the sum of the two numbers that precede it. So, the sequence goes: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. The mathematical equation describing it is Xn+2 = Xn+1 + Xn. Many sources claim it was first discovered or “invented” by Leonardo Fibonacci. The Italian mathematician, who was born around A.D. 1170, was originally known as Leonardo of Pisa, said Keith Devlin, a mathematician at Stanford University. Only in the 19th century did historians come up with the nickname Fibonacci (roughly meaning, “son of the Bonacci clan”), to distinguish the mathematician from another famous Leonardo of Pisa, Devlin said.

    int f1=1,f2=1,acc=0,n=0; while(n<50){ acc=f1+f2; System.out.println(acc); f1=f2; f2=acc; n++; }

1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 Please read this! https://science.howstuffworks.com/math-concepts/fibonacci-nature.htm FORMULA FONDAMENTALE Many sources claim it was first discovered or “invented” by Leonardo Fibonacci. The Italian mathematician, who was born around A.D. 1170, was originally known as Leonardo of Pisa, said Keith Devlin, a mathematician at Stanford University. Only in the 19th century did historians come up with the nickname Fibonacci (roughly meaning, “son of the Bonacci clan”), to distinguish the mathematician from another famous Leonardo of Pisa, Devlin said. With his Liber Abaci (1202), the Italian mathematician Leonardo da Pisa, known as Fibonacci, was one of the first scholars to introduce the decimal numeric system (called in the book “modus indorum”, since it was originally used by Indian mathematicians). The Fibonacci sequence is present in nature, for example in the formation of snail shells. EXAMPLES: Until the 19th century, this sequence was not given any importance, until it was discovered that it can be applied, for example, in probability calculations, in the golden section, and in the golden triangle. Fibonacci numbers are also found in nature, for example in the arrangement of leaves (see drawing above). In many trees, choosing a leaf on a stem and assigning it the number “0”, counting the number of leaves until you reach one perfectly aligned with the leaf “0”, you will probably find a Fibonacci number. Also, the petals of many flowers are a Fibonacci number. The Pisan mathematician is also credited with the introduction of Arabic numerals in Italy. How to print Fibonacci in a recursive manner? class fibonacci { static int fib(int n) { if (n <= 1) return n; return fib(n-1) + fib(n-2); }

public static void main (String args[]) { int n = 9; System.out.println(fib(n)); } 

https://introcs.cs.princeton.edu/java/23recursion/Fibonacci.java.html Fibonacci with scratch in Italian for my science students