[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-devel
Subject:    Re: Algorithm for finding prime numbers
From:       Jost Schenck <uzsnty () uni-bonn ! de>
Date:       2000-02-28 18:14:10
[Download RAW message or body]

On Mon, 28 Feb 2000, Roberto Alsina wrote:
>On Mon, 28 Feb 2000, Wilco Greven wrote:
>
>> Hi,
>> 
>> I am looking for an algorithm with which one can determine the next prime
>> number when you start counting at a certain number. I want to use it in
>> combination with QDict. I need a QDict which can store x elements, so 
>> according to the Qt docs the dictionary should have a size of nextPrime(x). 
>> Does anyone know of such an algorithm or can I use QDict's of any size 
>> without a big loss of speed?
>
>Go to any university library, and get a formula book. Look for the prime
>numbers table. Then get one ;-)

Mmh. Is there something wrong with qt/html/primes.html ? :)
-Jost.

--
Jost Schenck
jost@schenck.de

[prev in list] [next in list] [prev in thread] [next in thread]