Re: language defined list of prime numbers

["Mr. Man-wai Chang" <toylet.toylet@gmail.com>]

On 10/12/2017 1:13 AM, Jeffrey R. Carter wrote:
> On 12/09/2017 06:05 PM, Mehdi Saada wrote:
>> I might not get what you mean. I just supposed it should mandatory to
>> provide a list of all prime numbers between 0 and let's say, 5000 at
>> least, in the form of a function returning the next prime after N.
>> I have to write a function to simplify fractions, and I very doubt the
>> teacher wants us at this point, to implement an whole algorithm to
>> find prime numbers (up to the squared root), just for that.
>
> To simplify fractions, all you need is the GCD algorithm.
>

How about using the algorithm to calculate all prime numbers then store 
them in a table? That should solve the efficiency problem. How about 
pre-loading the table into memory? :)

-- 
   @~@   Remain silent! Drink, Blink, Stretch! Live long and prosper!!
  / v \  Simplicity is Beauty!
/( _ )\ May the Force and farces be with you!
   ^ ^   (x86_64 Ubuntu 9.10)  Linux 2.6.39.3
不借貸! 不詐騙! 不援交! 不打交! 不打劫! 不自殺! 請考慮綜援 (CSSA):
http://www.swd.gov.hk/tc/index/site_pubsvc/page_socsecu/sub_addressesa