The Formula
Let n ≥ 1 be an integer. The prime decomposition of n! is given by
where
and the brackets represent the floor function. Note that the former product can equally well be taken only over primes less than or equal to n, and the latter sum can equally well be taken for j ranging from 1 to logp(n), i.e :
Note that, for any real number x, and any integer n, we have:
which allows one to more easily compute the terms sp(n).
The small disadvantage of the De Polignac's formula is that we need to know all the primes up to n. In fact,
where is a prime-counting function counting the number of prime numbers less than or equal to n
Read more about this topic: De Polignac's Formula
Famous quotes containing the word formula:
“Given for one instant an intelligence which could comprehend all the forces by which nature is animated and the respective positions of the beings which compose it, if moreover this intelligence were vast enough to submit these data to analysis, it would embrace in the same formula both the movements of the largest bodies in the universe and those of the lightest atom; to it nothing would be uncertain, and the future as the past would be present to its eyes.”
—Pierre Simon De Laplace (1749–1827)
“In the most desirable conditions, the child learns to manage anxiety by being exposed to just the right amounts of it, not much more and not much less. This optimal amount of anxiety varies with the child’s age and temperament. It may also vary with cultural values.... There is no mathematical formula for calculating exact amounts of optimal anxiety. This is why child rearing is an art and not a science.”
—Alicia F. Lieberman (20th century)