【專題演講】Construction and Deconstruction of Collatz Tree-陳武強 副教授 (蘭陽技術學院通識中心數學組)
講題：Construction and Deconstruction of Collatz Tree
講者：陳武強 副教授 (蘭陽技術學院通識中心數學組)
時間：111年03月07日(星期一)下午15：40-17：10
地點：民生校區五育樓4樓402教室
摘要：
The Collatz conjecture is said to be the simplest open problem. It is a fun quiz game to surprise our friends as anyone with knowledge of elementary mathematics can easily understand the question. Although plenty of findings have been provided in scientific research papers when the conjecture was first proposed in 1937, there is no complete evidence to prove it is true, nor is there any counterexample to suggest it is incorrect.
In this presentation, we first identify the original structure and the mode of operations of the conjecture based on its definition and modification (hereafter Collatz process). Next, we create a tree structure to help investigate and explore the inner structure of the sequence (hereafter Collatz tree). Then by applying specific countable partitions of nonnegative integers and positive odd integers, we verify the coverage of all positive integers without any repetition in the Collatz tree and the existence of a unique (2,1) cycle. As a result, we can provide complete evidence for solving this world-famous long-standing unsettled problem.
講者：陳武強 副教授 (蘭陽技術學院通識中心數學組)
時間：111年03月07日(星期一)下午15：40-17：10
地點：民生校區五育樓4樓402教室
摘要：
The Collatz conjecture is said to be the simplest open problem. It is a fun quiz game to surprise our friends as anyone with knowledge of elementary mathematics can easily understand the question. Although plenty of findings have been provided in scientific research papers when the conjecture was first proposed in 1937, there is no complete evidence to prove it is true, nor is there any counterexample to suggest it is incorrect.
In this presentation, we first identify the original structure and the mode of operations of the conjecture based on its definition and modification (hereafter Collatz process). Next, we create a tree structure to help investigate and explore the inner structure of the sequence (hereafter Collatz tree). Then by applying specific countable partitions of nonnegative integers and positive odd integers, we verify the coverage of all positive integers without any repetition in the Collatz tree and the existence of a unique (2,1) cycle. As a result, we can provide complete evidence for solving this world-famous long-standing unsettled problem.
瀏覽數:
