Well that's pretty simple. A Fibonacci isn't exactly a thing it's a sequence. To be more exact it isn't a Fibonacci it's a Fibonacci Number Sequence, which is exactly what it sounds like... an interesting number sequence.
What's so important about this number sequence?
That too is rather simple. This number sequence happens to be a very interesting piece of nature. It was originally used to calculate the growth rate of rabbits. Also, it grows logarithmically. The problem is not with the rabbits, but with calculating a large Nth of the number.
This is where programming comes into play. The use of a computer to calculate large numbers fast is vital in determing any large value in the Fibonacci sequence.
However, the larger the number, the slower the calculation time. This is where we, the programmers, come in. The three and a half students, scratch that, five, no, seven, no, NINE students that are working on creating a program that can calculate these large numbers as quickly as possible using a computer.
Original Team members involved:
David P. Allen, Soph
Chris S. Blotzke, Frosh
Owen B. Keefer, Grad
Andrew J. Grimberg, Frosh
Expanded Team members:
Joseph C. Anderson, Soph
Matt C. Anderson, Soph
Rocky S. Downs, Soph
Andrew D. Nierman, Jr
Ken A. Perrine, Frosh
Or for more information about these people and their role in the process we've undergone try this.
Computer Science Advisors:
Dr. Larry Edison, Retired
Dr. Ken Blaha, Professor
Dr. Jim Brink, Professor