<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-science-frontier-research-f-mathematics-decision</journal-id>
<journal-title-group>
<journal-title>Global Journal of Science Frontier Research - F: Mathematics &amp; Decision</journal-title>
</journal-title-group>
<issn publication-format="print">0975-5896</issn>
<issn publication-format="electronic">2249-4626</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/58261.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">58261</article-id>
<title-group>
<article-title>Recurrence Formula of Stamp Folding Problem</article-title>
<subtitle>Recurrence Formulas for the Stamp Folding Problem</subtitle>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Sakai</surname><given-names>Shintaro</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
</contrib-group>
<aff id="aff1">JAPAN</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2023-04-13">
<day>13</day>
<month>04</month>
<year>2023</year>
</pub-date>
<volume>23</volume>
<issue>F2</issue>
<fpage>15</fpage>
<lpage>22</lpage>
<abstract><p>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.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>stamp folding problem</kwd>
<kwd>discrete mathematics</kwd>
<kwd>discrete geometry</kwd>
<kwd>folding</kwd>
<kwd>crease.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJSFR_Volume23/2-Recurrence-Formula-of-Stamp.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/recurrence-formula-of-stamp-folding-problem/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>There is an unsolved problem that has plagued mathematicians for a long time, the &quot;stamp folding problem&quot; (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.</p>
</sec>
</body>
</article>