At the website “MathLinks EveryOne,” we found a problem “Snakes on a chessboard,” which was raised by Prof. Richard Stanley. The following is the problem. A snake on the m n chessboard is a nonempty subset S of the squares of the board with the following property: Start at one of the squares and continue walking one step up or to the right, stopping at any time. The squares visited are the squares of the snake. Prove that the total number of ways to cover an m × n chessboard with disjoint snakes is a product of Fibonacci numbers. We call the total number of ways to cover a chessboard with disjoint snakes “the snake-covering number.” This problem hasn’t been solved since it was posted on September 18, 2004, so it aroused our interest to study it. First, we used the way in which we added each block to the chessboard, and therefore we discovered some regulations about the snake-covering number of the1 × n , 2 × n and 3 × n chessboard. Through “recursive relation” and “mathematical induction”, we proved the general term of the snake-covering number of the1 × n , 2 × n and 3 × n chessboard. In the following study, we found a key method in which we added a group of blocks to the chessboard. Finally, we proved the general term of the snake-covering number of the m × n chessboard. Also, we discovered the way to figure out the snake-covering number of the nonrectangular chessboard.在網站“ MathLinks EveryOne ”中，我們找到了一個有趣的問題“棋然上的蛇” ( Snakes on a chessboard ) ，這個問題是由教授 Richard Stanley 所提出。問題如下：在m x n棋盤形格子上，蛇由任意一格出發，但蛇的走法只能往右 → ，往上↑，或停住 ‧ 若此蛇已停住，將由另一條蛇來走，且不同蛇走過的格子不可重疊”證明：將 m × n 棋盤形格子完全覆蓋的總方法數為費氐（ Fibonacci ）數列某些項的乘積。我們將把棋盤形格子完全覆蓋的所有方法數稱之為“蛇填充數” 由於這個問題自從 2004年 9 月 18 日被登在網站上後，還沒有人提出解答，於是引發了我們研究的興趣。首先，我們使用了將一個一個格子加到棋盤上的方法，並發現了 l × n 、 2 x n、 3 × n 棋盤形格子蛇填充數的一些規律。我們使用遞迴關係及數學歸納法來證明 l x n 、 2 x n ， 3 × n 棋盤形格子蛇填充數的一般項。在接下來的研究中我們發現一個特別的方法，一次增加數個方塊 ‧ 最後我們證明了，m x n, ，棋然形格子的蛇填充數的一般項 ‧ 而且，我們也找到如何求出不規則棋盤形格子的蛇填充數。

日光燈是我們最常用的照明設備。傳統的日光燈是屬於電感性的負載，接上電源後其電壓與電流的波形會產生異相位的問題，造成無效功率。本研究是以簡單而且經濟的方法在日光燈的兩端並聯電容器以改善其電流落後電壓的情形，減少無效功率，降低電力的消耗。研究中測量日光燈的等效阻抗，並加以相應的補償電容，從電路實驗中觀察，得到功率修正的結果。Fluorescent lamps shine our lives everywhere. However, traditional fluorescent lamps are inductive loads and produce a phase angle between voltage and current when connected to an alternating power supply, which leads to considerable electricity losses. This project uses parallel capacitors with the fluorescent lamp to compensate the phase difference between current and voltage, and thus reduces power consumption. In the study the impedance of a CFL (Compact Fluorescent Lamp) bulb has been measured and compensated with corresponding capacitance. Finally, the power consumption reduction is verified with experimental results.

