數學

In this work I make the analysis of the possibility of the existence of the number system with non-natural base & its investigation. The question examined in my work is totally opened:\r ‧ making the list of new characteristics, rules of the translation of the numbers, and also rules of the simple calculating operations, checked the operations of subtraction & division;\r ‧ checked the Euclidean algorithm, its characteristics by means of estimating the coefficients;\r ‧ found the practical appliance of new method in compiling & solving of the tasks.\r Investigation I’ve suggested stipulates for independence of new system & its appliance in type of tasks, that is beyond the course of school program & also beyond the whole system of school education.

Purpose of the Research:\r 1) To determine whether a poor understanding and inability of Grade 7 and 8 learners to apply the BODMAS principle in mathematics, influences scores obtained in a mathematics test.\r 2) To determine whether scores obtained in the given mathematics test can be improved with a BODMAS learning tool.\r Procedures:\r 1. Get the educators opinion on mathematics in schools. Send a total of 50 questionnaires to four schools.\r 2. Determine what percentage of a mathematical test/examination requires the application of BODMAS\r 3. Do a pre-test at two schools, a total of 370 grade 7 and 8 learners.\r 4. Design a BODMAS learning tool and verify it with three educators.\r 5. Implement the tool at the two schools.\r 6. Do a post-test at the two schools.\r 7. Get all the educators who were at the implementation session to evaluate the session.\r 8. Investigate two other schools, by sending 270 pre-tests to those two schools, to determine whether applying the BODMAS principle correctly is also a problem for learners in those schools.\r 9. Implement the BODMAS learning tool into the intermediate phase syllabus.\r Data:\r 1. Of the 41 educators in the sample, 52% think the standard of maths in their schools is average.\r 2. 38.9% of a grade 8 mathematics examination paper and 46% of grade 8 mathematics tests contains questions that are BODMAS related.\r 3. The learners achieved an overall average of 22.57% in the pre-test\r 4. The educators evaluated the BODMAS learning tool as very good as it is.\r 5. Learners and educators enjoyed the implementation session of the BODMAS learning tool.\r 6. In the post test learners did much better, the overall average increased by 21.00% to 43.57%.\r 7. Educators were positive about the way in which the tool was explained.\r 8. The learners in the other two schools also struggled with applying the BODMAS principle.\r 9. A second pilot study is being done in four primary schools by the Department of Education for the implementation in the Free State mathematics 2013 syllabus. \r Conclusion:\r My hypothesis is supported. \r 1) A poor understanding and inability of Grade 7 and 8 learners to apply the BODMAS principle in mathematics, influenced scores obtained in a mathematics test.\r 2) Scores obtained in the given mathematics test were improved with a BODMAS learning tool.

在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！

(一) 本研究首先導出ΔABC等分面積線移動所包絡出的曲線方程式，其圖形是由等分面積線段PQ(其中P、Q皆在ΔABC的周界上)的中點所構成，具有3 條曲線段(分別為3 條雙曲線之一部分)的封閉曲線，形成內文所謂的「包絡區」。利用包絡區的區隔，我們找出：1.當P 點在包絡區內，則有3 條等分面積線。2.當P 點在包絡區周界上，則有2 條等分面積線。3.當P 點曲線段的端點或在包絡區外，則有1 條等分面積線。(二) 以三角形的研究當基礎，擴展到凸n 邊形(不包含點對稱圖形)，我們發現：等分面積線數量之分布，仍然與包絡區息息相關，且1.凸2m +1邊形最多有2m +1條等分面積線。2.凸2m邊形，必發生內文所謂的「換軌」。因此，最多只有2m ?1條等分面積線。3.包絡曲線所分割出的區域，於相同區域其等分面積線數量相同，且相鄰兩區域數量差兩條。(三) 若凸n邊形有k個「換軌點」，則此n邊形過定點等分面積線至多有n ? k 條。(四) 若凸n 邊形為點對稱圖形(如正偶數邊形、平行四邊形)，則所有等分面積線皆過中心點。1) Our study got a curve equation of bisectors of a triangle. When a bisector is moving, we get three curves. They’re constructed by the midpoints of PQ. The three parts of the three curves make a closed curve which we called “the Envelope Area”. We found out:\r 1. When Point P is in the Envelope Area, we can get 3 bisectors. 2. When Point P is on the curves of the Envelope Area, we can get 2 bisectors. 3. When Point P is outside of the Envelope Area, we can get only 1 bisector. 2) Based on our study of triangles, we found that in Convex polygons(not including Point Symmetry Convex polygons), the distribution of bisectors is related to the Envelope Area. 1. We can get at most 2m +1 bisectors in a 2m +1 Convex polygon. 2. We can get at most 2m ?1 bisectors in a 2m Convex polygon, and the bisectors on the curves will “Change the Track”. 3. Envelope curve will divide a Convex polygon into several areas. The same area has the same numbers of bisectors, and the near areas have less or more 2 bisectors. 3) If a Convex polygon has k points to change the track, it will have at most n – k bisectors.\r 4) In a Point Symmetry Convex polygon (ex. Regular 2m convex polygons and parallelograms), all the bisectors will come through the center point.

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, ，棋然形格子的蛇填充數的一般項 ‧ 而且，我們也找到如何求出不規則棋盤形格子的蛇填充數。

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.

