dc.contributor.author |
Akhyar, Abdul |
|
dc.contributor.author |
Syamsudhuha |
|
dc.contributor.author |
Gemawati, Sri |
|
dc.date.accessioned |
2016-05-23T03:54:20Z |
|
dc.date.available |
2016-05-23T03:54:20Z |
|
dc.date.issued |
2016-05-23 |
|
dc.identifier.other |
wahyu sari yeni |
|
dc.identifier.uri |
http://repository.unri.ac.id/xmlui/handle/123456789/8416 |
|
dc.description.abstract |
A partition of a positive integer is the representation of the positive integer its self
or sums of the other positive integers, while the partition function is the number of
partitions. This article disscusses a simple proof of partition numbers p(5n + 4),
p(7n + 5) and p(11n + 6) consecutively congruent modulo 5, 7, and 11. The proof
for modulo 5 and 7 are carried out via Jacobi identities, while for modulo 11 via
Euler and Jacobi identities. |
en_US |
dc.description.provenance |
Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2016-05-23T03:54:20Z
No. of bitstreams: 1
artikel_Akhyar Akhyar.pdf: 636561 bytes, checksum: 482757519916d9675850e22da08c4271 (MD5) |
en |
dc.description.provenance |
Made available in DSpace on 2016-05-23T03:54:20Z (GMT). No. of bitstreams: 1
artikel_Akhyar Akhyar.pdf: 636561 bytes, checksum: 482757519916d9675850e22da08c4271 (MD5) |
en |
dc.description.sponsorship |
Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau |
en_US |
dc.language.iso |
en |
en_US |
dc.subject |
Partition number |
en_US |
dc.subject |
modulo |
en_US |
dc.subject |
generating function |
en_US |
dc.subject |
Euler and Jacobi identities |
en_US |
dc.title |
PARTISI BILANGAN p(5n + 4); p(7n + 5) DAN p(11n + 6) SECARA BERTURUT-TURUT KONGRUEN MODULO 5, 7 DAN 11 |
en_US |
dc.type |
student Paper Post Degree |
en_US |