數學

本研究中，我們將提出一些新穎結果，著重討論其在三角中的應用；同時，找出其遞迴關係式，得出三角展開式與其所對應之多項式分解式，進而討論出多種的規律性及所涵蓋的內容及推廣性質，我得到很多高中數學公式無法推導出在【4】和【8】中的漂亮公式及創新的結果，且這些等式都是由我們不太瞭解的無理數所構成的。 主要是討論我們在【7】中所得到的收穫與經驗；複數是三角、幾何、代數互動的橋樑，我是以不同的角度及嶄新的方法來綜合探討在【6】中相關的應用。提出關於正整數平方的倒數和公式更為精簡且基本的證明，將 sin−2 x 表示成級數形式的部分分式，進而應用在(a,b) = 1的機率問題上；並研究相關的等式，直接透過三角與代數來研究關於 2p 次方的倒數之求和問題，得出級數 之和的有用遞迴公式，並與最重要的常數扯上關係。 For one thing, we present diverse methods to evaluate finite trigonometric summation and related sums. Trigonometric summations over the angles equally divided on the upper half plane are investigated systematically. Several related trigonometric identities are also exhibited. What is more, we use methods of calculus, and make several surprising and unexpected transformations. A useful recursive formula for obtaining the infinite sums of even order harmonic series, infinite sums of a few even order harmonic series, which are calculated using the recursive formulas, are tabulated for easy references. Furthermore, is there any interesting results and applications？ Finally, the purpose of this paper is to develop a new proof of and related identities, but their derivations are more complicated. The following studies are completed under the instruction of the professor.

想像一下，原來固定的一個黑色大正方形(以下我們簡稱S1)四個角經過較小之正方形(以下簡稱S2)遮蓋後旋轉，為什麼會有放大縮小的感覺呢?(圖一) 我們猜測這是因為未被遮蓋部分(以下簡稱S3)的面積改變了，所造成的結果。令S1的邊長為 r，S2的一個小正方形邊長為n，k=r-n，θ為旋轉角度，我們實際算出了旋轉角度θ對S3的面積函數，

本研究是藉由數學手法探討；如何由一疊 36 張四種花色的撲克牌中，尋找出保證可猜中最多張花色的方法。研究過程是以在適當的猜牌時機，以邏輯推理、二進位、分析與歸納 … … 等數學原理與方法，搭配巧妙的策略運用而達到目的。 猜牌方法：先約定好猜牌規則，助手將 36 張牌背圖樣相同但非對稱的撲克牌，以旋轉牌背的方向傳達訊息。在本研究中得出「經由巧妙的猜牌方法保證可以猜中不少於 26 張花色」，並得出「當總張數趨近於無窮大時，保證可以猜中不少於 81 . 07 ％的牌，並且證出若僅使用獨立的訊息猜牌，無論任何猜牌方法皆無法猜中多於 87 . 37 ％的牌」 · 其中一個猜中多於 80 ％的例子是‘「當總張數等於 23006 張時，保證可以猜中不少於 1 8405 張牌（18405/23006 > 4/5）」 ·The study is mathematically based with reasonable explanations behind it. We are to correctly guess as many cards as possible from a deck of 36 cards, with random numbers and four different suits. We will apply mathematical methods, such as logic inference, binary system, and analytical reduction, upon right timing. Using careful arrangement of the principles and reasoning, we can reach our ultimate goal. To state guessing: Conference between the guesser and the assistant about the guessing rules, the assistant will have 36 cards with the same exact pattern on the back but not symmetrical. The pattern of the cards will be different when rotated 180o. The only communication between the two is by rotating cards. In this study, we can prove that through mathematical method, we can assure 26 or more cards can be correctly guessed. Furthermore, when the total amount of cards is close to infinity, we can assure 81.07% or more of the cards can be correctly guessed, and prove that if the cards are guessed from independent information, no more than 87.37% of the cards will be correctly guessed by any guessing methods. One of the examples, which 80% of the cards are correctly guessed, is that when the amount of the cards is 23006, 18405 or more of the cards can be correctly guessed. （18405/23006 > 4/5）

