|Title:||A Puzzle, A Sequence and some Consequences
|Authors:||Alfred M. Bruckstein
|Abstract:||We are given n rods of lengths 1,2,3,4 ... n. How many different, nondegenerate triangles can we make by choosing three of them? The answer to this question, T(n), and the resulting sequence of integers, are related to several interesting combinatorial results.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1998/CIS/CIS9817), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 1998
To the main CS technical reports page
Computer science department, Technion