单词 | Circle Cutting | ||||||||||||||||||||||||||||||||||||
释义 | Circle Cutting![]() Determining the maximum number of pieces in which it is possible to divide a Circle for a given number of cuts iscalled the circle cutting, or sometimes Pancake Cutting, problem. The minimum number is always
Therefore,
Evaluating for ![]() ![]() A related problem, sometimes called Moser's Circle Problem, is to find the number of pieces into which a Circleis divided if
(Yaglom and Yaglom 1987, Guy 1988, Conway and Guy 1996, Noy 1996), where ![]() ![]() ![]()
Conway, J. H. and Guy, R. K. ``How Many Regions.'' In The Book of Numbers. New York: Springer-Verlag, pp. 76-79, 1996. Guy, R. K. ``The Strong Law of Small Numbers.'' Amer. Math. Monthly 95, 697-712, 1988. Noy, M. ``A Short Solution of a Problem in Combinatorial Geometry.'' Math. Mag. 69, 52-53, 1996. Sloane, N. J. A. SequencesA000124/M1041and A000127/M1119in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995. Yaglom, A. M. and Yaglom, I. M. Problem 47. Challenging Mathematical Problems with Elementary Solutions, Vol. 1. New York: Dover, 1987. |
||||||||||||||||||||||||||||||||||||
随便看 |
|
数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。