如果n-1 個正四面體在n 個面的多面體棋盤中翻轉(如：正八面體、正二十面體、五邊雙菱錐及三角錐台棋盤)，則正四面體相互之間會受到很多限制。本研究為探討n-1 個正四面體在n 個面的多面體棋盤中，利用其翻轉的特性，翻轉至相鄰空格，進而完成：1. 每個正四面體的底面及側面均能「同色共面」。2. 在滿足以上的兩個條件下做「數字排序」。3. 探討每個遊戲在各階段是否有解的情形。最後，將遊戲推廣至正八面體在多面體棋盤中的翻轉。If n-1 pyramids can turn in the chessboard of n planes pyramids (ex: 8 planes pyramid, 20 planes pyramid, 5 sides bi rhombus pyramid and triangular pyramid chessboard) there are lost of restrictions between these pyramids. This research is discussing about the n-1 pyramids in the chessboard of n planes multi pyramid, which have the peculiarity of turn that can turn to nearby space. We found that: 1. Each pyramid’s button plane and aide plane can be “same plane same color”. 2. Matching about 2 conditions then can do “order by numbers”. 3. Search for answers of each levels in each game. Finally, the game will be propagated to eight planes pyramid can turn on the chessboard of multi pyramid.

正方形兩條對角線的交點（即中心點）距四頂點等長，也與四邊等距。如果將正方形的頂點比擬成它的「手」，兩對角線的交點當成它的「心」，則兩個正方形頂點間、中心點間、或頂點與中心點間的線段相連（或重合），就如同「手」或「心」彼此相連。本文即探索當多個正方形間「心手相連」時，衍生圖形間的面積關係。而四個正方形中某幾個頂點相接（邊未重疊），恰圍出兩個三角形的圖形則是本內容討論圖形的主體架構，我們以此架構向外作出「層出不窮」的正方形，再配合中心點連接成四邊形，將推導出這些四邊形與基準正方形（Reference Square）間的面積關係。In a square, the lengths from the intersection point （center point） of two diagonal lines to the four apexes are the same, and so are they from that point to the four sides. If the apexes are “hands” and the intersection point of two diagonal lines is the “heart” of a square, the connection or overlap of two squares’ apexes and apexes, center point and center point, or apexes and center points is just like the connection of hands with hearts. In this article, hence, we are to explore the relation in area of derivative graphs formed by several squares connected “heart in hand.” When some apexes of four squares are overlain without sides overlapped, two triangles are created. And that’s the theme we are going to discuss. Furthermore, we extend the operation to infinitely overlain squares and frame out quadrangles referring to the center points of some squares. Then, the relation in areas of these overlapped squares and the Reference Square would be deduced.

傳統的畢氏定理三元二次不定方程x² + y² = z²有一組漂亮的整數解為(m² - n²、2mn、m² + n² )；中國數學家嚴鎮軍、盛立人所著的從勾股定理談起一書中記載四元二次不定方程x² + y² + z² = w²的整數解為(mn、m² + mn、mn + n²、m²+ mn + n² )，這組解被我們發現有多處遺漏，本文以擴展的畢氏定理做基礎修正了他的整數解公式，並推廣取得N 元二次不定方程的整數解公式。 There is a beautiful integer solution formula for the Pythagorean theorem equation, x² + y² = z² , such as (m² - n² , 2mn ,m² + n² ). The “m＂ and “n＂ of the solution formula are integer number. A book written by two Chinese mathematicians, Yen Chen-chun and Sheng Li-jen who expanded the Pythagorean theorem equation to the four variables squares’ indeterminate equation, x² + y² + z² = w² . They claimed that they found its integer solution formula, such as (mn , m² + mn , mn + n² , m² + mn + n² ) for any integer “m＂ and “n＂. But we found it losses many solutions. This paper corrected their faults due to the expanded Pythagorean theorem built by ourselves. Further more, we derived a general formula of N variables squares’ indeterminate equation. Now, we can get integer solutions of the equation, (for all natural number “n＂) easily by choosing integers m1 , m2 , m3 ,……, mn−1 up to you.

Hamiltonian和Hiroimono路徑問題都有百年以上的歷史，且沒有直接解決方法，可能因為是題目本身的條件在討論時尚不足解決問題，現階段只能用電腦去跑。

