數學

滿足之M點是否為重心之探索

滿足之M 點，我們稱之為Pi(i=1…n)的均值點。當n=3，M 恰為△P1P2P3 的重心 (G); n=4 時，M 亦為三角錐P1P2P3P4 的重心！因此不免引人遐思：滿足之M 點是否皆為其重心？ 我們藉由電腦幾何作圖軟體GSP 協助觀察，掌握了圖形變化間之不變性，再配合向量解析及推理，得以發現均值點、多邊形的重心、以至多面體的重心、及平行多邊形的一般性作法。附帶又發現：任意相鄰三頂點即可決定一平行n 邊形。並進而證實：平行四邊形為四邊形M＝G 的充要條件。但當n≧5 時，平行n 邊形只是n 邊形M＝G 的充分非必要條件！一般而言，具有對稱中心O 的n 個點所構成的圖形必可使M 與G 重合於O 點上。 The point M satisfying is called “the mean point of Pi(i=1…n)”. As n=3, M is the center of gravity (G) of the △P1P2P3. If n=4, then M is also the center of gravity of the triangular pyramid P1P2P3P4. Therefore, I began to wonder if the following assumption stands: The point M that satisfies is always a center of gravity. By using the computer software GSP (The Geometer’s Sketchpad) to observe figures. It is found that when a figure is changing there is still constancy. Furthermore, supported by the analysis based on vectors, general constructions can be established concerning the mean point, the center of gravity of polygon, the center of gravity of polyhedron, and the parallel polygon. Also, I find that any three neighboring vertexes decide a parallel polygon. And thus it is verified that the parallelogram is the sufficient and necessary condition for quadrilateral M=G. As n≧5, the parallel n-sides shape is the sufficient, not necessary condition, for n-sides shape M=G. In general, a central figure of n points having the center of symmetry O can make M and G meet on O.

給定一個p∈(0,1)，令k0=0,p0在(0,1)間隨機分布,定義 k1為能使的最小正整數k，而;相同的，對於給定的kn-1,kn為能使的最小正整數k，。若存在kn使得，則稱p∈In;若對於所有的n與kn，，則稱p∈I∞。如此區間(0,1)可分解成集合I1,I2,…I∞。

Methods of nonlinear time series analysis were compiled for use in the analysis of Electroencephalogram (EEG) tracings of children aged three to seven with varying degrees of autism in order to provide a quantitative means of diagnosing autism and determining its severity in a child. After determining the EEG leads to be used for analysis, the identified methods were coded and saved as functions on Scilab. To test the compiled program, a minimum of five EEG readings per cluster of children diagnosed with mild, moderate, severe and no autism will be obtained. The project was able to identify the mean, standard deviation, skewness, kurtosis and other higher order moments, the autocorrelation function, and the Fourier Series as the time-resolved statistical methods to be used for time series analysis. The nonlinear analysis methods identified include the use of the correlation integral, time-delay embedding and the Lorenz equations. One-way ANOVA testing will then be used on the numerical data obtained from the analysis to determine if a significant numerical differentiation has been obtained between the different clusters of EEG. This will provide a definitive way to medically diagnose autism, pinpointing children afflicted with the disorder and giving them proper treatment.\r Two copies of the "Abstract of Exhibit" (in English) should be sent to the National Taiwan Science Education Center or email to fung@mail.ntsec.gov.tw or yuonne@mail.ntsec.gov.tw before December 31, 2009.

We inferred the original Feynman triangle theorem from equilateral triangle into common triangle and from same ratios of dividing points into different ones. The conclusions are below： 由原始費曼三角形原理中的正三角形等比例分點問題，推廣至一般三角形的分點等比例及不相同之比例，得到如下之結論：

本研究所探討的主題是一道分割棋盤的題目：\r 給定一個黑白相間的mxn棋盤(設m為縱向邊，n為橫向邊)，將其分割成若干個面積大小都不等的矩形區域，且每個矩形的黑格和白格個數相等。設f(m,n)為符合上述條件的最多分割矩形的個數，則f(m,n)是多少？\r 在研究過程中，我們首先藉由對各棋盤進行分類，利用不等式的運算找出其中的關係，求得當m=n以及mn=k(k+1) 時(其中K為正整數)的f(m,n)值，並構造出其分割方法。而k(k+1)

Sicherman 已經找出與兩顆六面的正常骰子有相同機率分布的Sicherman 骰子，並進一步獲得與三顆六面的正常骰子有相同機率分布的骰子必為一對Sicherman 骰子與一顆六面的正常骰子之結果，我們試圖由已知的Sicherman 六面骰子的處理方法出發，透過對割圓多項式的分析來累積足夠的相關資料，以處理由兩顆四面骰子至兩顆三十面骰子，處理由三顆四面骰子至三顆三十面骰子的各種Sicherman 骰子的答案，來探索兩顆與三顆的n 面Sicherman骰子存在的充要條件與求法，並進一步將所得之結果分類，得到 ”有相同標準分解式的類型的數n，會具有相同組數的Sicherman 骰子”之猜測結果與特殊情形下的證明。 Sicherman has found out the Sicherman dice which have the same probability distribution as the normal two six-sides dice. Furthermore , he also found out a pair of Sicherman dice and a normal six-sides dice has the same result as 3 normal six-sides dice . We try to begin with the given algorithm of six-sides Sicherman dice , through the analysis of Cyclotomic Polynomials to accumulate sufficient related information then to come up with the solution from discussion of 2 four-sides dice to 2 thirty-sides dice , from 3 four-sides dice to 3 thirty-sides dice to explore the existence of necessary and sufficient condition and solution of 2 n-sides Sicherman dice and 3- sides Sicherman dice , and even to classify the results to come to a conclusion of the guessing results and proofs under special cases about “the numbers n which have the same Canonical Prime Factorization will have the same numbers of n-sides Sicherman dice.”

