Legendre's formula for the highest prime exponent of the highest prime factor of the factorials

[Stephen Crowley]

Dear Flint Community,

Does Flint have an implementation of Legendre's formula for the prime factorization of factorials? Specifically, the formula \( v_p(n!) = \sum_{k=1}^{\infty} \left\lfloor \frac{n}{p^k} \right\rfloor \), where \( v_p(n!) \) denotes the exponent of the highest power of a prime \( p \) dividing \( n! \). If not, could you provide guidance on how to efficiently implement this using Flint?

Thanks in advance,

Stephen