When will they learn

[BotXXX]

vtu@home boinc project

The aim of the project is to count the quantity of prime numbers in a large interval. The worst algorythm is used, as we need a lot of computing hours and many workunits. The client side application gets the beggining and the end numbers of the interval and divides every number from this interval by every number from 1 to it self. As we know there are better algorythms:

1. To divide the current number only by every number from 1 to sqrt(itself);
2. To divide the current number only by every known prime number from 1 to sqrt(itself); This one is the best known algorythm. In some modifications division operation can be changed into some set of sum operations.

Jippie, trialdivide again to the rescue :(

[akruppa]

And for counting primes... .

Alex

[jasonp]

Originally Posted by BotXXX

Jippie, trialdivide again to the rescue :(

I replied with a link to wikipedia. Let's see if anything changes.

jasonp

[jasonp]

Originally Posted by jasonp

I replied with a link to wikipedia. Let's see if anything changes.

The comment was deleted not long after I posted it. So the current project is once again just a test, and the project author has better things to do than make good use of volunteers' time.

jasonp

[jasonp]

Originally Posted by jasonp

The comment was deleted not long after I posted it. So the current project is once again just a test, and the project author has better things to do than make good use of volunteers' time.

Correction: my suggestion was considered.

jasonp