Re: prime numbers searcher

[SMcNeill]

Isn’t the finding of superprimes as simple as storing the primes in an array, and then just referencing that array with the contents of the array?


An array of primes (start at P(1) if you don’t consider 1 a prime.)
P(0) = 1
P(1) = 2
P(2) = 3
P(3) = 5
P(4) = 7
P(5) = 11

And the superprimes:
P(P(0)) = 2
P(P(1)) = 3
P(P(2)) = 5
P(P(3)) = 11

Once you have your array (as I generated earlier), just reference it’s index with itself to see your super primes.

[TempodiBasic]

Hi Steve I can agree

Posted by: TempodiBasic
« on: August 19, 2019, 07:49:36 PM
Thinking that the work of search primes is done by Steve and Ron77 and you Bplus
I simply can use the calculated list of prime numbers to work on it and find SuperPrime numbers.
;)
In this case it is just a selection of a list on itself using as index the single prime number in sequence.

Yep, not so difficult.

I'm posting again because I've on going about the translation of an algorithm found as exercise, to see how is under dust my C/C++ of time of DOS.
So I have learnt more about Ubound and Lbound and how to get the total of elements in an array ....
(thanks for tip in the other thread).

[bplus]

Isn’t the finding of superprimes as simple as storing the primes in an array, and then just referencing that array with the contents of the array?


An array of primes (start at P(1) if you don’t consider 1 a prime.)
P(0) = 1
P(1) = 2
P(2) = 3
P(3) = 5
P(4) = 7
P(5) = 11

And the superprimes:
P(P(0)) = 2
P(P(1)) = 3
P(P(2)) = 5
P(P(3)) = 11

Once you have your array (as I generated earlier), just reference it’s index with itself to see your super primes.

Ha yeah, and we did this a page or so ago! But TempodiBasic has some sort of C++ code that he insists on translating ;)