猜牌術
This research mainly talks about how someone, by observing the non-congruent patterns on the backs of the playing cards and by working with the dealer on a pre-arranged lay out, can call out the cards as if he possessed the magic power to see through them. During the card-predicting game, one can use the patterns on the backs of the cards as visual clues (Observing whether it was places upside down or not)to help figure out the probability of where the card is going to show up. Suck a mathematical formula is known as the Pigeonhole Principle. Upon an analysis of the formula, we find that when given that the value of n is greater than 24, we can successfully call out a number of cards that is greater than 2n/3 . The possibility of such mathematical studies in other directions is endless. 中文摘要: 本研究主要探討利用橋牌非對稱的牌背,猜牌者經由和傳遞牌的人的一種事先約定的方 式(排法),彷彿(魔術)透視般的將一疊牌的花色逐步猜出。其猜牌過程是利用牌背 圖案的朝前朝後的指示,配合適當的猜牌張的分配,而運用到的數學法則包含鴿籠原 理,分析與討論歸納。最後我們得到一疊由四種花色張數相等所混合的n 張牌,可猜出 的張數恆大於 2n/3 (n>24 時)。後續可研究的方向仍然甚廣。
棋子跳躍問題
This is a study about the solution to a chess flipping game. The game is based on a 4*4 game grid. First, place some chesses on the grid randomly to start a game. Move any chess by jumping over one or two neighboring chesses in the same row (left or right), same column (up or down), or on the same diagonal. Chesses which get jumped over should be flipped. The ultimate aim is to make all the chesses upside down. In this study, I try to find the rules of the beginning arrangement that ensure solution. Here are the steps I take: First, break the restriction of the 4*4 grid, and set the coordinate system. Second, find out a few “basic illustrations” that can be solved and moved in order to cope with certain complicated problems. Third, with “basic illustrations”, find the rules applying to games on n*n grid. 這是關於翻棋遊戲的可行解之探討。棋盤是一個4*4 的方格,遊戲開始時在棋盤上任意擺上一些棋子,均是正面朝上,利用相鄰棋子的水平、垂直、斜向跳躍,棋子被跳躍過一次則翻面一次,遊戲目的在於使所有的棋子都翻為反面。我要探討的是關於棋局可解不可解的問題,找出棋盤上可解棋局的規則。研究步驟大致如下:一、打破棋盤4*4 的限制,將棋盤座標化。二、找出若干個可解並可移動的「基本圖」。三、利用基本圖,找出n 列棋盤可解的規律。
數字波的節點探討
數字波是探討在直線上的起始點、位移速度、總數相互變化的節點關係。在直線上,將全部格子數做為總數(m),開始彈跳的點為起始點(i),每次彈跳的格子數為位移速度(s),被踩到的格子就是節點。節點是由位移速度和起始點決定,起始點本身可視為節點之一,之後的節點是由起始點加n 個位移速度產生。我們分別以三種型式討論:起始點等於位移速度,總數增加:使起始點和位移速度所代表的數字相同的彈跳。節點呈2、s、s+2…起始點固定,位移速度與總數增加:觀察位移速度和總數的關係。兩節點的和=s+2位移速度固定,起始點與總數增加:探討起始點和總數的關係。發現節點隨起始點有規律的變化在上述討論的型式中,我們再進一步將位移速度分為質數和合數,進而依其因數變化,可觀測到很多特殊的節點變化。The number wave is to discuss the relationship of the starting point, the moving speed, and the variations of total amount. In straight lines, let all the trellises be total amount (m), and let the starting jumping point be the starting point (i). The trellis number of each jump is the moving speed(s). The trodden trellises are knots. And knots are decided by the moving speed and the starting point. The starting point itself can be viewed as a knot. The following knots produce with the starting point and n moving speeds. We respectively discuss them in three types: When the starting point equals the moving speed, the total amount increases. The number of the starting point is the same with the jumping moving point; the knots are 2, s, s+2…. When the starting point is fixed, the moving speed and the total number increase. From observing the relationship between the moving speed and the total number, the sum of two knots is s+2. When the moving speed is fixed, the starting point and the total number increase. After our research into the relationship between the starting point and the total amount, we find the knots have regular variations with the starting point. From the types discussed above, we further divide the moving speed into prime numbers and non-prime numbers. Furthermore, according to the factor variations, we can see a lot of specific knot variations.
對號入座
After reading “CKSH Communication 20 “, we are interested in Question 5 . We try to explain that in all the No. Crunches, whether we can put the numbers in the No. Crunches any certain position. We specify the question, according to the “Point Symmitry Homing” in mxn No. Crunches, to find the correlated characters of the rules. Finally, we find a “switch” – we can get the better way to rotate the numbers quickly by some programs.從「建中通訊解題」第20 期第5 題出發,本研究嘗試去解釋對所有的數字轉盤而言,是否能將其中的數字歸位到任意指定的位置?接下來將題目特殊化,藉由m× n 數字轉盤的「點對稱歸位」,尋找遊戲規則衍生出的相關性質。最後,利用研究出的性質找到一個「判斷式」可藉由程式設計,快速的找到較佳轉法。
曲率的奧秘
我們研究的主題是曲率,且以高中所學的函數為主。雖然大學已有曲率公式,但我們將其表示成高中生較易了解的型式,並且以f(x) 的方式呈現。我們在函數曲線上取不共線三點,構成一個三角形,並求出此三角形的外接圓半徑。再將所取三點逼近,所求之半徑即為特定點的密切圓,也就是曲率半徑。而此曲率半徑的倒數,就是所求的曲率,同時我們將公式帶入高中各常見函數,以導出函數上各點曲率。;Our study is about curvature, especially about the fuctions we learn in senior high school. In university, there is a certain formula for curvature, but we hope to change it into a form that can be easily accepted by senior high school students, and express the formula with f(x), the symbol of functions. We pick three incollinear points from the curve of a function, making the three points into a triangle, and figure out the circumradius of this triangle. Then, we approximate the three points to one of them, and the circumradius will also be the radius of the osculating circle of the point. We define the radius as radius of curvature. The reciprocal of the radius of curvature will be the curvature. Then, we use the formula to figure out the curvature of the functions we learn in senior high school.