Abstract:
This article discusses the recursive pristine numbers. Pristine numbers can be de-
termined by recursive divisors function. Recursive divisor function is development
of divisor function generally. Using the recursive rule method in recursive divisor
function, then it can determined the pristine numbers form. A number is pristine if
a(n) = n. The result of pristine numbers form are 2c; 2cq; 2cqr; 2cq2; 2cqrs; 2cq2r.
