From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM,T_HK_NAME_FM_MR_MRS autolearn=no autolearn_force=no
	version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!toylet.eternal-september.org!.POSTED!not-for-mail
From: "Mr. Man-wai Chang" <toylet.toylet@gmail.com>
Newsgroups: comp.lang.ada
Subject: Re: language defined list of prime numbers
Date: Sun, 10 Dec 2017 01:23:00 +0800
Organization: Hung Hom, Kowloon, Hong Kong
Message-ID: <p0h65i$v3r$1@toylet.eternal-september.org>
References: <1afe0b2c-eb71-4197-9bbb-b78532e4cd7e@googlegroups.com>
 <p0h2d7$22j$3@toylet.eternal-september.org>
 <f4207ff1-72f0-4553-8b6f-cebfcbaea11f@googlegroups.com>
 <p0h5jq$qm9$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 9 Dec 2017 17:22:59 -0000 (UTC)
Injection-Info: toylet.eternal-september.org;
 posting-host="21afb5939229648eca5f05777b1a997a";
	logging-data="31867"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1/oJLcGDmcwmJ4XxXQRKJiw"
User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:45.0) Gecko/20100101
 Thunderbird/45.8.0
In-Reply-To: <p0h5jq$qm9$1@dont-email.me>
Cancel-Lock: sha1:dzuTyBlCAOyDlvo6NbutvZrI/6c=
Xref: reader02.eternal-september.org comp.lang.ada:49442
Date: 2017-12-10T01:23:00+08:00
List-Id: <comp.lang.ada>

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