最後留下數字會是多少？該問題在台灣的全國中小學科學展覽出現多次。而資訊界演算法大師Donlad E. Knuth 在其著作The Art of Programing，CONCRETE MATHEMATICS （具體數學），針對該數列作詳細的說明；但是，不論是歷屆全國中小學科學展覽或是大師著作，對於該問題，都只是談及殺1 留β或是殺α留1。本研究利用獨創α分類、n 及k 分類、d 函數、b 函數及循環、n 及y 分類、碎形數列和演變關係，將約瑟夫問題探討範圍提升至殺α(個數)留β(個數)，直到剩下最後1 個數時就不能再殺了，遊戲終止，倒數第k 個留下的自然數是多少？同時，本研究在殺α(個數)留β(個數)下，指定自然數y 為酋長，酋長不能被殺，殺到酋長時遊戲停止，求剩下的自然數有幾個？會發生什麼情形？The Josephus problem refers to what will be remaining when arranging n natural numbers in a circle and starting killing one and leaving the next one alive. The problem has been on display for many times in Taiwan National Primary and High School Science Exhibitions (as shown in Table 1). And, the information algorithm master, Donald E. Knuth has elaborated on the array in his works The Art of Programming, CONCRETE MATHEMATICS. However, both the past science exhibitions and the master’s works are limited to discussions on cases of killing 1 leaving β or killing α and leaving 1. This research employs uniquely created α classification, n and k classifications, d function, b function and loop theory to extend the Josephus problem scope to killing α leaving β to find out what the remaining natural number is by No. k counted recursively. Meanwhile, this research designates natural number y as the chieftain, which can never be killed. The game is over when the chieftain is to be killed. The problem is to work out how many natural numbers are remaining. And what happened?

The Look and Say sequence is produced by describing the appearance of the previous row. For example, start with “1,” which can be described as “one 1,” and therefore the second row is “11,” which is "two 1s," making the third row “21,” the fourth row “1211,”and so on. The main goal of this study is to work out the exact formula for this sequence, which means given the row number n, we can know at once what the n-th row is without having to start from the first row and doing the look-and-say iteration for n-1 times. Some of the methods used include dividing groups, repetition and cracks. The formula we derived speeds up the calculation and gives us a better understanding of the look and say sequence.「外觀數列」為依照外觀產生下一列的數列，第一列為「1」，第二列描述第一列「1 個1」而為「11」，第三列則描述第二列「2 個1」而為「21」，第四列「1211」，依此類推。本研究針對外觀數列的各項數學性質作研究探討，並由此推導出外觀數列的一般式，即給定第n 列就可知道該列的內容。我們運用了分組、重複性以及裂縫的方法分析數列，最後得到了其一般式，此一般式有助於運算速度的加快以及我們對數列性質的了解。

傑克船長和他的海盜們掠奪到許多箱珍寶，每箱含有數量不等的金幣及鑽石。船員們深怕傑克船長又出什麼陰謀，一致同意讓船長任選一半的箱子拿走。\r 當然，傑克不知道金幣和鑽石的價格比，為了保證可以得到一半的利益，傑克希望他拿到的金幣和鑽石都各占一半。傑克的願望會實現嗎？\r 這個問題已用高等數學證明其解，而本研究利用初等數學的方法，除證明傑克需取的最少箱子數外，同時也能更快速的算出取法。\r 類似的結果可應用至分配災區物資等情形，或任何無法轉移、獨立的資源，如各式專長的人才、多功能的機械等，期望可對更有效的分配做出貢獻。

我們從日常生活中的酒瓶填塞問題，延伸出圓在相守條件下產生的衍生圖面\r 積極值及相守圓排法等問題，研究過程中我們發現以下的結果：\r 一、 我們可以利用較少個相守圓的排法，以繁殖或增加的方式排出較多個相守圓\r 的衍生圖。\r 二、 當相守圓數量為2個、4個及6個時，相守圓以對角線排列，且衍生圖為正方形\r 時，面積會產生最大值。而當相守圓數量為3 個及5 個時，衍生圖面積最大\r 值會出現在相守圓排成波浪形時，但其夾角並非特殊角。\r 三、當相守圓數量為2個至6個時，相守圓以直線排列，衍生圖面積會產生最小值。\r 四、透過不同層數、個數的研究得知：當相守圓的數量為11個或14個以上時，存\r 在正三角形排法小於直線排法的情形 。而相守圓個數在10個以下時，直線排\r 法面積都叫正三角形排法小。\r 五、我們可以用質單元分割的方式討論更多圓數時，相守圓間的排列方式，使得\r 生多元間的排列變為數字間的加法排列，可以大大降低討論情形的複雜度。\r 六、我們可以用密度的概念，搭配質單元分割的方式，得到不同圓數時，以不同\r 衍生多元搭配波浪形法形成之衍生圖密度最小值。\r 七、我們可以算幾及柯西不等式來驗證特定類型的衍生圖面積極值，也可以列出\r 面積函數來分析不同類型的衍生圖面積極值。