## Search

## Login

## New

- Fibonacci Calculator
- Up to
*F*, at high speed._{50000} - MFSP User Accounts
- Extra features, no extra charge!

## Tools, Problems & More

- Problem of the Week
- Horizontal and Vertical (6/6/10)
- Primality Checker
- Pi Calculator
- Forum Registration

# Math for Smarty Pants

## A site for people that **think** they are math smarty pants and those that are.

### We provide online mathematical tools, problems, and much more. A **problem database** is also in the works, as well as user accounts to allow uploading of files and editing of the problems by anyone.

## Mathematical Tools & More

**Posted on Tuesday, Oct 2nd, 2007 at 8:24 PM**

Recently, the Fibonacci Calculator was released. This PHP script can calculate the *n*^{th} Fibonacci number at high speed, for all *n* below 50,000. This script, in fact, does not use a recursive formula, or even an implementation of Binet's. I've found that scripts based on those two tend to run much more slowly as *n* grew, whereas a certain loop (the source can be found here) ran far faster. However, this calculator, along with the Primality Tester, are only the beginning. I am currently working on an advanced PHP expression evaluator. It will be able to handle expressions like:

2^10000 10000! 2^(phi+pi^(e-log(2*sin((5*pi)/7)))) sqrt(f(10)^77) (phi^101)/(phi^202 - (-1)^101) phi^(z(pi)) 273^273 sin(cos(tan(sec(csc(cot(x))))))

In addition, it will have a huge array of functions: some to test for primality, for the prime factorization of the number, for the geometric/arithmetic/harmonic/root means, and much more. The code, once the evaluator is finished, will be available for download by anyone... *Read more →*