  We introduce and consider a certain probability question involving elementary
number theory and the likelihood that a fixed prime will appear in a certain
recursively defined factorization of an integer. We derive several convergent
infinite products for this probability, which we are unable to simplify to
obtain closed form solutions. However, we are able to implement these formulas
in the development of algorithms to obtain arbitrarily close rigorous bounds on
the probabilities in question.