This work presents fundamental research in the field of algebra and the theory of number. The subject of the work is equations of Markov's type (the type of the equations introduced by me earlier which generalizes the classic equation of Markov (x2+y2+z2=3xyz)) of parabolic type with two unknown quantities and their genealogical trees. The following questions appeared when I was working on the equations of Markov's type and constructing genealogical trees to them: are there any other trees besides one for a certain equation; how to find all the genealogical trees for the equation of Markov's type; how to find all the integer solutions with the help of the genealogical trees. This work is devoted to the analysis of these questions. The aim of the work: to create the method of finding all the integer solutions of the equations of Markov's type of parabolic type. The tasks of the work: 1. Carrying out some experimental works to find all the genealogical trees for a concrete equation. 2. Formulating a hypothesis that the curve has a specific part. 3. Research the parabolic type in order to apply the hypothesis to it. 4. To formulate and prove the theorems about the necessary and sufficient conditions of the existence of the genealogical trees of the integer solutions of equations of Markov's type of parabolic type with two unknown quantities. As the result of the work all the tasks have been solved. I worked the method of finding all the integer solutions: : to find all the integer solutions by means finding all genealogical trees of the equations of Markov's type of parabolic type with two unknown quantities you need : 1. To investigate if there any integer solutions‧ a special part of the parabola (if it is a parabola)‧ a special part of the parallel lines (if it is a pair of the parallel lines) 2. To build a genealogical tree from every solution (if they exist). 3. All the integer solutions will be on the constructed trees. I also worked out a computer program which is based on the usage of this method.

高斯曾經提出八皇后問題：八個皇后在8 × 8 的棋盤上有幾種放法可以使任意兩皇后不會互相攻擊？我們在原來的問題上加上一些條件，改變皇后攻擊規則，使得皇后失去一條對角線的攻擊方向，稱之為「跛腳皇后」。我們稱一個在棋盤上放置最多跛腳皇后使其不互相攻擊的放法為好放法；研究跛腳皇后放置在各類棋盤上其好放法的個數和性質。我們分別在六種棋盤上做討論：（1） 在平面n x n 棋盤上，我們證明了其好放法與完美極致史考倫型數列之間的對應關係，並歸納出相關的性質和定理。（2） 在平面m x n 棋盤上，我們固定一邊長度n，做出n 較小時好放法數的通式；我們也將其好放法對應至廣義史考倫。（3） 在環面n x n 棋盤上，我們說明了其好放法與完全剩餘系排列之間的對應關係，並歸納出相關的性質和定理。（4） 在環面m x n 棋盤上，我們固定gcd（m,n），做出gcd（m,n）較小時好放法數的通式。（5） 在柱面n x n 棋盤上，我們證明其與環面n x n 棋盤等價，說明其好放法具有和環面n x n 棋盤好放法相同的性質和定理。（6） 在柱面m x n 棋盤上，分成左右柱面以及上下柱面來做討論。我們歸納出相關性質和定理；並固定一邊長度n，做出n 較小時好放法數的通式。Gauss had researched about putting eight queens on the chessboard on the way that doesn’t make any queen attacks another one. Thus, we added some rules on the question: the queen loses one diagonal attacking-way and become the “lame queen”. We call a way that doesn’t make any lame queen attacks another one “a good way”. We have been investigating the amount and properties of good ways based on six kinds of chessboard: （1）We found the correspondences between the “good way” on n × n plane chessboard and the Perfect extremal Skolem-type sequence, and concluded some associated properties and theorems. （2） On m× n plane chessboard, we fixed the length n of one side of the chessboard, and accomplished the amount of good ways when n is small. We also correspond the good way to the Generalized Skolem.（3）We found the correspondences between the “good way” on n × n torus chessboard and the arrayal of complete residue system, and concluded some associated properties and theorems.（4）On m× n torus chessboard, we fixed the gcd(m,n) （greatest common divisor of m and n）, and accomplished the amount of good ways when gcd(m,n) is small.（5）On n × n cylinder chessboard, we proved that this kind of chessboard is equal to torus chessboard. So the good ways, characters, and theorems on cylinder chessboard are the same as on the torus one.（6）On m× n cylinder chessboard, we separate it into two cases: left-right cylinder chessboard and up-down cylinder chessboard. We concluded some associated properties and theorems, and we also fixed the length n of one side of the chessboard and accomplished the amount of\r the good ways when n is small.

在實驗中學2007 年校內科展，參展作品《三角形中的切圓》的研究中，研究三角形內的切圓時，發現連續切圓的圓心與拋物線的軌跡有關。於是去查資料，在偶然的情況下，翻閱《平面幾何中的小花》時，接觸了「六圓定理」。因為覺得這問題非常有趣，於是便著手證明（見報告內文）。 又發現，當移動六個圓中的起始圓時，總是在某種情況下，六個圓會重合成三個圓。繼續研究其重合的狀況，發現了馬爾法蒂問題（Malfatti's Problem）的一種代數解法。 當我試著推廣六圓定理至多邊形時，發現奇數邊的多邊形似乎也有如六圓定理般圓循環的狀況，於是著手證明，但目前尚未證明成功。而偶數邊的多邊形則無類似的結果。 ;In 2007 National Experimental High School Science Exhibition, one of the exhibit works, "Inscribed Circles in Triangles", shows that the centers of the consecutive inscribed circles has something to do with the parabola's trajectory. To learn more about inscribed circles and parabolas, I referred to literature. By accident, I am faced with the problem on six circles theorem, in the book The Small Flower of Plane Geometry(平面幾何中的小花). Out of my interest in this problem, I tried to prove it. The other results are as follows: With the initial circle of six circles moved, in certain circumstances, the six circles merge into three. Further in studying this coincidence leads to an algebraic method to solve the Malfatti's Problem. Applying six circles theorem to the odd-number-sided polygons exists the same characteristic. It indicates that the inscribed circles will form a cycle. However, it hasn’t been successfully proven. The even-number-sided polygons show no similar results.