Recurrence Formula of Stamp Folding Problem
DOI:
https://doi.org/10.34257/GJSFRFVOL23IS2PG15Keywords:
stamp folding problem, discrete mathematics, discrete geometry, folding, crease
Abstract
There is an unsolved problem that has plagued mathematicians for a long time the stamp folding problem strictly is there a formula for counting the solutions to the stamp folding problem In this paper I have succeeded in expressing the stamp-folding problem by a recurrence formula with an elegant idea
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Shintaro Sakai. (2023). Recurrence Formula of Stamp Folding Problem. Global Journal of Science Frontier Research, 23(F2), 15–22. https://doi.org/10.34257/GJSFRFVOL23IS2PG15
Published
2023-04-13
Issue
Section
Articles
License
Copyright (c) 2023 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.