CD Skripsi
Bilangan Pristine
This nal project discusses the pristine numbers. Pristine numbers can be
determined by recursive divisors function. Using the recursive rule method in
recursive divisor function, then it can be determined the pristine numbers form.
A number is pristine if a(n) = n where a(n) recursive divisors function of n.
The result of pristine numbers form are 2c; 2cq; 2cqr; 2cq2; 2cqrs; 2cq2r. This is
a review of some parts of Fink [http://arXiv:2008.10398v1 [math.NT], 24 Aug
2020, 1-12].
Keywords: The binomial theorem, recursive divisors function, recursive rela-
tion, congruences
Tidak tersedia versi lain