三角形的邊上取任意多個點，我們可以把這塊大三角形沿著切割線切割成較小塊的三角形，但切割線必須是點（或頂點）和點的連線，而且必須切割三角形，同時可以切任意大小的三角形，如圖（1）與圖（2）。但不可以一開始就取走整個三角形。定義拿到最後一塊三角形的人獲勝，而在多邊型中的玩法與在三角形中相同。 我們分A、B、C三種規則來討論，其中A規則即是上面提到的玩法，B規則大部分的玩法和A規則都相同，唯一不同的地方在於：A規則中，只要有一方取到剩下的圖形為三角形，另一方就可以直接取走剩下的三角形，而B規則規定即使剩下的圖形已經是三角形，也必須取到剩下的圖形邊上都沒有分點為止。C規則是限制玩家一次所能取的三角形數來進行遊戲。 我們完成了A、B、C規則中三角形與多邊形的必勝策略，並找出必勝策略之間的關聯。 ;Given any numbers of points on the sides of a triangle, the players can cut this triangle into pieces. Each cutting line has to be one, linked between two points given from two different sides. And the player can’t have to cut smaller triangles out of the original triangle. The out-cut triangles can be chosen randomly without any restriction in size, just like what’s shown in picture（1）and（2）. Meanwhile the first player can’t cut the original triangle exactly all out in the very beginning process. We define the player as the winner, who gets the last triangle. And the above way we play can be applies to any multi-side shapes. We discussed the question respectively in three rules, A, B, and C. Rule A is what we mention above. Rule B is generally the same as rule A, except for the only difference：The rule A , if there is any triangle left , the next player can get it directly, but while in rule B, the every next player has to cut out smaller triangles until no point is left on sides. Rule C proceeds on conditions that there is a limitation to a certain number of triangles cut out at a time. We has finished the winning tactic respectively in rule A, B, and C in the games with a triangle and multi-side shapes. Furthermore, we find the connection between the winning tactives.

Two soldiers walk on a checkerboard. They can only walk one step once a time and two directions, front and left, are decided randomly. The gunshot is the column and row where a soldier is located, and one will die if he enters the gunshot area of the other. To treat the probability of winning, we first study the cases of 1×n, 2×n, 3×n, and 4×n rectangles iterately. Then we establish a general form of the probability of winning in a general n×k rectangle by using recurrence technique and generating function, respectively. Finally, we extend to the general n×m×k cuboid case to obtain the first soldier’s probability of winning.在一個長方形的棋盤中，兩士兵行走，每一次只走一步，而且上和左兩個方向是隨機的，射程範圍是所在的此行和此列，而進入他人射程範圍則死亡。探討其獲勝機率，從1×n 、2×n、3×n、4×n 矩形的情形逐步研究，並分別運用遞迴式的技巧及生成函數，導出 n×k 矩形中先走士兵獲勝機率的一般式。更進一步地，我們也獲得了n×m×k 立體空間先走士兵的獲勝機率。

我的研究是利用一些特殊的手法來探討所有情況皆會產生共點圓或共圓點。在一個由四條直線(無平行線組、無共點)所構成的圖形中，可以找到四個三角形及它們的外接圓。我知道它會共點，在此稱其為限制點。且若再添加一條直線，則可以任意的取出四條直線，分別找出它的限制點，而這些限制點又會共圓，吾稱其為限制圓。我欲證明此種情況會不斷延續下去。即是六條線時又會有限制點，七條線時又會有限制圓…。在本研究中，我利用了數學歸納法、特殊的編號方法以及「方向角」來做出此證明。由於固定的線組對應至固定的限制點或限制圓，希望能向找出其性質的方向發展。In my study, I use some skills to discuss all the situations which satisfy following conditions. The result is that concurrent circles or concyclic points will be found in every situation. In a graph consisting of four lines, conforming to conditions that any three lines won’t be parallel or intersect at one point, I can find out four triangles and their circumscribed circles. I know these circumscribed circles will be concurrent and I call the point at which all the circles meet “restricted point”. If another line is additionally added in the graph, I can discover that restricted points determined by any four lines in the graph will be concyclic. I call the circle “restricted circle”. What I want to prove is that the above situation will go on. In other words, restricted points will exist when I have six lines, and restricted circles will exist when I have seven lines and so on. In my study, I used Principal of Mathematical Induction, special ways of numbering points and circles, and “orientated angle” to prove my hypothesis. Because of particular line groups corresponding with particular restricted points or restricted circles, the further work I want to attain is to find the relation of them.