在2003 年台灣國際科展之作品說明書「Concatenating Squares」中【9】與2004第三屆旺宏科學獎「SA3-119 ：與特殊型質數之倒數關聯的兩平方總和的整數分解」成果報告書中【10】，就已有令人驚訝的結果。在2005 第四屆旺宏科學獎「SA4-298 ：分和累乘再現數產生的方法及其性質探討之推廣與應用」成果報告書中【11】，更是以逆向思維進行研究推廣，創造出許多新穎且引人注意的美麗數式，由原創性的觀點來進行逆向思維的研究。正由於這些再現數充滿奇巧，且與不定方程（代數）、簡單的數整除性分析（數論）以及同餘式理論都有所關聯，我們要發展前所未有的同步關聯與研究分歧， 且是最新的發現，更以豐富的想像力、創造力與推理能力提出令人耳目一新的重要結果，得到許多從未見過世面的美麗數式，回眸觀賞時內心充滿了數學之美！;Number which when chopped into two（three）parts, added / subtracted and squared（cubed） result in the same number. Consider an n -digit number k , square it and add / subtract the right n or n .1 digits. If the resultant sum is k , then k is called a Kaprekar number. The set of n -Kaprekar integers is in one-to-one correspondence with the set of unitary divisors of 10 n m1. If instead we work in binary, it turns out that every even perfect number is n - Kaprekar for some n . We wish to find a general pattern for numbers these numbers cubed or 3-D Kaprekar. We also investigate some 3-D Kaprekar of special forms. In addition, some results relating to the properties of the Kaprekar numbers also presented. This study indicates the “interesting” and “pragmatic” natures of the research project. We have developed the original results based upon his initiatives and has thus created a new horizon through the research project. This is the proudest achievement for this study. Generalization of Some Curiously Fascinating Integer Sequences：Various Recurrent Numbers！

利用鐵離子(Fe3+)催化過氧化氫(H2O2)產生高活性自由基，並利用自由基降解汙染物的方法稱為Fenton法，然而傳統Fenton法中的鐵離子為液相催化劑，會隨降解後的汙水排放，環保署公告的廢水放流標準規定鐵離子濃度必須小於10 ppm ，為了符合標準，廢水必須加入凝集劑排除鐵離子，造成大量氫氧化鐵汙泥，造成氫氧化鐵汙泥的二度公害，且不符合綠色化學中充分利用原料及將耗損降低的主張。因上述缺點，本研究將傳統Fenton法中的液相催化劑，改利用聚丙烯酸(PPA)錯合鐵離子形成的固相催化劑，改善鐵離子會隨降解後汙水排放的缺點。實驗發現固相的鐵離子催化劑降解速率較液相鐵離子催化劑慢，但在降解後的汙水中，固相催化劑降解的汙水驗出微量鐵離子，較傳統Fenton法鐵離子會隨降解後汙水排放的現象，減少大量鐵離子耗損。

一 Motivation and Purpose: In this study, we want to completely know about “The number abc…de, which times m/n, 1≦n≦m≦9?N can get ed… cba?”, and also expect to find out “The good rule within them”. 二 Procedure:Using method of enumeration, induction to collect sample of all and beginning from two digits to get information “good rule”. When get some useful idea, put them into the following research for the step easy go on, the method try and error is a very tiresome works, especially when we deal higher digits. till enough information is obtained, we solve problem and find new one, then likewise again research steps, just the basic science research ways, we are glad have the key of these problem. 三 Result and conclusion :Those number we named “converse No.” There are two groups: S=m+n=10 and 11 S=11, then Q=m/n=9/2,8/3,7/4,6/5=4.5,2.6,1.75,1.2 S=10, then Q=m/n=9/1,8/2,7/3,6/4=9,4,2.3,1.5 Each group have four type. When S=11,Q=7/4=1.75,if converse No.each digit is a multiple of 3, then can cancellation or extension of fraction to get another 3 or 4. Growth up rule: Converse No. = type factor x heritable factor x growth factor=rx hx g S=11,r=2~5,h=9, s=10, r=1~4, h=99 一 研究目的：盼能找出”顛倒一族”的族譜。二 研究過程：確定研究題目為ab…cde×m/n=edc...ba,0≦n≦m≦9?N 求ab… cde？以窮舉法收集觀察資料，歸納演繹尋求規律。1.先觀察兩位數，分析共有顛倒對36對。2.建立乘數Q=m/n一覽表，共有27個3.設計顛倒對大/小及其商一覽表，以利觀察、歸納獲得規律。4.接著觀察三位數，共有360對，綜合二、三位數規律，找出選擇式窮舉法：9之倍數法。5.再接著找出四位數，再綜合而知另有 全調法 重現法 半調法 GCD遺傳基因法等來繁衍高位數顛倒數。6.於是依諸法找得六位數資料，得知GCD遺傳基因法為繁衍通則，完成族譜建立模式。7.研究顛倒數位數與其個數間關係式，完成研究。研究結論：1.顛倒一族有兩大類：S=10與S=11 S=m+n。2.每一大類有四型： S=10中，Q =9/1,8/2,7/3,6/4(9,4,2.3,1.5)S=11中，Q =9/2,8/3,7/4,6/5(4.5,2.6,1.75,1.2)3.每一型均有一個顛倒數，除了S=11中，Q=7/4=1.75者可約、擴分而得3or4個。4.顛倒數原則上均為9之倍數，除了Q=7/4經約、擴分可能得非9倍數者。

