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=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.unit0.net!peer02.am4!peer.am4.highwinds-media.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!buffer1.nntp.dca1.giganews.com!nntp.earthlink.com!news.earthlink.com.POSTED!not-for-mail NNTP-Posting-Date: Sat, 09 Dec 2017 10:43:11 -0600 From: Dennis Lee Bieber Newsgroups: comp.lang.ada Subject: Re: language defined list of prime numbers Date: Sat, 09 Dec 2017 11:43:11 -0500 Organization: IISS Elusive Unicorn Message-ID: References: <1afe0b2c-eb71-4197-9bbb-b78532e4cd7e@googlegroups.com> User-Agent: ForteAgent/8.00.32.1272 X-No-Archive: YES MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Usenet-Provider: http://www.giganews.com NNTP-Posting-Host: 108.68.177.219 X-Trace: sv3-v83M6MhTqpmo7cz5slav8okECOcvfrUHhKfFW+oMy3NoKxbPR5fy4v5yPymLAnXhsF6fVYmR7iASfUr!/l6WL1jyez26Z/dcUw7c2o2Vpflfuow1dXea1UCRtdt6VlFR79tc2FPiH/TRoz65sMpYoi/S0Ru9!N7E6AVGySu9CxYHZB62O0EEx9+6E X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 1940 X-Received-Body-CRC: 3346385835 X-Received-Bytes: 2152 Xref: reader02.eternal-september.org comp.lang.ada:49439 Date: 2017-12-09T11:43:11-05:00 List-Id: On Sat, 9 Dec 2017 07:57:52 -0800 (PST), Mehdi Saada <00120260a@gmail.com> declaimed the following: >Does the norm compel compilers to provide a descent list of prime numbers ? I can't find "prime" in the RM. "Prime number" is a concept just like "odd" and "even". No compiler that I know of provides such as an inherent data type -- they must be determined at run-time via an algorithm you have to provide. For "odd"/"even" that algorithm is rather simple, using a simple modulo 2 operation. For "prime number" the algorithm becomes time consuming unless one caches results for future use -- Google "Sieve of Eratosthenes" -- the larger the prime number, the more time it takes to compute it. -- Wulfraed Dennis Lee Bieber AF6VN wlfraed@ix.netcom.com HTTP://wlfraed.home.netcom.com/