## Show Primitive Recursive

Let f(x) be the sum of the divisors of x if x≠0; f(0)=0 [e.g. f(6) = 1+2+3+6 = 12]. Show that f(x) is primitive recursive.

Hi there; appreciate your help; thanks.