However, in the end the result of this procedure turns out to be quite trivial from a mathematical perspective: “It actually merely leads to a simplification of the method known as the “Sieve of Eratosthenes” already being practiced for more than 2000 years” (Ehrenfels 1922, 48). The method of the sieve consists in identifying and then eliminating all divisible numbers by generating them from multiplications of primes. If one wants to find all the prime numbers between 0 and 100, one would proceed by striking all multiples of two, then all multiples of three, etc. until only the primes remain. Ehrenfels’ approach shortens the process by avoiding repeated strikings, as would happen e.g. with 6 as multiple of both 2 and 3 (Ehrenfels 1922, 49). As Simons (1986, 112) argues, this is merely computationally faster than the traditional method of the sieve of Eratosthenes (but slower than other methods, as experimentally verified by Simons 1988, 12), but not a substantially new algorithm.