DSpace Repository

# REKURSIF BILANGAN PRISTINE

 dc.contributor.author Melina, Yuni dc.date.accessioned 2022-03-15T04:34:41Z dc.date.available 2022-03-15T04:34:41Z dc.date.issued 2021-11 dc.identifier.other wahyu sari yeni dc.identifier.uri https://repository.unri.ac.id/handle/123456789/10510 dc.description.abstract This article discusses the recursive pristine numbers. Pristine numbers can be de- en_US 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. dc.description.provenance Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2022-03-15T04:34:41Z No. of bitstreams: 1 Yuni Melina_compressed.pdf: 182023 bytes, checksum: 050b64386aa37fe89084cee7e8b0235f (MD5) en dc.description.provenance Made available in DSpace on 2022-03-15T04:34:41Z (GMT). No. of bitstreams: 1 Yuni Melina_compressed.pdf: 182023 bytes, checksum: 050b64386aa37fe89084cee7e8b0235f (MD5) Previous issue date: 2021-11 en dc.description.sponsorship Jurusan Matematika en_US Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau dc.language.iso en en_US dc.publisher perpustakaan UR en_US dc.subject Recursive divisors function en_US dc.subject recursive relation en_US dc.subject pristine numbers en_US dc.title REKURSIF BILANGAN PRISTINE en_US dc.type Article en_US
﻿