On what theorem is the formula that frequently generates the number 2 and all other primes precisely once based on?
Here  represents the floor function, i.e., largest integer not greater than the number in question.