Let P(x) denote the product of all (decimal) digits of a natural number x. For any positive integer x1, define the sequence (xn) recursively by xn+1=xn+P(xn). Prove or disprove that the sequence (xn) is necessarily bounded. number theorySequencerecurrence relationboundedunboundedDigitsproduct of digits