Fibonacci software/ freeware?
408106
http://www.stockta.com\nuse Fibonacci ABC tool or Fibs analysis tool\n\nAlso the book The New Fibonacci Trader comes with a software cd on the back cover.\n\nsome features:\nFibonacci Summation Series: to capture the rhythm of annual market swings \nCorrections and extensions: trading with and against the main trend \nPHI-channels: as indicators for market trend changes \nPHI-ellipses: to identify underlying structures of price moves \nPHI-spirals: to identify trend reversals in the market \nFibonacci time goal analysis: that use the ratios 0.618, 1.000, and 1.618 to anticipate the exact day, in time and price, a trend will change direction. \n\nhttp://www.amazon.com/gp/product/0471419109/104-0925762-6490333?v=glance&n=283155
33456
lotus is an older program. excel is best. but annoying when it comes to formulas.
327249
Use the calculator on your computer...
88080
there is one you can use for A LITTLE BIT of math/algebra. it's www.algebrasolutions.com
1182452
Leonardo Pisano Fibonacci 1170 – 1250 \nFibonacci series, Introduced decimal system ( Liber abaci which means "The Book of Calculations" . There area few more but even that is impressive http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/fib.html  http://www-history.mcs.st-and.ac.uk/Mathematicians/Fibonacci.html \nVery little was documented during the period encompassing 6-12 centuries in Europe http://en.wikipedia.org/wiki/History_of_science_in_the_Middle_Ages
682202
I use one called ClamWin. But there are a ton of choices, go to this URL:\n\nhttp://www.econsultant.com/i-want-freeware-utilities/index.html
74602
The Fibonacci numbers form a sequence defined recursively by:\n\nF(n)= 0 if n = 0;\n      1 if n = 1;\n      F(n-1)+F(n-2) if n > 1.\n\nIn other words: one starts with 0 and 1, and then produces the next Fibonacci number by adding the two previous Fibonacci numbers. The first Fibonacci numbers for n = 0, 1, … are\n\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, …\n\nThe earliest known reference to Fibonacci numbers is contained in a book on meters by an Indian mathematician named Pingala called Chhandah-shastra (500 BC). As documented by Donald Knuth in The Art of Computer Programming, this sequence was described by the Indian mathematicians Gopala and Hemachandra in 1150, who were investigating the possible ways of exactly bin packing items of length 1 and 2.\n\nAs was pointed out by Johannes Kepler, the ratio of consecutive Fibonacci numbers, that is:\n\nF(n+1)/F(n),\n\nconverges to the golden ratio φ (phi).
237821
Fibonacci:\n\npublic class Example\n{\n    public static int Fibonacci(int n)\n    {\nint previous = -1;\nint result = 1;\nfor (int i = 0; i <= n; ++i)\n{\n    int sum = result + previous;\n    previous = result;\n    result = sum;\n}\nreturn result;\n    }\n}\n\nFor factorial use the same but instead of:\n\n{\n    int sum = result + previous;\n    previous = result;\n    result = sum;\n}\n\nuse\n\n{\n    int fac = result * previous;\n    previous = result;\n    result = fac;\n}
42408
Something that calculates numbers in rapid succession.
562084
http://mathworld.wolfram.com/EulerNumber.html
29226
Always Google! E.g., http://www.howardcc.edu/math/calculator/ti83frame.htm
541643
If you have a works program by MS, Corel you can make your own. \nMicrosoft Works, Microsoft Word. I don't know if the others have them but I imagine they do.
472561
http://www.calculator.com/
615205
ever hear of a calculator?
314033
I have seen dozens of math sites on the web, and yes not all are free, but they are there.  Google it out.
816568
try http://www.coolmath4kids.com/
1142175
One property of fibonacci series is the following\n Take two consecutive fibonacci numbers and apply to them the euclidean division algorithm.\nThen they will get the maximum number of steps( or the maximum number of divisions).\n So a computer will require more time for division of big numbers if you use euclidean division algorithm.