Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/648
DC FieldValueLanguage
dc.contributor.authorAndrejić, Vladicaen_US
dc.contributor.authorBostan, Alinen_US
dc.contributor.authorTatarevic, Milosen_US
dc.date.accessioned2022-08-13T16:55:05Z-
dc.date.available2022-08-13T16:55:05Z-
dc.date.issued2021-
dc.identifier.issn00200190en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/648-
dc.description.abstractWe present improved algorithms for computing the left factorial residues !p=0!+1!+…+(p−1)!modp. We use these algorithms for the calculation of the residues !pmodp, for all primes p up to 240. Our results confirm that Kurepa's left factorial conjecture is still an open problem, as they show that there are no odd primes p<240 such that p divides !p. Additionally, we confirm that there are no socialist primes p with 5<p<240.en
dc.relation.ispartofInformation Processing Lettersen
dc.subjectFast algorithmsen
dc.subjectKurepa's conjectureen
dc.subjectLeft factorialen
dc.subjectSocialist primesen
dc.subjectSoftware design and implementationen
dc.titleImproved algorithms for left factorial residuesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ipl.2020.106078-
dc.identifier.scopus2-s2.0-85097793331-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85097793331-
dc.contributor.affiliationGeometryen_US
dc.description.rankM23en_US
dc.relation.volume167en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptGeometry-
crisitem.author.orcid0000-0003-3288-1845-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

3
checked on Nov 15, 2024

Page view(s)

17
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.