Please use this identifier to cite or link to this item:

Title: 一個點線面的切割問題
A Partition Problem with Points,Lines and Planes
Authors: 李昱欣
Li, Yu Shin
Contributors: 李陽明
Li, Yu Shin
Keywords: 切割問題
Partition Problem
Points,Lines,and Planes
Date: 2013
Issue Date: 2013-11-01 11:49:23 (UTC+8)
Abstract: 在這篇論文中,我們希望用不同角度來重新探討一個古典的數學問題;點、線、面切割最多區域問題,雖然這個問題已經經由許多方法得到公式,例如:遞迴關係、差分方程式、歐拉公式、標準n維空間切割系統等等,並延伸出其他方面的問題,可以運用在很多地方,所以我們希望可以再找到更簡單易懂的論證方式,可以讓國中學生也能理解。
In this research, we will discuss a classical mathematical question from different aspects. The question of maximizing the number of regions made up by points, lines and planes has been proved and developed many formulas, using Recurrence Relations, Difference Equations, and Euler's Formula etc., which can extend to other questions and apply to many areas. Therefore, we hope to find an easier way to prove it which may help middle school students to understand better.
We find that we can use the concept of inequality from what the students learn so far. By defining a logical system and using Induction, we can prove this mathematical formula in an easier and more direct way. Finally we hope it can be generalized to n-dimensional space.
Reference: [1]Stephen H. Friedberg, Arnold J. Insel, and Lawerence E. Spence, Linear Algebra, 3rd ed.,Prentice-Hall,1997,47-48.
[2]Alan Tucker (2007,5th edition). Applied Combinatorics. John Wiley & Sons Inc.
[3] Grimaldi, R. P., Recurrence relations. In Handbook of Discrete and Combinatorial
Mathematics by Rosen, K. H. (Editor). Boca Raton, Florida: CRC, 1999.
[4]王佑欣,民國91年(2002),Combinatorial Argument of Partition with Point ,Line and Space,政大應數所碩士論文。
[8]游森棚,談談九十五學年度高中數學新課程大綱的“遞迴”。2008 February 25。Available from:
Description: 碩士
Source URI:
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File SizeFormat
200701.pdf1219KbAdobe PDF587View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing