we propose to search for prime numbers which differ from

six.

les numbers $5$ and $11$ because $11-6=5$

We can define pairs, for example: $(511),(713),(1117)$

triples, for example: $(51117),(71319),(172329)$

quadruplets: $(5111723),(11172329)$

Write a program that searches for pairs, triples,

quadruplets and lower quintuplets

a given limit as input, display

$5$ the last of each

species

What do you notice for the quintuplets?.

We will subsequently try to parallelize with OpenMP the loop of search for prime numbers.

What is the gain$/$processors

Same question on the parallelization of the counting of pairs, triplets, etc.

What would you suggest to use fork$()$ instead of OpenMP?