 Below, the size "n" refers to the number of digits of precision at which the function is to be evaluated.It is not known whether O("M"("n") log "n") is the optimal complexity for elementary functions.The best known lower bound is the trivial bound Ω("M"("n")).