An integer is digitally divisible if both of the following conditions are fulfilled:
(a) None of its digits is zero;
(b) It is divisible by the sum of its digits
e.g. 322 is digitally divisible. Show that there are infinitely many digitally divisible integers. inductionnumber theory unsolvednumber theory