Although, formally, mathematics is clear that a function is a single-valued object, mathematical practice is looser, particularly with n-th roots and various inverse functions. In this paper, we point out some of the looseness, and ask what the implications are, both for Artificial Intelligence and Symbolic Computation, of these practices. In doing so, we look at the steps necessary to convert existing texts into (a) rigorous statements (b) rigorously proved statements. In particular we ask whether there might be a constant "de Bruijn factor" [18] as we make these texts more formal, and conclude that the answer depends greatly on the interpretation being placed on the symbols.