Xref: utzoo sci.math:16679 comp.lang.c:38195
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!caen!news.cs.indiana.edu!arizona.edu!arizona!dave
Newsgroups: sci.math,comp.lang.c
Subject: Re: fibonacci Numbers
Message-ID: <1383@caslon.cs.arizona.edu>
From: dave@cs.arizona.edu (Dave Schaumann)
Date: 12 Apr 91 22:00:23 GMT
Followup-To: sci.math
References: <1991Apr12.051844.15063@milton.u.washington.edu>
Organization: U of Arizona CS Dept, Tucson
Keywords: Fibonacci Numbers - routines?
Lines: 16

In article <1991Apr12.051844.15063@milton.u.washington.edu> amigo@milton.u.washington.edu (The Friend) writes:
>     Can someone send me source code for a routine to calculate 
>Fibonacci numbers to _x_ (x being input from user)? Additionally it'd
>be great if this found the PRIME numbers in the set. It could print its
>results as it went through (if that makes it any easier).

This sounds a lot like a freshman-level programming assignment to me...

Consider:
	o The definition of the Fibonacci sequence is usually no more than
	  one step of translation away from a working algorithm.
	o Finding prime numbers may be a little harder, but not much.

-- 
Dave Schaumann      | We're so sorry, Uncle Albert.  But the kettle's
dave@cs.arizona.edu | on the boil, and we're so *easly* called away...