This study analyzed how short-term solar activities interact with the earth atmosphere, by using two statistic methods: Diffusion Entropy Analysis (DEA), and Standard Deviation Analysis (SDA). Since solar activities influence the Earth atmosphere in its radiating heat and magnetic field, we use DEA and SDA to calculate the exponents, H and δ, of the scaling law in three time series: “the intensity of solar flare” (representing by SOLAR H-alpha flare index), “magnetic anomaly of magnetosphere” and “sea surface temperature anomaly”. The values of H and δ show the time memory and correlative relationship between the event and next event happening in time series. When H = δ = 0.5, events occur in random. When 0.5

Motivated by Napoleon theorem, we study the properties of the triangles obtained by moving the midpoint of each side of a given trianle along the perpendicular bisector of corresponding sides, and extend the results to the case of quadrilaterals. On the other hand ,we consider the method of erecting a regular M-gon to each side of a given N-gon and joint the N centers of these M-gons to form a new N-gon. (abbreviated as CRG method),and get the following results. 1. We characterize some kinds of N-gons that can be transformed to regular N-gons via CRG method. 2. Of M,N are nature numbers with M|N, then it is possible to find a N-gon that can be transformed to a regular N-gon by CRG method. \r 3. If a polygon P is symmetric with respect to a fixed point or a fixed line, then P can be transformed by CRG to a polygon with similar symmetries. 4. If a polygon P is transformed by CRG to ′P,there exists a commonpoint G such that ΣGA=0 andΣGB=0, where A and B runs through vertices of and P′P, respectively. 本研究將拿破崙定理加以延伸。先探討由各邊中點沿中垂線延伸得出之三角形的性質並推廣至四邊形之情形條列式報告成果。另一個推廣是將給定的多邊形的每邊外接一個正多邊形，再以這些外接的正多邊形的中心為頂點造出一個新的多邊形。我們發現此幾何變換具有以下性質：（1） 「哪些多邊形能被變換成正多邊形呢?」，我們觀察出能被變換成正多邊形的多邊形其限制條件隨邊數增加而增多，並進一步區分了哪些多邊形可以被變換成正多邊形。 （2） 在將非正N邊形做變換時，不一定須外接正N邊形才能得到正N邊形，我們區分出可外接哪些正多邊形而得到正多邊形。 （3） 對給定的多邊形作此變換時，若原多邊形有點對稱或線對稱等性質，則新多邊形也將具有相同的性質。 （4） 此變換得到的新多邊形會與原多邊形共重心，亦即新舊兩多邊形內到各自的頂點向量和為0的點會是同一點。

