The test consists in comparing a number (p?) of which one wants to establish the primality or not, with a composite number (which I call (L)) which contains the majority of possible prime numbers; it does not recognize prime numbers but composite numbers. This is obviously a test limited to the prime numbers present in (L). In this review [v2] I highlight a further possibility that the test offers, it is a rough factoring that seems to me interesting for the speed of execution. Note: In version [v2] I wrote that (L) can be bigger than (p?); in the case in which (L) is greater than (p?) it does not always distinguish a number composed of a prime number and I obtain a fraction of the type 1 / n.