This study was to explore the nature of two basic constitutes of the regular pentagon,With these two constitutes, the regular pentagon could be multiplied into any times in size. We used four multiplication methodsto show how the regular pentagon enlarge and to verify that the enlarged regular pentagons derived from computer did exist. By integrating these four multiplication rules, we were able to arrange regular pentagon of any length of side, and evidenced the equation was ( If m,n is the number of A,B of a regular pentagon respectively ) When we tried to verify if any regular pentagon could be constituted by other smaller regular pentagons, we found that it was un-dividable only if the length of pentagon side were (the number of A, B were the 2n and 2n-1 item of Lucas Sequence), otherwise, any regular pentagon is able to be constituted by other smaller regular pentagons. The divided forms could be multiple. We also found that any pentagon could be divided by two successive un-dividable pentagons, which is called “standard division rule”. We expected to derive all kinds of division by analysis of two successive un-dividable pentagons in standard division rule. 這個研究起源於一個拼圖玩具：利用兩種黃金三角形排出指定大小的正五邊形。我們的研究動機是：一、 假如無限量供應A 和B，能夠拼出哪些邊長的正五邊形？二、 哪些拼好的正五邊形不能拆成一些較小的正五邊形？我們將研究的主要結果分述如下：
「為配合國家發展委員會「推動ODF-CNS15251為政府為文件標準格式實施計畫」，以及 提供使用者有文書軟體選擇的權利，本館檔案下載部分文件將公布ODF開放文件格式， 免費開源軟體可至LibreOffice 下載安裝使用，或依貴慣用的軟體開啟文件。」