正方形和長方形是每一個人都非常熟悉的圖形，但其中卻隱藏了非常多奇妙的“數學之謎”。 所謂「完美長方形」是：在一個長方形中 (長、寬不等)，能否分割出最少大小相異的正方形。 這個研究中，首先用「草圖」的解題方法研究完美長方形，接下來利用「平面圖形」的解題方法可簡化計算的過程，最後利用「對偶關係」證明出：完美長方形的最少階數為 9 階。 進而，我們將這個問題擴展至三維空間，思索在一個長方體中（長、寬、高都不等長） ，能否仿照二維空間，分割出最少大小相異的正方體，而完成這個研究。 Square and the rectangle are figures that everyone knows well very much, but what a wonderful " mystery of mathematics " is hidden among them. What is called the perfect rectangle is whether in a rectangle (its length and width is different ) could cut apart two squares as the least difference in size . In this research, the solution approach of "the sketch map" is used to study the perfect rectangle at first, then the solution approach of "the level figure" to simplify the complicatied calculation of the solving course , and "the dual relation" is finally used to prove 9 orders are the least orders for a perfect rectangle . And then, we expand this question to three-dimensional space, considering in a cuboid (its length, width, and height is different) whether could follow the two-dimensional space model to cut apart two squares as the least difference in size, and finish this research.

The larceny is always annoys our family and our society. They usually steal on the day when people working in the office or studding in the school. They always wait for people leave the house, and try the bell until them confirm the owner of the house leaved and nobody at home. Then they will open the door or break the lock of door. So we can find that if any body home or the lock is very hoard to open or to break. Then the thief is always choice to give up. That prove if we con let the thief think the house is some body home. Then it can to avoid larceny. This project is about how to design a system which is used AI technology to be a robot that is like a human. That robot can talk to the thief and can be a special lock when the thieves try to break the lock of door. The goal of this project is to design a robot that will be a door angel. It will let thief thinks that is some people always in the house. So they can not to steal in this house. We use the AI speech recognition & house environment control I/O system to be a robot which is setup in the door. It is like an angel to protect our home and family. And can stop the larceny. 「住宅竊盜犯罪」一直持續困擾著人類社會，住宅竊案最常發生於大白天，小偷常趁著家中成員上班、上學等時機，稍加觀察，再加以測試（按門鈴） ，確定家中無人，下手破壞鎖具侵入搜括；小偷只要遇到非常難開的鎖或認為有人在家就不會進一步的行竊。所以這證明只要讓小偷認為家裡有人，就能防止竊案的發生，而我們的研究目的就是如何在小偷還在徘徊尋找目標時，就要讓他感到這一家不能偷，如何讓他感覺家裡有人，進而打消入侵行竊的意念。我們希望能設計一套系統，利用AI人工智慧語音辨識及家庭環境控制，來建立一個充滿智慧的門神機器人，來事先嚇阻小偷的行動，就像門神一樣，可以預防竊案的發生，並整合大門門鎖內鎖與家電，形成智慧型的門神機器人，來保佑我們的家庭，也讓竊盜率降低，作為竊盜犯罪防治的利器。

本實驗的目的在於探討凌日時的黑滴效應。實驗以投影機在螢幕上投射出亮區模擬太陽，以保麗龍球模擬內行星橫越太陽表面，以相機作為觀測記錄器材，結果發現在內行星與太陽的第二及第三次接觸時會有黑滴現象。黑滴效應在光源顏色越接近紅色、拍攝相機的光圈值越小越明顯、相機對焦比實際值越小越明顯；光源的明亮度對黑滴效應沒有顯著影響。金星大氣、地球大氣不是造成黑滴現象的主因，而影響黑滴效應的因素與光的繞射相同。實驗結果發現，黑滴效應的成因主要發生在觀測紀錄的器材上面。This study is conducted to explain the black drop effect for the transit of a planet. A video projector projects a bright square on the screen to simulate the Sun. A ball simulated the planet crossing the sun’s disk. And a digital camera takes the images of transit. The Black-drop Coefficient is defined and a computer program is designed to analyze the image of black drop. The results show that the resolving power of the observation instrument is the main factor in the effect. The atmosphere and the solar limb darkening do not directly respond to it.