Research ArticleOpen AccessGoogle Scholar indexed
The Fractal and the Recurrence Equations Concerning the Integer Partitions
School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin, China
- 1 School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin, China
Advances in Pure Mathematics·Volume 08 (2018)·Pages 624–630·Published 20 June 2018·DOI10.4236/apm.2018.86036
Copy link · social · email
Abstract
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions , furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the pentagonal number theorem.
KeywordsFractalInteger PartitionPentagonal Number TheoremRecurrence Equations
- Mandelbrot, B.B. (1982) The Fractal Geometry of Nature. W. H. Freeman Co Ltd., New York, 3-26.
- Schroeder, M.R. (2009) Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. Dover Publications Inc., New York, 12-25.
- Andrews, G.E. (1984) The Theory of Partitions. Cambridge University Press, Cambridge, 1-10. https://doi.org/10.1017/CBO9780511608650
- Andrews, G.E. and Eriksson, K. (2004) Integer Partitions. Cambridge University Press, Cambridge, 3-9. https://doi.org/10.1017/CBO9781139167239
- Hardy, G.H. and Wright, E.M. (2008) An Introduction to the Theory of Numbers. 5th Edition, Oxford University Press, Oxford, 361-389.
- Alder, H.L. (1969) Partition Identities—From Euler to the Present. The American Mathematical Monthly, 76, 733-746. https://doi.org/10.2307/2317861
- Andrews, G.E. (1983) Euler’s Pentagonal Number Theorem. Mathematics Magazine, 56, 1-12. https://doi.org/10.1080/0025570X.1983.11977058
- Stanley, R.P. (1971) Ordered Structures and Partitions. Thesis, Harvard University, Cambridge, MA, 1-89.