Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers

{{article.zuoZheEn}}

PDF(157 KB)
PDF(157 KB)
Front. Math. China ›› 2015, Vol. 10 ›› Issue (1) : 69-89. DOI: 10.1007/s11464-014-0394-2
RESEARCH ARTICLE

Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers

  • {{article.zuoZheEn}}
Author information +
History +

Highlights

{{article.highlightEn}}

Abstract

{{article.abstractEn}}

Author summary

{{article.authorSummayEn}}

Keywords

Cite this article

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Math. China, 2015, 10(1): 69‒89 https://doi.org/10.1007/s11464-014-0394-2

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}
PDF(157 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