Free Delivery Over $100
|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! The Kobon triangle problem is an unsolved problem in combinatorial geometry first stated by Kobon Fujimura. The problem asks for the largest number N(k) of nonoverlapping triangles that can be produced by k straight line segments. Saburo Tamura proved that the largest integer not exceeding k(k ae' 2)/3 provides an upper bound on the maximal number of nonoverlapping triangles realizable by k lines. This sequence is captured in the On-Line Encyclopedia of Integer Sequences as A032765. In 2007, a tighter upper bound was found by Johannes Bader and Gilles Clement, by proving that Tamura's upper bound couldn't be reached for any k congruent to 0 or 2 (mod 6). Full Product DetailsAuthor: Lambert M. Surhone , Mariam T. Tennoe , Susan F. HenssonowPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.40cm , Length: 15.20cm Weight: 0.114kg ISBN: 9786131257186ISBN 10: 6131257183 Pages: 68 Publication Date: 25 November 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
